Abstract
In this paper, we present the first incremental parser for Tree Substitution Grammar (TSG). A TSG allows arbitrarily large syntactic fragments to be combined into complete trees; we show how constraints (including lexicalization) can be imposed on the shape of the TSG fragments to enable incremental processing. We propose an efficient Earley-based algorithm for incremental TSG parsing and report an F-score competitive with other incremental parsers. In addition to whole-sentence F-score, we also evaluate the partial trees that the parser constructs for sentence prefixes; partial trees play an important role in incremental interpretation, language modeling, and psycholinguistics. Unlike existing parsers, our incremental TSG parser can generate partial trees that include predictions about the upcoming words in a sentence. We show that it outperforms an n-gram model in predicting more than one upcoming word.- Anthology ID:
- Q13-1010
- Volume:
- Transactions of the Association for Computational Linguistics, Volume 1
- Month:
- Year:
- 2013
- Address:
- Cambridge, MA
- Editors:
- Dekang Lin, Michael Collins
- Venue:
- TACL
- SIG:
- Publisher:
- MIT Press
- Note:
- Pages:
- 111–124
- Language:
- URL:
- https://preview.aclanthology.org/build-pipeline-with-new-library/Q13-1010/
- DOI:
- 10.1162/tacl_a_00214
- Cite (ACL):
- Federico Sangati and Frank Keller. 2013. Incremental Tree Substitution Grammar for Parsing and Sentence Prediction. Transactions of the Association for Computational Linguistics, 1:111–124.
- Cite (Informal):
- Incremental Tree Substitution Grammar for Parsing and Sentence Prediction (Sangati & Keller, TACL 2013)
- PDF:
- https://preview.aclanthology.org/build-pipeline-with-new-library/Q13-1010.pdf