TFlex: speeding up deep parsing with strategic pruning

  • Authors:
  • Myroslava O. Dzikovska;Carolyn P. Rose

  • Affiliations:
  • University of Edinburgh, Edinburgh, UK;Carnegie Mellon University, Pittsburgh, PA

  • Venue:
  • Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a method for speeding up a deep parser through backbone extraction and pruning based on CFG ambiguity packing. The TRIPS grammar is a wide-coverage grammar for deep natural language understanding in dialogue, utilized in 6 different application domains, and with high coverage and sentence-level accuracy on human-human task-oriented dialogue corpora (Dzikovska, 2004). The TRIPS parser uses a best-first beam search algorithm and a chart size limit, both of which are a form of pruning focused on finding an n-best list of interpretations. However, for longer sentences limiting the chart size results in failed parses, while increasing the chart size limits significantly impacts the parsing speed.