Sciweavers

64 search results - page 2 / 13
» Minimally Lexicalized Dependency Parsing
Sort
View
ACL
2001
13 years 6 months ago
What is the Minimal Set of Fragments that Achieves Maximal Parse Accuracy?
We aim at finding the minimal set of fragments which achieves maximal parse accuracy in Data Oriented Parsing. Experiments with the Penn Wall Street Journal treebank show that cou...
Rens Bod
CLIN
2001
13 years 6 months ago
The Alpino Dependency Treebank
In this paper we present the Alpino Dependency Treebank and the tools that we have developed to facilitate the annotation process. Annotation typically starts with parsing a sente...
Leonoor van der Beek, Gosse Bouma, Rob Malouf, Ger...
EMNLP
2007
13 years 6 months ago
Incremental Dependency Parsing Using Online Learning
We describe an incremental parser that was trained to minimize cost over sentences rather than over individual parsing actions. This is an attempt to use the advantages of the two...
Richard Johansson, Pierre Nugues
CLIN
2000
13 years 6 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
ACL
1996
13 years 6 months ago
A New Statistical Parser Based on Bigram Lexical Dependencies
This paper describes a new statistical parser which is based on probabilities of dependencies between head-words in the parse tree. Standard bigram probability estimation techniqu...
Michael Collins