NLPExplorer
Papers
Venues
Authors
Authors Timeline
Field of Study
URLs
ACL N-gram Stats
TweeNLP
API
Team
Worst-Case Synchronous Grammar Rules
Daniel Gildea
|
Daniel Štefankovič
|
Paper Details:
Month: April
Year: 2007
Location: Rochester, New York
Venue:
NAACL |
Citations
URL
Binarization of Synchronous Context-Free Grammars
Liang Huang
|
Hao Zhang
|
Daniel Gildea
|
Kevin Knight
|
Grammar Factorization by Tree Decomposition
Daniel Gildea
|
Optimal Reduction of Rule Length in Linear Context-Free Rewriting Systems
Carlos Gómez-Rodríguez
|
Marco Kuhlmann
|
Giorgio Satta
|
David Weir
|
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems
Pierluigi Crescenzi
|
Daniel Gildea
|
Andrea Marino
|
Gianluca Rossi
|
Giorgio Satta
|
Prefix Probability for Probabilistic Synchronous Context-Free Grammars
Mark-Jan Nederhof
|
Giorgio Satta
|
No URLs Found
Field Of Study
Task
Machine Translation
Language
English
Similar Papers
Cross Language Dependency Parsing using a Bilingual Lexicon
Hai Zhao
|
Yan Song
|
Chunyu Kit
|
Guodong Zhou
|
Extending Statistical Machine Translation with Discriminative and Trigger-Based Lexicon Models
Arne Mauser
|
Saša Hasan
|
Hermann Ney
|
Integrating Graph-Based and Transition-Based Dependency Parsers
Joakim Nivre
|
Ryan McDonald
|
A treebank-based study on the influence of Italian word order on parsing performance
Anita Alicante
|
Cristina Bosco
|
Anna Corazza
|
Alberto Lavelli
|
Improving Arabic-Chinese Statistical Machine Translation using English as Pivot Language
Nizar Habash
|
Jun Hu
|