Sciweavers

1229 search results - page 17 / 246
» A New Method for Dependent Parsing
Sort
View
ACL
2004
13 years 9 months ago
Long-Distance Dependency Resolution in Automatically Acquired Wide-Coverage PCFG-Based LFG Approximations
This paper shows how finite approximations of long distance dependency (LDD) resolution can be obtained automatically for wide-coverage, robust, probabilistic Lexical-Functional G...
Aoife Cahill, Michael Burke, Ruth O'Donovan, Josef...
COLING
1990
13 years 8 months ago
To Parse or Not to Parse: Relation-Driven Text Skimming
We have designed and implemented a text processing system that can extract important information from hundreds of paragraphs per hour and can be transported within weeks to a new ...
Paul S. Jacobs
CLIN
2000
13 years 9 months ago
Alpino: Wide-coverage Computational Analysis of Dutch
Alpino is a wide-coverage computational analyzer of Dutch which aims at accurate, full, parsing of unrestricted text. We describe the head-driven lexicalized grammar and the lexic...
Gosse Bouma, Gertjan van Noord, Rob Malouf
EMNLP
2007
13 years 9 months ago
Bootstrapping Feature-Rich Dependency Parsers with Entropic Priors
One may need to build a statistical parser for a new language, using only a very small labeled treebank together with raw text. We argue that bootstrapping a parser is most promis...
David A. Smith, Jason Eisner
ACL
2003
13 years 9 months ago
A Tabulation-Based Parsing Method that Reduces Copying
This paper presents a new bottom-up chart parsing algorithm for Prolog along with a compilation procedure that reduces the amount of copying at run-time to a constant number (2) p...
Gerald Penn, Cosmin Munteanu