Data-Driven Parsing using Probabilistic Linear Context-Free Rewriting Systems

@article{Kallmeyer2013DataDrivenPU,
  title={Data-Driven Parsing using Probabilistic Linear Context-Free Rewriting Systems},
  author={Laura Kallmeyer and Wolfgang Maier},
  journal={Computational Linguistics},
  year={2013},
  volume={39},
  pages={87-119}
}
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… Expand
39 Citations
Efficient parsing with Linear Context-Free Rewriting Systems
  • 29
  • Highly Influenced
  • PDF
PLCFRS Parsing Revisited: Restricting the Fan-Out to Two
  • 22
  • PDF
Discontinuous Parsing with an Efficient and Accurate DOP Model
  • 24
  • PDF
LR Parsing for LCFRS
  • 5
  • PDF
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems
  • 5
  • PDF
Data-Oriented Parsing with Discontinuous Constituents and Function Tags
  • 26
  • Highly Influenced
  • PDF
Synchronous Linear Context-Free Rewriting Systems for Machine Translation
  • 12
  • PDF
LCFRS binarization and debinarization for directional parsing
  • Universiẗat Düsseldorf
  • 2013
  • 1
  • PDF
LCFRS binarization and debinarization for directional parsing
  • PDF
...
1
2
3
4
...

References

SHOWING 1-10 OF 91 REFERENCES
Optimal Reduction of Rule Length in Linear Context-Free Rewriting Systems
  • 30
  • PDF
PLCFRS Parsing of English Discontinuous Constituents
  • 32
  • PDF
Parsing Beyond Context-Free Grammars
  • 113
  • PDF
Principles and Implementation of Deductive Parsing
  • 353
  • PDF
...
1
2
3
4
5
...