Learning Lambek Grammars from Proof Frames

DOI10.1007/978-3-642-54789-8_7zbMath1285.03024arXiv1310.0576OpenAlexW2963897145MaRDI QIDQ5414961

Christian Retoré, Roberto Bonato

Publication date: 8 May 2014

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

Full work available at URL: https://arxiv.org/abs/1310.0576

Mathematics Subject Classification ID

Computational learning theory (68Q32) Logic of natural languages (03B65) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The logic of categorial grammars. A deductive account of natural language syntax and semantics
• A linear algorithm for MLL proof net correctness and sequentialization
• Finding patterns common to a set of strings
• Categorial grammars determined from linguistic data by unification
• Using Tree Transducers for Grammatical Inference
• The Mathematics of Sentence Structure
• How to Split Recursive Automata
• Inductive inference of formal languages from positive data
• The correspondence between cut-elimination and normalization
• Learnability of type-logical grammars
• Language identification in the limit

This page was built for publication: Learning Lambek Grammars from Proof Frames