Contextual grammars and natural languages
Handbook of formal languages, vol. 2
Contextual grammars and formal languages
Handbook of formal languages, vol. 2
On computational complexity of contextual languages
Theoretical Computer Science - Special issue: formal language theory
On representing recursively enumerable languages by internal contextual languages
Theoretical Computer Science
An efficient context-free parsing algorithm
Communications of the ACM
Marcus Contextual Grammars
Handbook of Formal Languages
Contextual Grammars with Distributed Catenation and Shuffle
Contextual Grammars with Distributed Catenation and Shuffle
Contextual grammars as generative models of natural languages
Computational Linguistics
Parsing Local Internal Contextual Languages with Context-Free Choice
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
k-local internal contextual grammars
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Parsing Local Internal Contextual Languages with Context-Free Choice
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
| Hi-index | 0.00 |
Here we explore an efficient parser for a variant of contextual grammars (CGs) which is available via the internet. Contextual Grammar with context-free selectors allows for a simple representation of many non-context-free phenomena such as the copy language. Up to now, this specific type of selectors has hardly ever been addressed because even for simpler types no efficient parsing algorithms were known. In this paper, we describe a new polynomial parser which is based on the Earley algorithm. Furthermore we illustrate the linguistic relevance of Contextual Grammars with context-free selectors.