On multiple context-free grammars
Theoretical Computer Science
Characterizing structural descriptions produced by various grammatical formalisms
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Parsing mildly context-sensitive languages with thread automata
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
A parsing: fast exact Viterbi parse selection
NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
Treebank grammar techniques for non-projective dependency parsing
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Parsing linear context-free rewriting systems
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Stochastic multiple context-free grammar for RNA pseudoknot modeling
TAGRF '06 Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms
Efficient parsing of well-nested linear context-free rewriting systems
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Direct parsing of discontinuous constituents in German
SPMRL '10 Proceedings of the NAACL HLT 2010 First Workshop on Statistical Parsing of Morphologically-Rich Languages
| Hi-index | 0.00 |
We present an Earley-style parser for simple range concatenation grammar, a formalism strongly equivalent to linear context-free rewriting systems. Furthermore, we present different filters which reduce the number of items in the parsing chart. An implementation shows that parses can be obtained in a reasonable time.