@InProceedings{grnewald-henning-koller:2018:Short,
  author    = {Grünewald, Stefan  and  Henning, Sophie  and  Koller, Alexander},
  title     = {Generalized chart constraints for efficient PCFG and TAG parsing},
  booktitle = {Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)},
  month     = {July},
  year      = {2018},
  address   = {Melbourne, Australia},
  publisher = {Association for Computational Linguistics},
  pages     = {626--631},
  abstract  = {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.},
  url       = {http://www.aclweb.org/anthology/P18-2099}
}