Learnability of type-logical grammars

DOI10.1016/S1571-0661(05)82577-0MaRDI QIDQ4923558zbMATH OpenFDO

Authors Sean A. Fulop

Publication date 24 May 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Logic of natural languages (03B65)

Recommendations

• Grammar induction by unification of type-logical lexicons
• Identification in the limit of categorial grammars
• scientific article; zbMATH DE number 1233727
• Tarski's principle, categorial grammars and learnability
• Semantic bootstrapping of type-logical grammar

Cites work

• scientific article; zbMATH DE number 3470040 (Why is no real title available?)
• scientific article; zbMATH DE number 1233727 (Why is no real title available?)
• scientific article; zbMATH DE number 976409 (Why is no real title available?)
• scientific article; zbMATH DE number 1042221 (Why is no real title available?)
• scientific article; zbMATH DE number 842687 (Why is no real title available?)
• scientific article; zbMATH DE number 3333259 (Why is no real title available?)
• Categorial grammars determined from linguistic data by unification
• Language identification in the limit
• Language in action
• Proof nets for the multimodal Lambek calculus
• The Mathematics of Sentence Structure
• Untersuchungen über das logische Schliessen. I

Cited in

(6)

• Learning Lambek grammars from proof frames
• Grammatical Inference: Algorithms and Applications
• Semantic bootstrapping of type-logical grammar
• Good types are useful for learning
• scientific article; zbMATH DE number 1786531 (Why is no real title available?)
• Grammar induction by unification of type-logical lexicons

This page was built for publication: Learnability of type-logical grammars

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