Sciweavers

118 search results - page 16 / 24
» Japanese Dependency Parsing Using a Tournament Model
Sort
View
EMNLP
2010
13 years 5 months ago
Using Universal Linguistic Knowledge to Guide Grammar Induction
We present an approach to grammar induction that utilizes syntactic universals to improve dependency parsing across a range of languages. Our method uses a single set of manually-...
Tahira Naseem, Harr Chen, Regina Barzilay, Mark Jo...
ACL
2003
13 years 9 months ago
Accurate Unlexicalized Parsing
We demonstrate that an unlexicalized PCFG can parse much more accurately than previously shown, by making use of simple, linguistically motivated state splits, which break down fa...
Dan Klein, Christopher D. Manning
EMNLP
2007
13 years 9 months ago
Phrase Reordering Model Integrating Syntactic Knowledge for SMT
Reordering model is important for the statistical machine translation (SMT). Current phrase-based SMT technologies are good at capturing local reordering but not global reordering...
Dongdong Zhang, Mu Li, Chi-Ho Li, Ming Zhou
EACL
2003
ACL Anthology
13 years 9 months ago
Topological Parsing
We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these gram...
Gerald Penn, Mohammad Haji-Abdolhosseini
IJCAI
2007
13 years 9 months ago
Simple Training of Dependency Parsers via Structured Boosting
Recently, significant progress has been made on learning structured predictors via coordinated training algorithms such as conditional random fields and maximum margin Markov ne...
Qin Iris Wang, Dekang Lin, Dale Schuurmans