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
New figures of merit for best-first probabilistic chart parsing
Computational Linguistics
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 simple pattern-matching algorithm for recovering empty nodes and their antecedents
ACL '02 Proceedings of the 40th 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
Probabilistic parsing for German using sister-head dependencies
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
The Penn Treebank: annotating predicate argument structure
HLT '94 Proceedings of the workshop on Human Language Technology
Computing the most probable parse for a discontinuous phrase structure grammar
New developments in parsing technology
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
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
Discontinuity revisited: an improved conversion to context-free representations
LAW '07 Proceedings of the Linguistic Annotation Workshop
Stochastic multiple context-free grammar for RNA pseudoknot modeling
TAGRF '06 Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms
Direct parsing of discontinuous constituents in German
SPMRL '10 Proceedings of the NAACL HLT 2010 First Workshop on Statistical Parsing of Morphologically-Rich Languages
Characterizing discontinuity in constituent treebanks
FG'09 Proceedings of the 14th international conference on Formal grammar
Optimal head-driven parsing complexity for linear context-free rewriting systems
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
On Mildly Context-Sensitive Non-Linear Rewriting
Research on Language and Computation
PLCFRS parsing of English discontinuous constituents
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Prefix probabilities for linear context-free rewriting systems
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 |
This paper presents a first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear Context-Free Rewriting Systems (PLCFRS), together with context-summary estimates for parse items used to speed up parsing. LCFRS, an extension of CFG, can describe discontinuities both in constituency and dependency structures in a straightforward way and is therefore a natural candidate to be used for data-driven parsing. We evaluate our parser with a grammar extracted from the German NeGra treebank. Our experiments show that data-driven LCFRS parsing is feasible with a reasonable speed and yields output of competitive quality.