A bi-threshold model for PP-attachment disambiguation through backing off to 2-tuples directly
- Resource Type
- Conference
- Authors
- Liao, Bosen; Luo, Huiqiong; Xiao, Luying
- Source
- 2009 International Conference on Natural Language Processing and Knowledge Engineering Natural Language Processing and Knowledge Engineering, 2009. NLP-KE 2009. International Conference on. :1-5 Sep, 2009
- Subject
- Computing and Processing
Communication, Networking and Broadcast Technologies
Signal Processing and Analysis
Wheels
Data mining
Computer science
Testing
Training data
Nearest neighbor searches
Natural language processing
Entropy
Decision trees
Dictionaries
PP-attachment disambiguation
pseudo-backed-off model
backed-off model
bi-threshold approach
- Language
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.