Sciweavers

Share
ICML
2001
IEEE

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

10 years 10 months ago
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
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 discriminative Markov models based on directed graphical 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.
John D. Lafferty, Andrew McCallum, Fernando C. N.
Added 17 Nov 2009
Updated 17 Nov 2009
Type Conference
Year 2001
Where ICML
Authors John D. Lafferty, Andrew McCallum, Fernando C. N. Pereira
Comments (0)
books