\(k\)-valued non-associative Lambek grammars are learnable from generalized functor-argument structures

DOI10.1016/j.tcs.2006.01.006zbMath1088.68077OpenAlexW2027503246MaRDI QIDQ2369010

Denis Béchet, Annie Foret

Publication date: 28 April 2006

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.01.006

zbMATH Keywords

Grammatical inferenceCategorial grammarsLearning from positive examplesModel of GoldNon-associative Lambek calculus

Mathematics Subject Classification ID

Computational learning theory (68Q32) Grammars and rewriting systems (68Q42) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Cites Work

• 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
• Inference of Reversible Languages
• Non‐associative Lambek Categorial Grammar in Polynomial Time
• Language identification in the limit
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item