Bidirectional Inference with the Easiest-First Strategy for Tagging Sequence Data

By Yoshimasa Tsuruoka, Junichi Tsujii. 2005

286 citations recorded by the source corpus.

This paper presents a bidirectional inference algorithm for sequence labeling problems such as part-of-speech tagging, named entity recognition and text chunking. The algorithm can enumerate all possible decomposition structures and find the highest probability sequence together with the corresponding decomposition structure in polynomial time. We also present an efficient decoding algorithm based on the easiest-first strategy, which gives comparably good performance to full bidirectional inference with significantly lower computational cost. Experimental results of part-of-speech tagging and text chunking show that the proposed bidirectional inference methods consistently outperform unidirectional inference methods and bidirectional MEMMs give comparable performance to that achieved by state-of-the-art learning algorithms including kernel support vector machines.

Subfields: Artificial Intelligence

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Graham Neubig
  2. Mohit Bansal
  3. Jianfeng Gao
  4. Noah A. Smith
  5. Luke S. Zettlemoyer
  6. Percy Liang
  7. Christopher D. Manning
  8. Yejin Choi

Citations in the corpus