Discontinuous parsing with continuous trees

@inproceedings{Maier2016DiscontinuousPW,
  title={Discontinuous parsing with continuous trees},
  author={Wolfgang Maier and Timm Lichte},
  year={2016}
}
We introduce a new method for incremental shift-reduce parsing of discontinuous constituency trees, based on the fact that discontinuous trees can be transformed into continuous trees by changing the order of the terminal nodes. It allows for a clean formulation of different oracles, leads to faster parsers and provides better results. Our best system achieves an F1 of 80.02 on TIGER. 
20 Citations
Incremental Discontinuous Phrase Structure Parsing with the GAP Transition
  • 23
  • Highly Influenced
  • PDF
Discontinuous Constituency Parsing with a Stack-Free Transition System and a Dynamic Oracle
  • 10
  • PDF
A Unifying Theory of Transition-based and Sequence Labeling Parsing
  • PDF
Neural Discontinuous Constituency Parsing
  • 15
  • PDF
...
1
2
...

References

SHOWING 1-10 OF 30 REFERENCES
Discontinuous Incremental Shift-reduce Parsing
  • 29
  • PDF
An Improved Oracle for Dependency Parsing with Online Reordering
  • 63
  • PDF
Discontinuous Parsing with an Efficient and Accurate DOP Model
  • 24
  • PDF
Non-Projective Dependency Parsing in Expected Linear Time
  • 269
  • PDF
Hybrid Grammars for Discontinuous Parsing
  • 10
  • PDF
Optimal Shift-Reduce Constituent Parsing with Structured Perceptron
  • 9
  • PDF
Parsing Discontinuous Phrase Structure with Grammatical Functions
  • 26
Parsing as Reduction
  • 45
  • PDF
...
1
2
3
...