[Association for Computational Linguistics the 37th annual meeting of the Association for Computational Linguistics - College Park, Maryland (1999.06.20-1999.06.26)] Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics - - Supervised grammar induction using training data with limited constituent information

✍ Scribed by Hwa, Rebecca

• Book ID: 121837266
• Publisher: Association for Computational Linguistics
• Year: 1999
• Weight: 662 KB
• Category: Article
• DOI: 10.3115/1034678.1034699

✦ Synopsis

Corpus-based grammar induction generally relies on hand-parsed training data to learn the structure of the language. Unfortunately, the cost of building large annotated corpora is prohibitively expensive. This work aims to improve the induction strategy when there are few labels in the training data. We show that the most informative linguistic constituents are the higher nodes in the parse trees, typically denoting complex noun phrases and sentential clauses. They account for only 20% of all constituents. For inducing grammars from sparsely labeled training data (e.g., only higher-level constituent labels), we propose an adaptation strategy, which produces grammars that parse almost as well as grammars induced from fully labeled corpora. Our results suggest that for a partial parser to replace human annotators, it must be able to automatically extract higher-level constituents rather than base noun phrases.