Learnability of type-logical grammars
From MaRDI portal
Publication:4923558
DOI10.1016/S1571-0661(05)82577-0zbMath1263.03025MaRDI QIDQ4923558
Publication date: 24 May 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Related Items (4)
Grammar induction by unification of type-logical lexicons ⋮ Good Types Are Useful for Learning ⋮ Learning Lambek Grammars from Proof Frames ⋮ Semantic bootstrapping of type-logical grammar
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Language in action
- Untersuchungen über das logische Schliessen. I
- Proof nets for the multimodal Lambek calculus
- Categorial grammars determined from linguistic data by unification
- The Mathematics of Sentence Structure
- Language identification in the limit
This page was built for publication: Learnability of type-logical grammars