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 language | English |
|---|---|
| Title of host publication | International Conference on Machine Learning and Cybernetics |
| Pages | 2309-2314 |
| Number of pages | 6 |
| Volume | 4 |
| Publication status | Published - 1 Dec 2003 |
| Event | 2003 International Conference on Machine Learning and Cybernetics - Xi'an, China Duration: 2 Nov 2003 → 5 Nov 2003 |
Conference
| Conference | 2003 International Conference on Machine Learning and Cybernetics |
|---|---|
| Country/Territory | China |
| City | Xi'an |
| Period | 2/11/03 → 5/11/03 |
Keywords
- Machine learning algorithms
- Natural language processing
- Shallow parsers Introduction
ASJC Scopus subject areas
- Artificial Intelligence