Algorithm Based on SVM and Rules for the Disambiguation of Combinatorial Ambiguous Phrases
Article
Figures
Metrics
Preview PDF
Reference
Related
Cited by
Materials
Abstract:
Ambiguity processing is an essential but difficult problem in word segmentation.The authors combine Support Vector Machines(SVM)with rules to propose a new algorithm(SR algorithm)to deal with the combinatorial ambiguous phrases in Chinese word segmentation.The key idea of the SR algorithm is to solve combinatorial ambiguous phrases making use of the theory of SVM and rules of parts of speech.In a test of several kinds of Chinese corpus,it indicates that the accuracy of segmentation for combinatorial ambiguous phrases reach 83%.It provides a new method for solving Chinese word segmentation problems.
