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

DOI10.1016/J.TCS.2006.01.006MaRDI QIDQ2369010zbMATH OpenOpenAlexFDO

Authors 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) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Grammars and rewriting systems (68Q42)

Recommendations

• \(K\)-valued non-associative Lambek grammars are learnable from function-argument structures
• Logical Aspects of Computational Linguistics
• Non‐associative Lambek Categorial Grammar in Polynomial Time
• A faithful representation of non-associative Lambek grammars in abstract categorial grammars
• On families of categorial grammars of bounded value, their learnability and related complexity questions
• Logical Aspects of Computational Linguistics
• The equivalence of Nonassociative Lambek Categorial Grammars and Context-Free Grammars
• Learning Lambek grammars from proof frames
• On learnability of restricted classes of categorial grammars
• scientific article; zbMATH DE number 1233727

Cites work

• scientific article; zbMATH DE number 4134014 (Why is no real title available?)
• scientific article; zbMATH DE number 67629 (Why is no real title available?)
• scientific article; zbMATH DE number 1233727 (Why is no real title available?)
• scientific article; zbMATH DE number 1341472 (Why is no real title available?)
• scientific article; zbMATH DE number 976409 (Why is no real title available?)
• scientific article; zbMATH DE number 2019598 (Why is no real title available?)
• scientific article; zbMATH DE number 3251420 (Why is no real title available?)
• Categorial grammars determined from linguistic data by unification
• Classical non-associative Lambek calculus
• Inductive inference of formal languages from positive data
• Inference of Reversible Languages
• Language identification in the limit
• Non‐associative Lambek Categorial Grammar in Polynomial Time
• The Mathematics of Sentence Structure

Cited in

(4)

• Learning Lambek grammars from proof frames
• \(K\)-valued non-associative Lambek grammars are learnable from function-argument structures
• Tarski's principle, categorial grammars and learnability
• Logical Aspects of Computational Linguistics

This page was built for publication: \(k\)-valued non-associative Lambek grammars are learnable from generalized functor-argument structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369010)