Sciweavers

182 search results - page 29 / 37
» Context-Free Valence Grammars - Revisited
Sort
View
108
Voted
ACL
2009
14 years 7 months ago
Demonstration of Joshua: An Open Source Toolkit for Parsing-based Machine Translation
We describe Joshua (Li et al., 2009a)1, an open source toolkit for statistical machine translation. Joshua implements all of the algorithms required for translation via synchronou...
Zhifei Li, Chris Callison-Burch, Chris Dyer, Juri ...
COLING
2002
14 years 9 months ago
Linking Syntactic and Semantic Arguments in a Dependency-based Formalism
We propose a formal characterization of variation in the syntactic realization of semantic arguments, using hierarchies of syntactic relations and thematic roles, and a mechanism ...
Christian Korthals, Ralph Debusmann
ACL
1998
14 years 10 months ago
Conditions on Consistency of Probabilistic Tree Adjoining Grammars
Much of the power of probabilistic methods in modelling language comes from their ability to compare several derivations for the same string in the language. An important starting...
Anoop Sarkar
LREC
2010
203views Education» more  LREC 2010»
14 years 11 months ago
Arabic Parsing Using Grammar Transforms
We investigate Arabic Context Free Grammar parsing with dependency annotation comparing lexicalised and unlexicalised parsers. We study how morphosyntactic as well as function tag...
Lamia Tounsi, Josef van Genabith
77
Voted
ACL
1990
14 years 10 months ago
Lexical and Syntactic Rules in a Tree Adjoining Grammar
according to this definition2. Each elementary tree is constrained to have at least one terminal at its frontier which serves as 'head' (or 'anchor'). Sentence...
Anne Abeillé