Learning discrete categorial grammars from structures
DOI10.1051/ITA:2007055zbMATH Open1148.68027OpenAlexW2040124340MaRDI QIDQ3514641FDOQ3514641
Authors: Jérôme Besombes, Jean-Yves Marion 
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
Recommendations
- scientific article; zbMATH DE number 1233727
- Distributional learning of abstract categorial grammars
- On learnability of restricted classes of categorial grammars
- Learning categorial grammar by unification with negative constraints
- scientific article; zbMATH DE number 1735823
- Learning of Structurally Unambiguous Probabilistic Grammars
- Learning conjunctive grammars and contextual binary feature grammars
- scientific article; zbMATH DE number 1689576
- Learning context free grammars with the syntactic concept lattice
- Logical Aspects of Computational Linguistics
Computational learning theory (68Q32) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Logic of natural languages (03B65) Grammars and rewriting systems (68Q42)
Cites Work
- Language identification in the limit
- Inference of Reversible Languages
- Efficient learning of context-free grammars from positive structural examples
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Categorial grammars determined from linguistic data by unification
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
This page was built for publication: Learning discrete categorial grammars from structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3514641)
