Efficient inference of CRFs for large-scale natural language data

Authors:
Minwoo Jeong;Chin-Yew Lin;Gary Geunbae Lee
Affiliations:
Pohang University of Science & Technology, Pohang, Korea;Microsoft Research Asia, Beijing, China;Pohang University of Science & Technology, Pohang, Korea
Venue:
ACLShort '09 Proceedings of the ACL-IJCNLP 2009 Conference Short Papers
Year:
2009

Citing 5
Cited 3

Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data

ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
Shallow parsing with conditional random fields

NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
Exploiting non-local features for spoken language understanding

COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
Fine-grained named entity recognition and relation extraction for question answering

SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Efficient inference in large conditional random fields

ECML'06 Proceedings of the 17th European conference on Machine Learning

Efficient staggered decoding for sequence labeling

ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Practical very large scale CRFs

ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Iterative viterbi A* algorithm for k-best sequential decoding

ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an efficient inference algorithm of conditional random fields (CRFs) for large-scale data. Our key idea is to decompose the output label state into an active set and an inactive set in which most unsupported transitions become a constant. Our method unifies two previous methods for efficient inference of CRFs, and also derives a simple but robust special case that performs faster than exact inference when the active sets are sufficiently small. We demonstrate that our method achieves dramatic speedup on six standard natural language processing problems.