@inproceedings{grunewald-etal-2018-generalized,
    title = "Generalized chart constraints for efficient {PCFG} and {TAG} parsing",
    author = {Gr{\"u}newald, Stefan  and
      Henning, Sophie  and
      Koller, Alexander},
    editor = "Gurevych, Iryna  and
      Miyao, Yusuke",
    booktitle = "Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)",
    month = jul,
    year = "2018",
    address = "Melbourne, Australia",
    publisher = "Association for Computational Linguistics",
    url = "https://preview.aclanthology.org/jlcl-multiple-ingestion/P18-2099/",
    doi = "10.18653/v1/P18-2099",
    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."
}