Some computational complexity results for synchronous context-free grammars

Authors:
Giorgio Satta;Enoch Peserico
Affiliations:
University of Padua via Gradenigo, Padova, Italy;University of Padua via Gradenigo, Padova, Italy
Venue:
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Year:
2005

Citing 21
Cited 22

Probabilistic Languages: A Review and Some Open Questions

ACM Computing Surveys (CSUR)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The Theory of Parsing, Translation, and Compiling

The Theory of Parsing, Translation, and Compiling
The consensus string problem and the complexity of comparing hidden Markov models

Journal of Computer and System Sciences - Computational biology 2002
Computational Complexity of Problems on Probabilistic Grammars and Transducers

ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
Learning dependency translation models as collections of finite-state head transducers

Computational Linguistics - Special issue on finite-state methods in NLP
Stochastic inversion transduction grammars and bilingual parsing of parallel corpora

Computational Linguistics
Decoding complexity in word-replacement translation models

Computational Linguistics
Machine translation with a stochastic grammatical channel

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Recognition of linear context-free rewriting systems

ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
A statistical approach to language translation

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Evaluating grammar formalisms for applications to natural language processing and biological sequence analysis

Evaluating grammar formalisms for applications to natural language processing and biological sequence analysis
Probabilistic Finite-State Machines-Part I

IEEE Transactions on Pattern Analysis and Machine Intelligence
A syntax-based statistical translation model

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Discriminative training and maximum entropy models for statistical machine translation

ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
A weighted finite state transducer implementation of the alignment template model for statistical machine translation

NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
Multitext Grammars and synchronous parsers

NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
Loosely tree-based alignment for machine translation

ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Statistical machine translation by parsing

ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Generalized multitext grammars

ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
A hierarchical phrase-based model for statistical machine translation

ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics

Empirical lower bounds on the complexity of translational equivalence

ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Synchronous binarization for machine translation

HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Factoring synchronous grammars by sorting

COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
Extracting synchronous grammar rules from word-level alignments in linear time

COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms -- Revisited

CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Prior derivation models for formally syntax-based translation using linguistically syntactic parsing and tree kernels

SSST '08 Proceedings of the Second Workshop on Syntax and Structure in Statistical Translation
Factorization of synchronous context-free grammars in linear time

SSST '07 Proceedings of the NAACL-HLT 2007/AMTA Workshop on Syntax and Structure in Statistical Translation
Binarization, synchronous binarization, and target-side binarization

SSST '07 Proceedings of the NAACL-HLT 2007/AMTA Workshop on Syntax and Structure in Statistical Translation
Probabilistic synchronous tree-adjoining grammars for machine translation: the argument from bilingual dictionaries

SSST '07 Proceedings of the NAACL-HLT 2007/AMTA Workshop on Syntax and Structure in Statistical Translation
Empirical lower bounds on alignment error rates in syntax-based machine translation

SSST '09 Proceedings of the Third Workshop on Syntax and Structure in Statistical Translation
Binarization of synchronous context-free grammars

Computational Linguistics
Empirical lower bounds on translation unit error rate for the full class of inversion transduction grammars

IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Better synchronous binarization for machine translation

EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 1 - Volume 1
Two monolingual parses are better than one (synchronous parse)

HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Parsing and translation algorithms based on weighted extended tree transducers

ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
Algorithmic aspects of natural language processing

Algorithms and theory of computation handbook
Complexity, parsing, and factorization of tree-local multi-component tree-adjoining grammar

Computational Linguistics
Optimal head-driven parsing complexity for linear context-free rewriting systems

HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Prefix probability for probabilistic synchronous context-free grammars

HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
A $${\mathcal{O}(|G|n^6)}$$ time extension of inversion transduction grammars

Machine Translation
A generalized view on parsing and translation

IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Parsing of partially bracketed structures for parse selection

IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates some computational problems associated with probabilistic translation models that have recently been adopted in the literature on machine translation. These models can be viewed as pairs of probabilistic context-free grammars working in a 'synchronous' way. Two hardness results for the class NP are reported, along with an exponential time lower-bound for certain classes of algorithms that are currently used in the literature.