Learning discrete categorial grammars from structures

DOI10.1051/ita:2007055zbMath1148.68027OpenAlexW2040124340MaRDI QIDQ3514641

Jean-Yves Marion, Jérôme Besombes

Publication date: 21 July 2008

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92858

zbMATH Keywords

reversible class of languages

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient learning of context-free grammars from positive structural examples
• Categorial grammars determined from linguistic data by unification
• Inference of Reversible Languages
• Language identification in the limit

This page was built for publication: Learning discrete categorial grammars from structures