Sciweavers

4 search results - page 1 / 1
» A low-complexity, broad-coverage probabilistic Dependency Pa...
Sort
View
NAACL
2003
13 years 8 months ago
A low-complexity, broad-coverage probabilistic Dependency Parser for English
Large-scale parsing is still a complex and timeconsuming process, often so much that it is infeasible in real-world applications. The parsing system described here addresses this ...
Gerold Schneider
EMNLP
2004
13 years 8 months ago
Bilingual Parsing with Factored Estimation: Using English to Parse Korean
We describe how simple, commonly understood statistical models, such as statistical dependency parsers, probabilistic context-free grammars, and word-to-word translation models, c...
David A. Smith, Noah A. Smith
ACL
2010
13 years 5 months ago
A Probabilistic Generative Model for an Intermediate Constituency-Dependency Representation
We present a probabilistic model extension to the Tesni`ere Dependency Structure (TDS) framework formulated in (Sangati and Mazza, 2009). This representation incorporates aspects ...
Federico Sangati
TSD
2007
Springer
14 years 1 months ago
Accurate Unlexicalized Parsing for Modern Hebrew
Many state-of-the-art statistical parsers for English can be viewed as Probabilistic Context-Free Grammars (PCFGs) acquired from treebanks consisting of phrase-structure trees enri...
Reut Tsarfaty, Khalil Sima'an