Abstract
Unsupervised grammar induction models tend to employ relatively simple models of syntax when compared to their supervised counterparts. Traditionally, the unsupervised models have been kept simple due to tractability and data sparsity concerns. In this paper, we introduce basic valence frames and lexical information into an unsupervised dependency grammar inducer and show how this additional information can be leveraged via smoothing. Our model produces state-of-the-art results on the task of unsupervised grammar induction, improving over the best previous work by almost 10 percentage points.
Original language | English |
---|---|
Title of host publication | NAACL HLT 2009 - Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Proceedings of the Conference |
Place of Publication | Stroudsburg, PA |
Publisher | Association for Computational Linguistics (ACL) |
Pages | 101-109 |
Number of pages | 9 |
ISBN (Print) | 9781932432411 |
Publication status | Published - Jun 2009 |
Externally published | Yes |
Event | Annual Conference of the North American Chapter of the Association for Computational Linguistics - Human Language Technologies, NAACL HLT (10th : 2009) - Boulder, United States Duration: 31 May 2009 → 5 Jun 2009 |
Other
Other | Annual Conference of the North American Chapter of the Association for Computational Linguistics - Human Language Technologies, NAACL HLT (10th : 2009) |
---|---|
Country/Territory | United States |
City | Boulder |
Period | 31/05/09 → 5/06/09 |