Sciweavers

329 search results - page 25 / 66
» Stacking Dependency Parsers
Sort
View
CORR
1998
Springer
127views Education» more  CORR 1998»
13 years 7 months ago
Towards an implementable dependency grammar
Syntactic models should be descriptively adequate and parsable. A syntactic description is autonomous in the sense that it has certain explicitformal properties. Such a descriptio...
Timo Järvinen, Pasi Tapanainen
COLING
2008
13 years 9 months ago
Parsing the SynTagRus Treebank of Russian
We present the first results on parsing the SYNTAGRUS treebank of Russian with a data-driven dependency parser, achieving a labeled attachment score of over 82% and an unlabeled a...
Joakim Nivre, Igor Boguslavsky, Leonid L. Iomdin
ACL
2009
13 years 5 months ago
Incremental Parsing with Monotonic Adjoining Operation
This paper describes an incremental parser based on an adjoining operation. By using the operation, we can avoid the problem of infinite local ambiguity in incremental parsing. Th...
Yoshihide Kato, Shigeki Matsubara
AAAI
2008
13 years 9 months ago
Learning to Identify Reduced Passive Verb Phrases with a Shallow Parser
Our research is motivated by the observation that NLP systems frequently mislabel passive voice verb phrases as being in the active voice when there is no auxiliary verb (e.g., &q...
Sean Igo, Ellen Riloff
ICS
2003
Tsinghua U.
14 years 22 days ago
Estimating cache misses and locality using stack distances
Cache behavior modeling is an important part of modern optimizing compilers. In this paper we present a method to estimate the number of cache misses, at compile time, using a mac...
Calin Cascaval, David A. Padua