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

Abstract

We present conditional random fields, a framework for building probabilistic models to segment and label sequence data. Conditional random fields offer several advantages over hidden Markov models and stochastic grammars for such tasks, including the ability to relax strong independence assumptions made in those models. Conditional random fields also avoid a fundamental limitation of maximum entropy Markov models (MEMMs) and other discrimi-native Markov models based on directed graph-ical models, which can be biased towards states with few successor states. We present iterative parameter estimation algorithms for conditional random fields and compare the performance of the resulting models to HMMs and MEMMs on synthetic and natural-language data.

Extracted Key Phrases

4 Figures and Tables

Showing 1-10 of 5,971 extracted citations
05001000'01'03'05'07'09'11'13'15'17
Citations per Year

10,476 Citations

Semantic Scholar estimates that this publication has received between 10,020 and 10,954 citations based on the available data.

See our FAQ for additional information.