A computational algebraic approach to Latin grammar

DOI10.1007/S11168-005-1286-0MaRDI QIDQ812147zbMATH OpenOpenAlexFDO

Authors Claudia Casadio, J. Lambek

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)

Recommendations

• From word to sentence. A computational algebraic approach to grammar
• scientific article; zbMATH DE number 1786545
• A tale of four grammars
• scientific article; zbMATH DE number 1786548
• Language and grammar. Studies in mathematical linguistics and natural language

Cites work

• scientific article; zbMATH DE number 1786545 (Why is no real title available?)
• scientific article; zbMATH DE number 3024527 (Why is no real title available?)
• A tale of four grammars
• Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic
• The Mathematics of Sentence Structure
• Type grammars as pregroups

Cited in

(8)

• Applying pregroups to Italian statements and questions
• Functional morphology
• Lambek vs. Lambek: functorial vector space semantics and string diagrams for Lambek calculus
• From word to sentence. A computational algebraic approach to grammar
• 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
• scientific article; zbMATH DE number 43665 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q812147)