Is it harder to parse Chinese, or the Chinese Treebank? (2003)
by
Roger Levy
,
Christopher Manning
| Venue: | IN PROCEEDINGS OF THE 41ST ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS |
| Citations: | 39 - 2 self |
BibTeX
@INPROCEEDINGS{Levy03isit,
author = {Roger Levy and Christopher Manning},
title = {Is it harder to parse Chinese, or the Chinese Treebank?},
booktitle = {IN PROCEEDINGS OF THE 41ST ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS},
year = {2003},
pages = {439--446},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a detailed investigation of the challenges posed when applying parsing models developed against English corpora to Chinese. We develop a
Citations
| 780 | Head-Driven Statistical Models for Natural Language Parsing - Collins - 1999 |
| 671 | A Maximum-Entropy-Inspired Parser - Charniak - 2000 |
| 174 | PCFG Models of Linguistic Tree Representations’. Computational Linguistics 24:613–632 - Johnson - 1998 |
| 145 | C.: Fast Exact Inference with a Factored Model for Natural Language Parsing. In - Klein, Manning - 2003 |
| 53 | Exploiting diversity in natural language processing - Henderson, Brill - 1999 |
| 49 | Coping with syntactic ambiguity or how to put the block in the box on the table - Church, Patil - 1982 |
| 38 | Recovering latent information in treebanks - Chiang, Bikel - 2002 |
| 29 | Compacting the Penn Treebank grammar - Krotov, Gaizauskas, et al. - 1998 |
| 1 | Syntactic Theory: A Formal Introduction. CUP - Sag, Wasow - 1999 |
