# Parsing as Reduction

arXiv: https://arxiv.org/abs/1503.00030 · HTML: https://mlsanity.com/paper/1503.00030/

## Key facts

- Cited by 6 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 27 Feb 2015.

## Built on by (most cited first, 6 of 6)

- [Towards Unification of Discourse Annotation Frameworks](https://mlsanity.com/paper/2204.07781/) (2022)
- [Reducing Discontinuous to Continuous Parsing with Pointer Network Reordering](https://mlsanity.com/paper/2104.06239/) (2021)
- [Discontinuous Grammar as a Foreign Language](https://mlsanity.com/paper/2110.10431/) (2021)
- [On graph-based reentrancy-free semantic parsing](https://mlsanity.com/paper/2302.07679/) (2023)
- [Strahler Number of Natural Language Sentences in Comparison with Random Trees](https://mlsanity.com/paper/2307.02697/) (2023)
- [A tree interpretation of arc standard dependency derivation](https://mlsanity.com/paper/2603.27459/) (2026)

## Abstract (arXiv)

We reduce phrase-representation parsing to dependency parsing. Our reduction is grounded on a new intermediate representation, "head-ordered dependency trees", shown to be isomorphic to constituent trees. By encoding order information in the dependency labels, we show that any off-the-shelf, trainable dependency parser can be used to produce constituents. When this parser is non-projective, we can perform discontinuous parsing in a very natural manner. Despite the simplicity of our approach, experiments show that the resulting parsers are on par with strong baselines, such as the Berkeley parser for English and the best single system in the SPMRL-2014 shared task. Results are particularly striking for discontinuous parsing of German, where we surpass the current state of the art by a wide margin.