# Generic Axiomatization of Families of Noncrossing Graphs in Dependency Parsing

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

## Key facts

- Cited by 4 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 11 Jun 2017.

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

- [Not All Linearizations Are Equally Data-Hungry in Sequence Labeling Parsing](https://mlsanity.com/paper/2108.07556/) (2021)
- [Assessment of Pre-Trained Models Across Languages and Grammars](https://mlsanity.com/paper/2309.11165/) (2023)
- [Dependency Graph Parsing as Sequence Labeling](https://mlsanity.com/paper/2410.17972/) (2024)
- [Hierarchical Bracketing Encodings for Dependency Parsing as Tagging](https://mlsanity.com/paper/2505.11693/) (2025)

## Abstract (arXiv)

We present a simple encoding for unlabeled noncrossing graphs and show how its latent counterpart helps us to represent several families of directed and undirected graphs used in syntactic and semantic parsing of natural language as context-free languages. The families are separated purely on the basis of forbidden patterns in latent encoding, eliminating the need to differentiate the families of non-crossing graphs in inference algorithms: one algorithm works for all when the search space can be controlled in parser input.