A computational algebraic approach to Latin grammar

DOI10.1007/S11168-005-1286-0zbMATH Open1083.68129OpenAlexW2009305298MaRDI QIDQ812147FDOQ812147

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

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

zbMATH Keywords

inflectionfeaturespartial orderconjugationpregrouplogical type

Mathematics Subject Classification ID

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

Cites Work

• The Mathematics of Sentence Structure
• Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic
• A tale of four grammars
• Title not available (Why is that?)
• Type grammars as pregroups
• Title not available (Why is that?)

Cited In (8)

• Title not available (Why is that?)
• Applying pregroups to Italian statements and questions
• Word order alternation in Sanskrit via precyclicity in pregroup grammars
• From word to sentence. A computational algebraic approach to grammar
• Functional morphology
• Should pregroup grammars be adorned with additional operations?
• Efficiency of pregroups and the French noun phrase
• Lambek vs. Lambek: functorial vector space semantics and string diagrams for Lambek calculus

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)