Skip to main navigation Skip to search Skip to main content

Shallow parsing with Hidden Markov Support Vector Machines

  • Harbin Institute of Technology Shenzhen
  • Shenzhen Science Technology Library

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

Abstract

Shallow parsing system, providing natural part syntactic information statement, to meet a lot of language information processing requirements, has received much attention recent years. Hidden Markov Support Vector Machines (HM-SVMs) for sequence labeling offer advantages over both generative models like HMMs and classifying models like SVMs which give labeling result for each positionseparately. We show how to train a HM-SVM model to achieve good performance on the data set of CoNLL2000 share task. The HM-SVMs yields an F-score of 95.51% which is better than any system result of ConLL2000 share task.

Original languageEnglish
Title of host publicationProceedings of 2014 International Conference on Machine Learning and Cybernetics, ICMLC 2014
PublisherIEEE Computer Society
Pages827-830
Number of pages4
ISBN (Electronic)9781479942169
DOIs
StatePublished - 13 Jan 2014
Externally publishedYes
Event13th International Conference on Machine Learning and Cybernetics, ICMLC 2014 - Lanzhou, China
Duration: 13 Jul 201416 Jul 2014

Publication series

NameProceedings - International Conference on Machine Learning and Cybernetics
Volume2
ISSN (Print)2160-133X
ISSN (Electronic)2160-1348

Conference

Conference13th International Conference on Machine Learning and Cybernetics, ICMLC 2014
Country/TerritoryChina
CityLanzhou
Period13/07/1416/07/14

Keywords

  • Chunk
  • HM-SVMs
  • Shallow parsing

Fingerprint

Dive into the research topics of 'Shallow parsing with Hidden Markov Support Vector Machines'. Together they form a unique fingerprint.

Cite this