A Bottom-up Merging Algorithm for Chinese Unknown Word Extraction Export

@inproceedings{citeulike:578085, abstract = {Statistical methods for extracting Chinese unknown words usually suffer a problem that superfluous character strings with strong statistical associations are extracted as well. To solve this problem, this paper proposes to use a set of general morphological rules to broaden the coverage and on the other hand, the rules are appended with different linguistic and statistical constraints to increase the precision of the representation. To disambiguate rule applications and reduce the complexity of the rule matching, a bottom-up merging algorithm for extraction is proposed, which merges possible morphemes recursively by consulting above the general rules and dynamically decides which rule should be applied first according to the priorities of the rules. Effects of different priority strategies are compared in our experiment, and experimental results show that the performance of proposed method is very promising.}, author = {Ma, Wei-Yun and Chen, Keh-Jiann}, citeulike-article-id = {578085}, journal = {Proceedings of ACL, Second SIGHAN Workshop on Chinese Language Processing}, keywords = {algorithm, bottom-up, chinese, extraction, merging, sinica, word}, pages = {31--38}, posted-at = {2006-04-06 06:43:59}, priority = {5}, title = {A Bottom-up Merging Algorithm for Chinese Unknown Word Extraction}, year = {2003} }

TY - CONF ID - citeulike:578085 L3 - citeulike-article-id:578085 N2 - Statistical methods for extracting Chinese unknown words usually suffer a problem that superfluous character strings with strong statistical associations are extracted as well. To solve this problem, this paper proposes to use a set of general morphological rules to broaden the coverage and on the other hand, the rules are appended with different linguistic and statistical constraints to increase the precision of the representation. To disambiguate rule applications and reduce the complexity of the rule matching, a bottom-up merging algorithm for extraction is proposed, which merges possible morphemes recursively by consulting above the general rules and dynamically decides which rule should be applied first according to the priorities of the rules. Effects of different priority strategies are compared in our experiment, and experimental results show that the performance of proposed method is very promising. JF - Proceedings of ACL, Second SIGHAN Workshop on Chinese Language Processing EP - 38 TI - A Bottom-up Merging Algorithm for Chinese Unknown Word Extraction SP - 31 KW - algorithm KW - bottom-up KW - chinese KW - extraction KW - merging KW - sinica KW - word AU - Ma, Wei-Yun AU - Chen, Keh-Jiann PY - 2003/// ER -