Skip to main navigation Skip to search Skip to main content

A maximum ENTROPY Markov model for chunking

  • Guang Lu Sun*
  • , Y. I. Guan
  • , Xiao Long Wang
  • , Jian Zhao
  • *Corresponding author for this work
  • School of Computer Science and Technology, Harbin Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper presents a new chunking method based on maximum entropy Markov models (MEMM). MEMM is described in detail that combines transition probabilities and conditional probabilities of states effectively. The conditional probabilities of states are estimated by maximum entropy (ME) theory. The transition probabilities of the states are estimated by N-gram model in which interpolation smoothing algorithm is utilized on the basis of analyzing chunking spec. Experiment results show that this approach achieves an impressive performance: 92.53% in F-score on the open data sets of CoNLL-2000 shared task. The performance of the algorithm is close to the state-of-the-art.

Original languageEnglish
Title of host publication2005 International Conference on Machine Learning and Cybernetics, ICMLC 2005
PublisherIEEE Computer Society
Pages3761-3765
Number of pages5
ISBN (Electronic)0780390911
ISBN (Print)078039092X, 9780780390928
DOIs
StatePublished - 2005
Externally publishedYes
EventInternational Conference on Machine Learning and Cybernetics, ICMLC 2005 - Guangzhou, China
Duration: 18 Aug 200521 Aug 2005

Publication series

Name2005 International Conference on Machine Learning and Cybernetics, ICMLC 2005
Volume6

Conference

ConferenceInternational Conference on Machine Learning and Cybernetics, ICMLC 2005
Country/TerritoryChina
CityGuangzhou
Period18/08/0521/08/05

Keywords

  • Chunking
  • Feature Template
  • Maximum Entropy Markov Model
  • Smoothing Algorithm

Fingerprint

Dive into the research topics of 'A maximum ENTROPY Markov model for chunking'. Together they form a unique fingerprint.

Cite this