On multiple context-free grammars
Theoretical Computer Science
Introduction to algorithms
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
Integrating "free" word order syntax and information structure
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Long-distance scrambling and tree adjoining grammars
EACL '91 Proceedings of the fifth 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
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Guided parsing of range concatenation languages
ACL '01 Proceedings of the 39th 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
Accurate unlexicalized parsing
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
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
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Non-projective dependency parsing using spanning tree algorithms
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Multilevel coarse-to-fine PCFG parsing
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of 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
PaGe '08 Proceedings of the Workshop on Parsing German
Parsing German with latent variable grammars
PaGe '08 Proceedings of the Workshop on Parsing German
Parsing three German treebanks: lexicalized and unlexicalized baselines
PaGe '08 Proceedings of the Workshop on Parsing German
A dependency-driven parser for German dependency and constituency representations
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
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
The simple truth about dependency and phrase structure representations: an opinion piece
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
SPMRL '10 Proceedings of the NAACL HLT 2010 First Workshop on Statistical Parsing of Morphologically-Rich Languages
Direct parsing of discontinuous constituents in German
SPMRL '10 Proceedings of the NAACL HLT 2010 First Workshop on Statistical Parsing of Morphologically-Rich Languages
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
Parsing Beyond Context-Free Grammars
Parsing Beyond Context-Free Grammars
Characterizing discontinuity in constituent treebanks
FG'09 Proceedings of the 14th international conference on Formal grammar
Language-independent parsing with empty elements
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
Evaluating dependency parsing: robust and heuristics-free cross-nnotation evaluation
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
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
| Hi-index | 0.00 |
This paper presents the first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear Context-Free Rewriting Systems PLCFRSs. LCFRS, an extension of CFG, can describe discontinuities in a straightforward way and is therefore a natural candidate to be used for data-driven parsing. To speed up parsing, we use different context-summary estimates of parse items, some of them allowing for A* parsing. We evaluate our parser with grammars extracted from the German NeGra treebank. Our experiments show that data-driven LCFRS parsing is feasible and yields output of competitive quality.