|
Title
|
|
|
|
Transforming a chunker to a parser
| |
|
Author
|
|
|
|
| |
|
Abstract
|
|
|
|
| Ever since the landmark paper Ramshaw and Marcus (1995), machine learning systems have been used successfully for identifying base phrases (chunks), the bottom constituents of a parse tree. We expand a state-of-the-art chunking algorithm to a bottom-up parser by recursively applying the chunker to its own output. After testing different training configurations we obtain a reasonable parser which is tested against a standard data set. Its performance falls behind that of current state-of-the-art parsers. We give some suggestions for modifications of the parser which may lead to future performance improvements. |
| |
|
Language
|
|
|
|
English
| |
|
Source (journal)
|
|
|
|
LANGUAGE AND COMPUTERS
| |
|
Source (book)
|
|
|
|
11th Conference on Computational Linguistics in the Netherlands, NOV 03, 2000, TILBURG UNIV, TILBURG, NETHERLANDS
| |
|
Publication
|
|
|
|
2001
| |
|
ISBN
|
|
|
|
90-420-1257-9
| |
|
Volume/pages
|
|
|
|
37
(2001)
, p. 177-188
| |
|
ISI
|
|
|
|
000174422500013
| |
|