Learnability of pregroup grammars

DOI10.1007/S11225-007-9085-2MaRDI QIDQ2467214zbMATHOpenAlexFDO

Authors Denis Béchet, Annie Foret, Isabelle Tellier

Publication date 21 January 2008

Published in Studia Logica (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/inria-00191112/file/bechet-foret-tellier.pdf

zbMATH Keywords

constraintsparsingpregroup grammarscomputational linguisticscategorial grammarslearning from positive examples

Mathematics Subject Classification ID

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

Recommendations

• Grammatical Inference: Algorithms and Applications
• Pregroup grammars and Chomsky's earliest examples
• scientific article; zbMATH DE number 1786547
• scientific article; zbMATH DE number 1953885
• Linear processing with pregroups

Cites work

• scientific article; zbMATH DE number 1735906 (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 2019616 (Why is no real title available?)
• scientific article; zbMATH DE number 1786545 (Why is no real title available?)
• scientific article; zbMATH DE number 1786547 (Why is no real title available?)
• scientific article; zbMATH DE number 1786548 (Why is no real title available?)
• Categorial grammars determined from linguistic data by unification
• Grammatical Inference: Algorithms and Applications
• Language identification in the limit
• Logical Aspects of Computational Linguistics
• Parsing pregroup grammars and Lambek calculus using partial composition
• Sequent systems for compact bilinear logic
• Toward discourse representation via pregroup grammars
• Type grammars as pregroups

Cited in

(6)

• Pregroup grammars, their syntax and semantics
• Pregroup Grammars with Letter Promotions
• Good types are useful for learning
• Grammatical Inference: Algorithms and Applications
• A Savateev-style parsing algorithm for pregroup grammars
• Grammatical Inference: Algorithms and Applications

This page was built for publication: Learnability of pregroup grammars

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