• Corpus ID: 6794841

PLCFRS Parsing Revisited: Restricting the Fan-Out to Two

@inproceedings{Maier2012PLCFRSPR,
  title={PLCFRS Parsing Revisited: Restricting the Fan-Out to Two},
  author={Wolfgang Maier and Miriam Kaeshammer and Laura Kallmeyer},
  booktitle={TAG},
  year={2012}
}
Linear Context-Free Rewriting System (LCFRS) is an extension of Context-Free Grammar (CFG) in which a non-terminal can dominate more than a single continuous span of terminals. Probabilistic LCFRS have recently successfully been used for the direct data-driven parsing of discontinuous structures. In this paper we present a parser for binary PLCFRS of fan-out two, together with a novel monotonous estimate for A parsing, with which we conduct experiments on modified versions of the German NeGra… 

Figures and Tables from this paper

Data-Driven Parsing with Probabilistic Linear Context-Free Rewriting Systems
TLDR
This paper presents the first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear Context-Free Rewriting Systems (PLCFRSs), and shows that data-driven LCFRS parsing is feasible and yields output of competitive quality.
LCFRS binarization and debinarization for directional parsing
TLDR
A debinarization procedure with which a non-binary LCFRS is obtained from a previously binarized one, and the resulting grammar retains the markovization information.
LCFRS binarization and debinarization for directional parsing
TLDR
A debinarization procedure with which a non-binary LCFRS is obtained from a previously binarized one, and the resulting grammar retains the markovization information.
Discontinuity (Re)²-visited: A Minimalist Approach to Pseudoprojective Constituent Parsing
In this paper, we use insights from Minimalist Grammars (Keenan and Stabler, 2003) to argue for a context-free approximation of discontinuous structures that is both easy to parse for
Wide-Coverage Neural A* Parsing for Minimalist Grammars
TLDR
This paper presents the first ever application of Minimalist Grammars to the task of realistic wide-coverage parsing, using a linguistically expressive yet highly constrained grammar, together with an adaptation of the A* search algorithm currently used in CCG parsing.
Wide-Coverage Neural A* Parsing for Minimalist Grammars
TLDR
This paper presents the first ever application of Minimalist Grammars to the task of realistic wide-coverage parsing, using a linguistically expressive yet highly constrained grammar, together with an adaptation of the A* search algorithm currently used in CCG parsing.
Data-Oriented Parsing with Discontinuous Constituents and Function Tags
TLDR
The two systems demonstrate that tree fragments as used in tree-substitution grammar improve disambiguation performance while capturing non-local relations on an as-needed basis.
Synchronous Linear Context-Free Rewriting Systems for Machine Translation
TLDR
This work presents a hierarchical aligner in form of a deduction system and finds that by restrictingk to 2 on both sides, 100% of the data can be covered.
Span-Based LCFRS-2 Parsing
TLDR
It is argued that grammar-based approaches still have something to contribute on top of what is offered by transition-based parsers, and by using a grammar formalism to restrict the space of possible trees the authors can use dynamic programming parsing algorithms for exact search for the most probable tree.
Parsing as Reduction
TLDR
This work reduces phrase-representation parsing to dependency parsing, and shows that any off-the-shelf, trainable dependency parser can be used to produce constituents, and can perform discontinuous parsing in a very natural manner.
...
1
2
3
...

References

SHOWING 1-10 OF 30 REFERENCES
Data-Driven Parsing with Probabilistic Linear Context-Free Rewriting Systems
TLDR
This paper presents the first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear Context-Free Rewriting Systems (PLCFRSs), and shows that data-driven LCFRS parsing is feasible and yields output of competitive quality.
Efficient parsing with Linear Context-Free Rewriting Systems
TLDR
This work shows that parsing long sentences with such an optimally binarized grammar remains infeasible, and introduces a technique which removes this length restriction, while maintaining a respectable accuracy.
Discontinuous Data-Oriented Parsing: A mildly context-sensitive all-fragments grammar
TLDR
This work applies Data-Oriented Parsing (DOP) to a grammar formalism that allows for discontinuous trees (LCFRS), and finds that the model is reasonably efficient, and surpasses the state of the art in discontinuous parsing.
PLCFRS Parsing of English Discontinuous Constituents
TLDR
This paper uses probabilistic linear context-free rewriting systems for data-driven parsing, following recent work on parsing German, and demonstrates that by discarding information on non-local dependencies the PCFG model loses important information on syntactic dependencies in general.
Direct Parsing of Discontinuous Constituents in German
TLDR
This paper uses a parser for Probabilistic Linear Context-Free Rewriting Systems (PLCFRS), a formalism with high expressivity, to directly parse the German NeGra and TIGER treebanks, and shows that an output quality can be achieved which is comparable to the output quality of PCFG-based systems.
Treebanks and Mild Context-Sensitivity
TLDR
A measure for the degree of a treebank’s mild contextsensitivity is presented and compared to similar measures used in non-projective dependency parsing and to discontinuous phrase structure grammar (DPSG).
Parsing Beyond Context-Free Grammars
TLDR
This book provides an extensive overview of the formal language landscape between CFG and PTIME, moving from Tree Adjoining Grammars to Multiple Context-Free grammars and then to Range Concatenation Grammar while explaining available parsing techniques for these formalisms.
Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems
TLDR
A chart-based parsing algorithm is presented that asymptotically improves the known running time upper bound for this class of rewriting systems and obtains a linear space construction of a binary normal form for the grammar at hand.
A* Parsing: Fast Exact Viterbi Parse Selection
TLDR
This work presents an extension of the classic A* search procedure to tabular PCFG parsing, which is simpler to implement than an upward-propagating best-first parser, is correct for a wide range of parser control strategies and maintains worst-case cubic time.
A Proposal for a Natural Lan-guage Processing Syntactic Backbone
TLDR
A grammatical formalism that extends context-free grammars and aims at being a convincing challenger as a syntactic base for various tasks, especially in natural language processing is presented.
...
1
2
3
...