Sciweavers

NAACL
2010
13 years 2 months ago
Automatic Domain Adaptation for Parsing
Current statistical parsers tend to perform well only on their training domain and nearby genres. While strong performance on a few related domains is sufficient for many situatio...
David McClosky, Eugene Charniak, Mark Johnson
NAACL
2010
13 years 2 months ago
Appropriately Handled Prosodic Breaks Help PCFG Parsing
This paper investigates using prosodic information in the form of ToBI break indexes for parsing spontaneous speech. We revisit two previously studied approaches, one that hurt pa...
Zhongqiang Huang, Mary P. Harper
EMNLP
2010
13 years 2 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...
ACL
2010
13 years 2 months ago
Faster Parsing by Supertagger Adaptation
We propose a novel self-training method for a parser which uses a lexicalised grammar and supertagger, focusing on increasing the speed of the parser rather than its accuracy. The...
Jonathan K. Kummerfeld, Jessika Roesner, Tim Dawbo...
TSD
2010
Springer
13 years 2 months ago
Towards an N-Version Dependency Parser
Abstract. Maltparser is a contemporary dependency parsing machine learningbased system that shows great accuracy. However 90% for Labelled Attachment Score (LAS) seems to be a de f...
Miguel Ballesteros, Jesús Herrera, Virginia...
FUIN
2008
102views more  FUIN 2008»
13 years 4 months ago
Some Aspects of Parsing Expression Grammar
Parsing Expression Grammar (PEG) is a new way to specify syntax, by means of a top-down process with limited backtracking. It can be directly transcribed into a recursive-descent ...
Roman R. Redziejowski
CORR
1999
Springer
69views Education» more  CORR 1999»
13 years 4 months ago
Selective Magic HPSG Parsing
We propose a parser for constraintlogic grammars implementing HPSG that combines the advantages of dynamic bottom-up and advanced topdown control. The parser allows the user to ap...
Guido Minnen
CORR
1998
Springer
109views Education» more  CORR 1998»
13 years 4 months ago
A Maximum-Entropy Partial Parser for Unrestricted Text
This paper describes a partial parser that assigns syntactic structures to sequences of partof-speech tags. The program uses the maximum entropy parameter estimation method, which...
Wojciech Skut, Thorsten Brants
COLING
2002
13 years 4 months ago
Extending a Broad-Coverage Parser for a General NLP Toolkit
With the rapid growth of real world applications for NLP systems, there is a genuine demand for a general toolkit from which programmers with no linguistic knowledge can build spe...
Hassan Alam, Hua Cheng, Rachmat Hartono, Aman Kuma...
COGSCI
2004
148views more  COGSCI 2004»
13 years 4 months ago
Disfluencies, language comprehension, and Tree Adjoining Grammars
Disfluencies include editing terms such as uh and um as well as repeats and revisions. Little is known about how disfluencies are processed, and there has been next to no research...
Fernanda Ferreira, Ellen F. Lau, Karl G. D. Bailey