# Generalized chart constraints for efficient PCFG and TAG parsing

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

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 27 Jun 2018.

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

- [Proposing TAGbank as a Corpus of Tree-Adjoining Grammar Derivations](https://mlsanity.com/paper/2504.05226/) (2025)

## Abstract (arXiv)

Chart constraints, which specify at which string positions a constituent may begin or end, have been shown to speed up chart parsers for PCFGs. We generalize chart constraints to more expressive grammar formalisms and describe a neural tagger which predicts chart constraints at very high precision. Our constraints accelerate both PCFG and TAG parsing, and combine effectively with other pruning techniques (coarse-to-fine and supertagging) for an overall speedup of two orders of magnitude, while improving accuracy.