Bidirectional Sequence Labeling Via Dual Decomposition

CHINESE COMPUTATIONAL LINGUISTICS AND NATURAL LANGUAGE PROCESSING BASED ON NATURALLY ANNOTATED BIG DATA(2013)

引用 3|浏览9
暂无评分
摘要
In this paper, we propose a bidirectional algorithm for sequence labeling to capture the influence of both the left-to-right and the right-to-left directions. We combine the optimization of two unidirectional models from opposite directions via the dual decomposition method to jointly label the input sequence. Experiments on three sequence labeling tasks (Chinese word segmentation, English POS tagging and text chunking) show that our approach can improve the accuracy of sequence labeling tasks when the two unidirectional models individually make highly different predictions.
更多
查看译文
关键词
Input Sequence, Subgradient Method, Sequence Label, Bidirectional Sequence, Dual Decomposition
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要