A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Generalized Abbreviation Prediction with Negative Full Forms and Its Application on Improving Chinese Web Search
2013
International Joint Conference on Natural Language Processing
In Chinese abbreviation prediction, prior studies are limited on positive full forms. This lab assumption is problematic in realworld applications, which have a large portion of negative full forms (NFFs). We propose solutions to solve this problem of generalized abbreviation prediction. Experiments show that the proposed unified method outperforms baselines, with the full-match accuracy of 79.4%. Moreover, we apply generalized abbreviation prediction for improving web search quality.
dblp:conf/ijcnlp/SunLMW13
fatcat:6eizxyr2yfc5njwyyp3mkfo2ey