.png){kind=icon}
返回
Efficient text chunking using linear kernel with masked method
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2006.04.016.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (c) 2006 Elsevier B.V. All rights reserved.
Keyword:
text chunking
support vector machines
shallow parsing
masked method
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.2W
被引数:
4.5W
机构
暂无机构信息
引用论文
Father and Mother Know Best: Defining the Liability of Physicians for Inadequate Genetic Counseling
OAAI
.png){kind=icon}
OAAI分享收藏分享收藏分享收藏
分享收藏
查看更多内容