Two monolingual parses are better than one (synchronous parse)

Authors:
Chris Dyer
Affiliations:
University of Maryland, College Park, MD
Venue:
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Year:
2010

Citing 11
Cited 4

Syntax-Directed Transduction

Journal of the ACM (JACM)
An Improved Context-Free Recognizer

ACM Transactions on Programming Languages and Systems (TOPLAS)
Stochastic inversion transduction grammars and bilingual parsing of parallel corpora

Computational Linguistics
The intersection of finite state automata and definite clause grammars

ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Some computational complexity results for synchronous context-free grammars

HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Hierarchical Phrase-Based Translation

Computational Linguistics
Probabilistic inference for machine translation

EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Hierarchical phrase-based translation with weighted finite state transducers

NAACL '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Syntax augmented machine translation via chart parsing

StatMT '06 Proceedings of the Workshop on Statistical Machine Translation
Binarization of synchronous context-free grammars

Computational Linguistics
Better word alignments with supervised ITG models

ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - Volume 2

cdec: a decoder, alignment, and learning framework for finite-state and context-free translation models

ACLDemos '10 Proceedings of the ACL 2010 System Demonstrations
Fast generation of translation forest for large-scale SMT discriminative training

EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
A bayesian model for learning SCFGs with discontiguous rules

EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
Joshua 4.0: packing, PRO, and paraphrases

WMT '12 Proceedings of the Seventh Workshop on Statistical Machine Translation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a synchronous parsing algorithm that is based on two successive monolingual parses of an input sentence pair. Although the worst-case complexity of this algorithm is and must be O(n6) for binary SCFGs, its average-case run-time is far better. We demonstrate that for a number of common synchronous parsing problems, the two-parse algorithm substantially outperforms alternative synchronous parsing strategies, making it efficient enough to be utilized without resorting to a pruned search.