Efficient text chunking using linear kernel with masked method Export

@article{citeulike:1250351, abstract = {In this paper, we proposed an efficient and accurate text chunking system using linear SVM kernel and a new technique called masked method. Previous researches indicated that systems combination or external parsers can enhance the chunking performance. However, the cost of constructing multi-classifiers is even higher than developing a single processor. Moreover, the use of external resources will complicate the original tagging process. To remedy these problems, we employ richer features and propose a masked-based method to solve unknown word problem to enhance system performance. In this way, no external resources or complex heuristics are required for the chunking system. The experiments show that when training with the CoNLL-2000 chunking dataset, our system achieves 94.12 in F([beta]) rate with linear. Furthermore, our chunker is quite efficient since it adopts a linear kernel SVM. The turn-around tagging time on CoNLL-2000 testing data is less than 50 s which is about 115 times than polynomial kernel SVM.}, author = {Wu, Yu-Chieh and Chang, Chia-Hui}, citeulike-article-id = {1250351}, citeulike-linkout-0 = {http://www.sciencedirect.com/science/article/B6V0P-4KSD4BJ-1/2/92bbde507ab41124299c04a23b1f7514}, journal = {Knowledge-Based Systems}, keywords = {chunking, linear, svm}, month = {April}, number = {3}, pages = {209--219}, posted-at = {2007-04-25 14:17:03}, priority = {2}, title = {Efficient text chunking using linear kernel with masked method}, url = {http://www.sciencedirect.com/science/article/B6V0P-4KSD4BJ-1/2/92bbde507ab41124299c04a23b1f7514}, volume = {20}, year = {2007} }

TY - JOUR ID - citeulike:1250351 L3 - citeulike-article-id:1250351 N2 - In this paper, we proposed an efficient and accurate text chunking system using linear SVM kernel and a new technique called masked method. Previous researches indicated that systems combination or external parsers can enhance the chunking performance. However, the cost of constructing multi-classifiers is even higher than developing a single processor. Moreover, the use of external resources will complicate the original tagging process. To remedy these problems, we employ richer features and propose a masked-based method to solve unknown word problem to enhance system performance. In this way, no external resources or complex heuristics are required for the chunking system. The experiments show that when training with the CoNLL-2000 chunking dataset, our system achieves 94.12 in F([beta]) rate with linear. Furthermore, our chunker is quite efficient since it adopts a linear kernel SVM. The turn-around tagging time on CoNLL-2000 testing data is less than 50 s which is about 115 times than polynomial kernel SVM. IS - 3 JF - Knowledge-Based Systems EP - 219 TI - Efficient text chunking using linear kernel with masked method VL - 20 SP - 209 KW - chunking KW - linear KW - svm AU - Wu, Yu-Chieh AU - Chang, Chia-Hui PY - 2007/04// UR - http://www.sciencedirect.com/science/article/B6V0P-4KSD4BJ-1/2/92bbde507ab41124299c04a23b1f7514 ER -