DocumentCode :
1843287
Title :
Resolving Combinational Ambiguity Based on Ensembles of Classifiers
Author :
Ding, Dexin ; Qu, Weiguang ; Tang, Xuri ; Yu, Lili ; Xu, Tao
Volume :
3
fYear :
2009
fDate :
15-18 Sept. 2009
Firstpage :
275
Lastpage :
278
Abstract :
Ambiguity processing is an important factor affecting the accuracy of word segmentation, of which combinational ambiguity is one of the vital issues. In this paper, we adopt methods of machine learning, choose the appropriate characteristic, and use the highly efficient classifying models of RFR_SUM, CRF, NaiveBayes, KNN, and RBF to resolve combinational ambiguity. Four combining strategies of ensembles of classifiers - product, average, max, majority voting - are applied in our experiment. 20 typical combinationally ambiguous words are tested by using a half year corpus of the 1998 "People\´s Daily", and the best average F-score achieved was 98.02%. The result shows that the methods of ensemble, which make full use of various contextual information such as word, frequency, part-of-speech and so on, can effectively improve disambiguation accuracy
Keywords :
Computer science; Conferences; Context modeling; Frequency; Humans; Information security; Intelligent agent; Natural languages; Packaging; Probability; Chinese word segmentation; Combinational ambiguity; ensemble of classifiers; feture selection;
fLanguage :
English
Publisher :
iet
Conference_Titel :
Web Intelligence and Intelligent Agent Technologies, 2009. WI-IAT '09. IEEE/WIC/ACM International Joint Conferences on
Conference_Location :
Milan, Italy
Print_ISBN :
978-0-7695-3801-3
Electronic_ISBN :
978-1-4244-5331-3
Type :
conf
DOI :
10.1109/WI-IAT.2009.281
Filename :
5285018
Link To Document :
بازگشت