Machine learning approaches for chinese shallow parsers

Qin Lu, Jing Zhou, Rui Feng Xu

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

2 Citations (Scopus)

Abstract

In this paper, we present two machine-learning algorithms, namely, transformation-based error-driven learning (TEL) and memory-based learning (MBL) to improve the performance of a Chinese shallow parser. The Algorithm not only can handle nested chunking data, but also different phrase types (e.g. NP, VP, S etc.). Results show that TEL can achieve better recall rate, yet MBL is less sensitive to nesting and requires much less computation.
Original languageEnglish
Title of host publicationInternational Conference on Machine Learning and Cybernetics
Pages2309-2314
Number of pages6
Volume4
Publication statusPublished - 1 Dec 2003
Event2003 International Conference on Machine Learning and Cybernetics - Xi'an, China
Duration: 2 Nov 20035 Nov 2003

Conference

Conference2003 International Conference on Machine Learning and Cybernetics
Country/TerritoryChina
CityXi'an
Period2/11/035/11/03

Keywords

  • Machine learning algorithms
  • Natural language processing
  • Shallow parsers Introduction

ASJC Scopus subject areas

  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Machine learning approaches for chinese shallow parsers'. Together they form a unique fingerprint.

Cite this