A bi-threshold model for PP-attachment disambiguation through backing off to 2-tuples directly

Abstract

We present a bi-threshold approach to prepositional phrase attachment disambiguation which is based on a pseudo-backed-off model through backing off to 2-tuples directly. We use 2-tuples counts only to make attachment decision relied on two threshold comparisons. The model alleviates the sparse data problem because 4-tuples and 3-tuples counts are not used. It also achieves good performance with 85.02% accuracy on the test data of the IBM data set. Our experiments show that 4-tuples and 3-tuples counts are unnecessary for resolving prepositional phrase attachment.

Related Papers

• → Big Blue in the Bottomless Pit: The Early Years of IBM Chile(2008)27 cited
• → A history of the IBM Systems Journal(1998)11 cited
• → The IBM information retrieval center-(ITIRC) system techniques and applications(1966)3 cited
• Big Blue in the Bottomless Pit: The Early Years of IBM Chile(2008)
• → IBM(2021)