Discontinuous Incremental Shift-reduce Parsing

Maier, Wolfgang

doi:10.3115/v1/p15-1116

Cited by 30 publications

(89 citation statements)

References 20 publications

(28 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is an extension of the shift-reduce algorithm with an additional gap transition. Evaluation on two German treebanks shows that SR-GAP outperforms the previous best transitionbased discontinuous parser (Maier, 2015) by a large margin (it is notably twice as accurate on the prediction of discontinuous constituents), and is competitive with the state of the art (Fernández-González and Martins, 2015). As a side contribution, we adapt span features (Hall et al, 2014) to discontinuous parsing.…”

Section: Introductionmentioning

confidence: 99%

“…For example, GAP 0 will have no effect, and GAP 2 counts as a single action equivalent to two consecutive GAPS. We call these actions COM-POUNDGAP, following the COMPOUNDSWAP actions of Maier (2015).…”

Section: Length Of Derivationsmentioning

confidence: 99%

“…NEGRA-30 consists of sentences whose length is smaller than, or equal to, 30 words. We used the same split as Maier (2015). A second instantiation, NEGRA-ALL, contains all the sentences of the corpus, and uses the standard split (Dubey and Keller, 2003).…”

Section: Datasetsmentioning

confidence: 99%

“…TIGERHN08 is the split used by Hall and Nivre (2008). TIGERM15 is the split of Maier (2015), which corresponds to the SPMRL split (Seddah et al, 2013). 2 We refer the reader to Table 8 in Appendix A for further details on the splits used.…”

Section: Datasetsmentioning

confidence: 99%

“…(iii) Transition-based discontinuous parsers are based on the easy-first framework (Versley, 2014a) or the shift-reduce algorithm augmented with a swap action (Maier, 2015). In the latter system, which we will refer to as SR-SWAP, a SWAP action pushes the second element of the stack back onto the buffer.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Incremental Discontinuous Phrase Structure Parsing with the GAP Transition

Coavoux¹,

Crabbé²

2017

Proceedings of the 15th Conference of the European Chapter of The Association for Computational Linguistics: Volume 1

View full text Add to dashboard Cite

This article introduces a novel transition system for discontinuous lexicalized constituent parsing called SR-GAP. It is an extension of the shift-reduce algorithm with an additional gap transition. Evaluation on two German treebanks shows that SR-GAP outperforms the previous best transitionbased discontinuous parser (Maier, 2015) by a large margin (it is notably twice as accurate on the prediction of discontinuous constituents), and is competitive with the state of the art (Fernández-González and Martins, 2015). As a side contribution, we adapt span features (Hall et al., 2014) to discontinuous parsing.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Length Of Derivationsmentioning

confidence: 99%

Section: Datasetsmentioning

confidence: 99%

Section: Datasetsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Incremental Discontinuous Phrase Structure Parsing with the GAP Transition

Coavoux¹,

Crabbé²

2017

Proceedings of the 15th Conference of the European Chapter of The Association for Computational Linguistics: Volume 1

View full text Add to dashboard Cite

show abstract

A Derivational Model of Discontinuous Parsing

Nederhof

Yli-Jyrä

2017

Language and Automata Theory and Applications

View full text Add to dashboard Cite

Abstract. The notion of latent-variable probabilistic context-free derivation of syntactic structures is enhanced to allow heads and unrestricted discontinuities. The chosen formalization covers both constituent parsing and dependency parsing. The derivational model is accompanied by an equivalent probabilistic automaton model. By the new framework, one obtains a probability distribution over the space of all discontinuous parses. This lends itself to intrinsic evaluation in terms of perplexity, as shown in experiments.

show abstract

Minimalist Grammar Transition-Based Parsing

Stanojević

2016

Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016)

View full text Add to dashboard Cite

Current chart-based parsers of Minimalist Grammars exhibit prohibitively high polynomial complexity that makes them unusable in practice. This paper presents a transition-based parser for Minimalist Grammars that approximately searches through the space of possible derivations by means of beam search, and does so very efficiently: the worst case complexity of building one derivation is $$O(n^2)$$ O ( n 2 ) and the best case complexity is O(n). This approximated inference can be guided by a trained probabilistic model that can condition on larger context than standard chart-based parsers. The transitions of the parser are very similar to the transitions of bottom-up shift-reduce parsers for Context-Free Grammars, with additional transitions for online reordering of words during parsing in order to make non-projective derivations projective.

show abstract

Discontinuous Incremental Shift-reduce Parsing

Abstract: We present an extension to incremental shift-reduce parsing that handles discontinuous constituents, using a linear classifier and beam search. We achieve very high parsing speeds (up to 640 sent./sec.) and accurate results (up to 79.52 F 1 on TiGer).

Cited by 30 publications

References 20 publications

Incremental Discontinuous Phrase Structure Parsing with the GAP Transition

Incremental Discontinuous Phrase Structure Parsing with the GAP Transition

A Derivational Model of Discontinuous Parsing

Minimalist Grammar Transition-Based Parsing

Contact Info

Product

Resources

About