• DocumentCode
    442051
  • Title

    A maximum entropy Markov model for chunking

  • Author

    Sun, Guang-lu ; Guan, Yi ; Wang, Xiao-long ; Zhao, Jian

  • Author_Institution
    Sch. of Comput. Sci. & Technol., Harbin Inst. of Technol., China
  • Volume
    6
  • fYear
    2005
  • fDate
    18-21 Aug. 2005
  • Firstpage
    3761
  • 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.
  • Keywords
    Markov processes; estimation theory; grammars; maximum entropy methods; probability; smoothing methods; text analysis; N-gram model; conditional probabilities; feature template; interpolation smoothing algorithm; maximum entropy Markov model; parsing; text chunking method; transition probabilities; Computer science; Data mining; Electronic mail; Entropy; Hidden Markov models; Smoothing methods; State estimation; Sun; Tagging; Testing; Chunking; Feature Template; Maximum Entropy Markov Model; Smoothing Algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Machine Learning and Cybernetics, 2005. Proceedings of 2005 International Conference on
  • Conference_Location
    Guangzhou, China
  • Print_ISBN
    0-7803-9091-1
  • Type

    conf

  • DOI
    10.1109/ICMLC.2005.1527594
  • Filename
    1527594