Sciweavers

64 search results - page 7 / 13
» Minimally Lexicalized Dependency Parsing
Sort
View
ACL
1996
15 years 3 months ago
Head Automata and Bilingual Tiling: Translation with Minimal Representations
We present a language model consisting of a collection of costed bidirectional finite state automata associated with the head words of phrases. The model is suitable for increment...
Hiyan Alshawi
NAACL
2010
14 years 11 months ago
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
Daniel Gildea
125
Voted
ACL
2011
14 years 5 months ago
Web-Scale Features for Full-Scale Parsing
Counts from large corpora (like the web) can be powerful syntactic cues. Past work has used web counts to help resolve isolated ambiguities, such as binary noun-verb PP attachment...
Mohit Bansal, Dan Klein
122
Voted
NAACL
2010
14 years 11 months ago
Ensemble Models for Dependency Parsing: Cheap and Good?
Previous work on dependency parsing used various kinds of combination models but a systematic analysis and comparison of these approaches is lacking. In this paper we implemented ...
Mihai Surdeanu, Christopher D. Manning
EMNLP
2004
15 years 3 months ago
Object-Extraction and Question-Parsing using CCG
Accurate dependency recovery has recently been reported for a number of wide-coverage statistical parsers using Combinatory Categorial Grammar (CCG). However, overall figures give...
Stephen Clark, Mark Steedman, James R. Curran