Sciweavers

573 search results - page 15 / 115
» Probabilistic Parsing Strategies
Sort
View
ACL
2001
13 years 11 months ago
Parse Forest Computation of Expected Governors
In a headed tree, each terminal word can be uniquely labeled with a governing word and grammatical relation. This labeling is a summary of a syntactic analysis which eliminates de...
Helmut Schmid, Mats Rooth
IWPT
2001
13 years 11 months ago
Efficient Sentence Parsing with Language Specific Features: A case Study of Czech
This paper presents two optimalizations of standard parsing techniques applied to Czech as a representative of a free word order language with rich morphology. Our approach is bas...
Ales Horák, Pavel Smrz
AIIA
2001
Springer
14 years 2 months ago
Wide Coverage Incremental Parsing by Learning Attachment Preferences
This paper presents a novel method for wide coverage parsing using an incremental strategy, which is psycholinguistically motivated. A recursive neural network is trained on treeba...
Fabrizio Costa, Vincenzo Lombardo, Paolo Frasconi,...
ACL
1997
13 years 11 months ago
Three Generative, Lexicalised Models for Statistical Parsing
In this paper we first propose a new statistical parsing model, which is a generative model of lexicalised context-free grammar. We then extend the model to include a probabilisti...
Michael Collins
ACL
2011
13 years 1 months ago
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems
We study the problem of finding the best headdriven parsing strategy for Linear ContextFree Rewriting System productions. A headdriven strategy must begin with a specified right...
Pierluigi Crescenzi, Daniel Gildea, Andrea Marino,...