An effective two-stage model for exploiting non-local dependencies in named entity recognition

COLING/ACL 2006 - 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference

Volumn 1, Issue , 2006, Pages 1121-1128

  Krishnan, Vijay ^a   Manning, Christopher D ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; ERRORS; RANDOM PROCESSES;

APPROXIMATE INFERENCE; COMPUTATIONALLY EFFICIENT; CONDITIONAL RANDOM FIELD; ERROR REDUCTION; LOCAL INFORMATION; NAMED ENTITY RECOGNITION; SEQUENCE MODELS; TWO STAGE APPROACH;

INFORMATION USE;

EID: 80053344402     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1220175.1220316     Document Type: Conference Paper

References (18)

1. A. Borthwick. 1999. A Maximum Entropy Approach to Named Entity Recognition. Ph.D. thesis, New York University.
2. R. Bunescu and R. J. Mooney. 2004. Collective information extraction with relational Markov networks. In Proceedings of the 42nd ACL, pages 439-446.
3. H. L. Chieu and H. T. Ng. 2002. Named entity recognition: a maximum entropy approach using global information. In Proceedings of the 19th Coling, pages 190-196.
4. J. R. Curran and S. Clark. 2003. Language independent NER using a maximum entropy tagger. In Proceedings of the 7th CoNLL, pages 164-167.
5. J. Finkel, T. Grenager, and C. D. Manning. 2005. Incorporating non-local information into information extraction systems by gibbs sampling. In Proceedings of the 42nd ACL.
6. D. Freitag and A. McCallum. 1999. Information extraction with HMMs and shrinkage. In Proceedings of the AAAI-99 Workshop on Machine Learning for Information Extraction.
7. S. Geman and D. Geman. 1984. Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Transitions on Pattern Analysis and Machine Intelligence, 6:721-741.
8. J. Lafferty, A. McCallum, and F. Pereira. 2001. Conditional Random Fields: Probabilistic models for segmenting and labeling sequence data. In Proceedings of the 18th ICML, pages 282-289. Morgan Kaufmann, San Francisco, CA.
9. T. R. Leek. 1997. Information extraction using hidden Markov models. Master's thesis, U.C. San Diego.
10. R. Malouf. 2002. Markov models for language-independent named entity recognition. In Proceedings of the 6th CoNLL, pages 187-190.
11. A.McCallum, D. Freitag, and F. Pereira. 2000. Maximumentropy Markov models for information extraction and segmentation. In Proceedings of the 17th ICML, pages 591-598. Morgan Kaufmann, San Francisco, CA.
12. A. Mikheev, M. Moens, and C. Grover. 1999. Named entity recognition without gazetteers. In Proceedings of the 9th EACL, pages 1-8.
13. J. Pearl. 1988. Probabilistic reasoning in intelligent systems: Networks of plausible inference. In Morgan Kauffmann.
14. F. Sha and F. Pereira. 2003. Shallow parsing with conditional random fields. In Proceedings of NAACL-2003, pages 134-141.
15. C. Sutton and A. McCallum. 2004. Collective segmentation and labeling of distant entities in information extraction. In ICML Workshop on Statistical Relational Learning and Its connections to Other Fields.
16. B. Taskar, P. Abbeel, and D. Koller. 2002. Discriminative probabilistic models for relational data. In Proceedings of UAI-02.
17. J. S. Yedidia, W. T. Freeman, and Y. Weiss. 2000. Generalized belief propagation. In Proceedings of NIPS-2000, pages 689-695.
18. Alexander Yeh. 2000. More accurate tests for the statistical significance of result differences. In Proceedings of COLING 2000.