• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Shallow Parsing with Conditional Random Fields (2003)

Cached

  • Download as a PDF

Download Links

  • [acl.ldc.upenn.edu]
  • [luthuli.cs.uiuc.edu]
  • [www.cis.upenn.edu]
  • [www.cs.berkeley.edu]
  • [www.cs.iastate.edu]
  • [www.cis.upenn.edu]
  • [www.seas.upenn.edu]

  • Other Repositories/Bibliography

  • CiteULike
  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Fei Sha , Fernando Pereira
Citations:336 - 7 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Sha03shallowparsing,
    author = {Fei Sha and Fernando Pereira},
    title = {Shallow Parsing with Conditional Random Fields},
    booktitle = {},
    year = {2003},
    pages = {213--220},
    publisher = {}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Conditional random fields for sequence labeling offer advantages over both generative models like HMMs and classifiers applied at each sequence position. Among sequence labeling tasks in language processing, shallow parsing has received much attention, with the development of standard evaluation datasets and extensive comparison among methods. We show here how to train a conditional random field to achieve performance as good as any reported base noun-phrase chunking method on the CoNLL task, and better than any reported single model. Improved training methods based on modern optimization algorithms were critical in achieving these results. We present extensive comparisons between models and training methods that confirm and strengthen previous results on shallow parsing and training methods for maximum-entropy models.

Citations

1548 BConditional random fields: Probabilistic models for segmenting and labeling sequence data - Lafferty, McCallum, et al.
1242 Numerical Optimization - Nocedal, Wright - 1999
846 A Maximum Entropy Approach to Natural Language Processing - Berger, Pietra, et al. - 1996
662 Transformation-Based Error-Driven Learning and Natural Language Processing A Case Study - Brill - 1995
464 Inducing Features of Random Fields - Pietra, Pietra, et al. - 1997
355 Generalized Iterative Scaling for Log-Linear Models - Darroch, Ratcliff - 1972
348 A maximum entropy model for part-of-speech tagging - Ratnaparkhi - 1996
337 Text chunking using transformation-based learning - Ramshaw, Marcus - 1995
291 Parsing by chunks - Abney - 1991
276 D: Discriminative probabilistic models for relational data - Taskar, Abbeel, et al. - 2002
270 An Algorithm that Learns What’s in a Name - Bikel, Schwartz, et al. - 1999
221 An introduction to the conjugate gradient method without the agonizing pain - SHEWCHUK - 1994
181 R: A Gaussian prior for smoothing maximum entropy models - SF, Rosenfeld - 1999
177 Robust part-of-speech tagging using hidden Markov model - Kupiec - 1992
171 A comparison of algorithms for maximum entropy parameter estimation - Malouf - 2002
164 N: New Ranking Algorithms for Parsing and Tagging: Kernels over Discrete Structures, and the Voted Perceptron - Collins, Duffy
142 A Linear Observed Time Statistical Parser Based on Maximum Entropy Models - Ratnaparkhi - 1997
105 S: Introduction to the CoNLL-2000 shared task: chunking - Sang, Buchholz
95 Parsing the Wall Street Journal Using a Lexical-Functional Grammar and Discriminative Estimation Techniques - Riezler - 2002
89 Information Extraction with HMM Structures Learned by Stochastic Optimization - Freitag, McCallum - 2000
84 Markov fields on finite graphs and lattices,” Unpublished manuscript - Hammersley, Clifford - 1971
83 The use of classifiers in sequential inference - Punyakanok, Roth - 2001
62 Boosting applied to tagging and PP attachment - Abney, Schapire, et al. - 1999
45 Algorithms for maximum-likelihood logistic regression - Minka - 2001
43 Efficient training of conditional random fields - Wallach - 2002
25 More accurate tests for the statistical significance of result differences - Yeh
18 Dynamic programming for parsing and estimation of stochastic unification-based grammars - Geman, Johnson - 2002
17 Memory-based shallow parsing - Sang - 2002
4 Some statistical issues in the compairson of speech recognition algorithms - Gillick, Cox - 1989
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University