A computational algebraic approach to Latin grammar

DOI10.1007/S11168-005-1286-0zbMath1083.68129OpenAlexW2009305298MaRDI QIDQ812147

Claudia Casadio

Publication date: 23 January 2006

Published in: Research on Language and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11168-005-1286-0

zbMATH Keywords

inflectionfeaturespartial orderconjugationpregrouplogical type

Mathematics Subject Classification ID

Logic of natural languages (03B65) Natural language processing (68T50)

Related Items (5)

Lambek vs. Lambek: functorial vector space semantics and string diagrams for Lambek calculus ⋮ Applying pregroups to Italian statements and questions ⋮ Should pregroup grammars be adorned with additional operations? ⋮ Word Order Alternation in Sanskrit via Precyclicity in Pregroup Grammars ⋮ Efficiency of pregroups and the French noun phrase

Cites Work

• A tale of four grammars
• The Mathematics of Sentence Structure
• Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic
• Type grammars as pregroups
• Unnamed Item
• Unnamed Item

This page was built for publication: A computational algebraic approach to Latin grammar