Abstract
Collocation is a linguistic phenomenon that is difficult to define and harder to explain; it has been largely overlooked in the field of computational linguistics due to its difficulty. Although standard techniques exist for finding collocations, they tend to be rather noisy and suffer from sparse data problems. In this paper, we demonstrate that by utilising parsed input to concentrate on one very specific type of collocation—in this case, verbs with particles, a subset of the socalled “multi-word” verbs—and applying an algorithm to promote those collocations in which we have more confidence, the problems with statistically learning
collocations can be overcome.
collocations can be overcome.
Original language | English |
---|---|
Title of host publication | Proceedings of the ACL 2001 workshop on collocation |
Subtitle of host publication | computational extraction, analysis and exploitation |
Place of Publication | Toulouse, France |
Publisher | Association for Computational Linguistics (ACL) |
Pages | 54-60 |
Number of pages | 7 |
Publication status | Published - 2001 |
Externally published | Yes |
Event | Association for Computational Linguistics Workshop on Collocation (2001) - Toulouse, France Duration: 9 Jul 2001 → 11 Jul 2001 |
Conference
Conference | Association for Computational Linguistics Workshop on Collocation (2001) |
---|---|
Country/Territory | France |
City | Toulouse |
Period | 9/07/01 → 11/07/01 |