k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures

DOI10.1016/S1571-0661(04)80844-2zbMath1264.68091MaRDI QIDQ4924528

Denis Béchet, Annie Foret

Publication date: 6 June 2013

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

zbMATH Keywords

grammatical inferencecategorial grammarscomputational linguisticnon-associative Lambek calculuslearning from positive examplesmodel of Gold

Mathematics Subject Classification ID

Computational learning theory (68Q32) Logic of natural languages (03B65) Natural language processing (68T50) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Related Items

On learnability of restricted classes of categorial grammars ⋮ On families of categorial grammars of bounded value, their learnability and related complexity questions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inductive inference of monotonic formal systems from positive data
• Classical non-associative Lambek calculus
• Categorial grammars determined from linguistic data by unification
• The Mathematics of Sentence Structure
• Inductive inference of formal languages from positive data
• Non‐associative Lambek Categorial Grammar in Polynomial Time
• Language identification in the limit