Sciweavers

101 search results - page 4 / 21
» Accurate Unlexicalized Parsing
Sort
View
EACL
1993
ACL Anthology
13 years 8 months ago
Ambiguity resolution in a reductionistic parser
We are concerned with dependencyoriented morphosyntactic parsing of running text. While a parsing grammar should avoid introducing structurallyunresolvable distinctionsin order to...
Atro Voutilainen, Pasi Tapanainen
EMNLP
2006
13 years 8 months ago
Extremely Lexicalized Models for Accurate and Fast HPSG Parsing
This paper describes an extremely lexicalized probabilistic model for fast and accurate HPSG parsing. In this model, the probabilities of parse trees are defined with only the pro...
Takashi Ninomiya, Takuya Matsuzaki, Yoshimasa Tsur...
ACL
2006
13 years 8 months ago
A Fast, Accurate Deterministic Parser for Chinese
We present a novel classifier-based deterministic parser for Chinese constituency parsing. Our parser computes parse trees from bottom up in one pass, and uses classifiers to make...
Mengqiu Wang, Kenji Sagae, Teruko Mitamura
ACL
2010
13 years 4 months ago
Simple, Accurate Parsing with an All-Fragments Grammar
We present a simple but accurate parser which exploits both large tree fragments and symbol refinement. We parse with all fragments of the training set, in contrast to much recent...
Mohit Bansal, Dan Klein
EMNLP
2010
13 years 4 months ago
Uptraining for Accurate Deterministic Question Parsing
It is well known that parsing accuracies drop significantly on out-of-domain data. What is less known is that some parsers suffer more from domain shifts than others. We show that...
Slav Petrov, Pi-Chuan Chang, Michael Ringgaard, Hi...