Sciweavers

16 search results - page 3 / 4
» Grammar Extraction from Treebanks for Hindi and Telugu
Sort
View
ACL
2004
13 years 7 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...
ACL
2006
13 years 7 months ago
Trace Prediction and Recovery with Unlexicalized PCFGs and Slash Features
This paper describes a parser which generates parse trees with empty elements in which traces and fillers are co-indexed. The parser is an unlexicalized PCFG parser which is guara...
Helmut Schmid
NAACL
2010
13 years 3 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
NAACL
2010
13 years 3 months ago
Joint Parsing and Alignment with Weakly Synchronized Grammars
Syntactic machine translation systems extract rules from bilingual, word-aligned, syntactically parsed text, but current systems for parsing and word alignment are at best cascade...
David Burkett, John Blitzer, Dan Klein
COLING
2002
13 years 5 months ago
Lenient Default Unification for Robust Processing within Unification Based Grammar Formalisms
This paper describes new default unification, lenient default unification. It works efficiently, and gives more informative results because it maximizes the amount of information ...
Takashi Ninomiya, Yusuke Miyao, Jun-ichi Tsujii