On learnability of restricted classes of categorial grammars

DOI10.1007/s11225-007-9036-yzbMath1118.68512OpenAlexW2060744200WikidataQ126268529 ScholiaQ126268529MaRDI QIDQ2642526

Barbara Dziemidowicz-Gryz

Publication date: 17 August 2007

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-007-9036-y

zbMATH Keywords

learning algorithmunificationcategorial grammarlearning function

Mathematics Subject Classification ID

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

Cites Work

• Identification in the limit of categorial grammars
• Categorial grammars determined from linguistic data by unification
• Learning categorial grammar by unification with negative constraints
• k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures
• Language identification in the limit
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On learnability of restricted classes of categorial grammars