Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Counting with range concatenation grammars
Theoretical Computer Science - Algebraic methods in language processing
Polynomial-time identification of very simple grammars from positive data
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Marcus External Contextual Grammars: From One to Many Dimensions
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Polynomial Identification in the Limit of Substitutable Context-free Languages
The Journal of Machine Learning Research
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Integration of the dual approaches in the distributional learning of context-free grammars
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
| Hi-index | 0.00 |
Contextual Binary Feature Grammars were recently proposed by (Clark et al., 2008) as a learnable representation for richly structured context-free and context sensitive languages. In this paper we examine the representational power of the formalism, its relationship to other standard formalisms and language classes, and its appropriateness for modelling natural language.