Learning Conjunctive Grammars and Contextual Binary Feature Grammars
From MaRDI portal
Publication:2799213
DOI10.1007/978-3-319-15579-1_49zbMath1425.68151OpenAlexW795187647MaRDI QIDQ2799213
Publication date: 8 April 2016
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-15579-1_49
Related Items (2)
Generalized LR parsing algorithm for grammars with one-sided contexts ⋮ The Strong, Weak, and Very Weak Finite Context and Kernel Properties
Cites Work
- Unnamed Item
- Unnamed Item
- Distributional learning of parallel multiple context-free grammars
- The dual of concatenation
- Integration of the Dual Approaches in the Distributional Learning of Context-Free Grammars
- Learning Context Free Grammars with the Finite Context Property: A Correction of A. Clark’s Algorithm
- A Learnable Representation for Syntax Using Residuated Lattices
- Learning Context Free Grammars with the Syntactic Concept Lattice
- Towards General Algorithms for Grammatical Inference
- Towards Dual Approaches for Learning Context-Free Grammars Based on Syntactic Concept Lattices
This page was built for publication: Learning Conjunctive Grammars and Contextual Binary Feature Grammars