Advances in Neural Information Processing Systems 22 - Proceedings of the 2009 Conference2196-220

Chieu, H.L.

Lee, W.S.

Wu, D.

Ye, N.

Dependencies among neighbouring labels in a sequence is an important source of information for sequence labeling problems. However, only dependencies between adjacent labels are commonly exploited in practice because of the high computational complexity of typical inference algorithms when longer distance dependencies are taken into account. In this paper, we show that it is possible to design efficient inference algorithms for a conditional random field using features that depend on long consecutive label sequences (high-order features), as long as the number of distinct label sequences used in the features is small. This leads to efficient learning algorithms for these conditional random fields. We show experimentally that exploiting dependencies using high-order features can lead to substantial performance improvements for some problems and discuss conditions under which high-order features can be effective

Ye, Nan

Lee, Wee Sun

Chieu, Hai Leong

Wu, Dan

Queensland University of Technology ePrints Archive

Conditional random fields with high-order features for sequence labeling

ScholarBank@NUS

Lee, W. S.

Chieu, H. L.

Name not available

Conditional random fields with high-order features for sequence labeling

Abstract

Similar works

Full text

Available Versions

Queensland University of Technology ePrints Archive

ScholarBank@NUS

Name not available