Learnability of type-logical grammars

DOI10.1016/S1571-0661(05)82577-0zbMATH Open1263.03025MaRDI QIDQ4923558FDOQ4923558

Authors: Sean A. Fulop 

Publication date: 24 May 2013

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

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

Mathematics Subject Classification ID

Logic of natural languages (03B65)

Cites Work

• Untersuchungen über das logische Schliessen. I
• Title not available (Why is that?)
• Language identification in the limit
• The Mathematics of Sentence Structure
• Title not available (Why is that?)
• Title not available (Why is that?)
• Proof nets for the multimodal Lambek calculus
• Title not available (Why is that?)
• Title not available (Why is that?)
• Language in action
• Categorial grammars determined from linguistic data by unification
• Title not available (Why is that?)

Cited In (6)

• Learning Lambek grammars from proof frames
• Grammatical Inference: Algorithms and Applications
• Good types are useful for learning
• Semantic bootstrapping of type-logical grammar
• Title not available (Why is that?)
• 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)