Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
On multiple context-free grammars
Theoretical Computer Science
Weighted deductive parsing and Knuth's algorithm
Computational Linguistics
Head-driven statistical models for natural language parsing
Head-driven statistical models for natural language parsing
An annotation scheme for free word order languages
ANLC '97 Proceedings of the fifth conference on Applied natural language processing
Characterizing structural descriptions produced by various grammatical formalisms
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
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
The Penn Treebank: annotating predicate argument structure
HLT '94 Proceedings of the workshop on Human Language Technology
A survey on tree edit distance and related problems
Theoretical Computer Science
Probabilistic models of word order and syntactic discontinuity
Probabilistic models of word order and syntactic discontinuity
Computing the most probable parse for a discontinuous phrase structure grammar
New developments in parsing technology
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
Optimal reduction of rule length in linear context-free rewriting systems
NAACL '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Parsing three German treebanks: lexicalized and unlexicalized baselines
PaGe '08 Proceedings of the Workshop on Parsing German
Discontinuity revisited: an improved conversion to context-free representations
LAW '07 Proceedings of the Linguistic Annotation Workshop
A dependency-based method for evaluating broad-coverage parsers
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
An incremental earley parser for simple range concatenation grammar
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Characterizing discontinuity in constituent treebanks
FG'09 Proceedings of the 14th international conference on Formal grammar
Statistical parsing of morphologically rich languages (SPMRL): what, how and whither
SPMRL '10 Proceedings of the NAACL HLT 2010 First Workshop on Statistical Parsing of Morphologically-Rich Languages
Data-driven parsing with probabilistic linear context-free rewriting systems
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
PLCFRS parsing of English discontinuous constituents
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Discontinuous data-oriented parsing: a mildly context-sensitive all-fragments grammar
SPMRL '11 Proceedings of the Second Workshop on Statistical Parsing of Morphologically Rich Languages
Efficient parsing with linear context-free rewriting systems
EACL '12 Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics
Data-driven parsing using probabilistic linear context-free rewriting systems
Computational Linguistics
| Hi-index | 0.00 |
Discontinuities occur especially frequently in languages with a relatively free word order, such as German. Generally, due to the longdistance dependencies they induce, they lie beyond the expressivity of Probabilistic CFG, i.e., they cannot be directly reconstructed by a PCFG parser. In this paper, we use a parser for Probabilistic Linear Context-Free Rewriting Systems (PLCFRS), a formalism with high expressivity, to directly parse the German NeGra and TIGER treebanks. In both treebanks, discontinuities are annotated with crossing branches. Based on an evaluation using different metrics, we show that an output quality can be achieved which is comparable to the output quality of PCFG-based systems.