LFP: a logic for linguistic descriptions and an analysis of its complexity
Computational Linguistics
Counting with range concatenation grammars
Theoretical Computer Science - Algebraic methods in language processing
Characterizing mildly context-sensitive grammar formalisms
Characterizing mildly context-sensitive grammar formalisms
Chinese number-names, tree adjoining languages, and mild context-sensitivity
Computational Linguistics
Chinese numbers, MIX, scrambling, and range concatenation grammars
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Characterizing structural descriptions produced by various grammatical formalisms
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Efficient and robust LFG parsing: SxLfg
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
An optimal-time binarization algorithm for linear context-free rewriting systems with fan-out two
ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - Volume 2
Parsing directed acyclic graphs with range concatenation grammars
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Multi-component tree insertion grammars
FG'09 Proceedings of the 14th international conference on Formal grammar
The generative capacity of the lambek-grishin calculus: a new lower bound
FG'09 Proceedings of the 14th international conference on Formal grammar
Linguistic facts as predicates over ranges of the sentence
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
A grammar-based approach to invertible programs
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Mildly non-projective dependency grammar
Computational Linguistics
| Hi-index | 0.00 |
We present Range Concatenation Grammars, a syntactic formalism which possesses many attractive features, among which we emphasize here generative capacity and closure properties. For example, Range Concatenation Grammars have stronger generative capacity than Linear Context-Free Rewriting Systems, although this power is not to the detriment of efficiency, since the generated languages can always be parsed in polynomial time. Range Concatenation Languages are closed under both intersection and complementation, and these closure properties suggest novel ways to describe some linguistic phenomena. We also present a parsing algorithm which is the basis for our current prototype implementation.