A Bi-Threshold Model for PP-attachment Disambiguation through Backing off to 2-Tuples Directly
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.
PP-attachment disambiguation pseudo-backed-off model backed-off model bi-threshold approach
Bosen LIAO Huiqiong LUO Luying XIAO
School of Computer Science and Engineering, University of Electronic Science and Technology of China School of Foreign Language, University of Electronic Science and Technology of China Chengdu, P. R.
国际会议
大连
英文
1-5
2009-09-24(万方平台首次上网日期,不代表论文的发表时间)