On multiple context-free grammars
Theoretical Computer Science
Machine translation divergences: a formal description and proposed solution
Computational Linguistics
Independent parallelism in finite copying parallel rewriting systems
Theoretical Computer Science
On the complexity analysis of static analyses
Journal of the ACM (JACM)
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
Parsing with discontinuous constituents
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Synchronous tree-adjoining grammars
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Stochastic lexicalized tree-adjoining grammars
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Efficient parsing for bilexical context-free grammars and head automaton grammars
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Computational Linguistics
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
Stochastic lexicalized inversion transduction grammar for alignment
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Machine translation using probabilistic synchronous dependency insertion grammars
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Compiling Comp Ling: practical weighted dynamic programming and the Dyna language
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
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
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
Inducing word alignments with bilexical synchronous trees
COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
Statistical machine translation
ACM Computing Surveys (CSUR)
Dynamic Programming Algorithms as Products of Weighted Logic Programs
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
A simple and effective hierarchical phrase reordering model
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Defining syntax-directed translations by tree bimorphisms
Theoretical Computer Science
Inversion transduction grammar for joint phrasal translation modeling
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
Correspondence-guided synchronous parsing of parallel corpora
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Parsing word-aligned parallel corpora in a grammar induction context
ParaText '05 Proceedings of the ACL Workshop on Building and Using Parallel Texts
Machine translation as lexicalized parsing with hooks
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Binarization of synchronous context-free grammars
Computational Linguistics
Unsupervised multilingual grammar induction
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 1 - Volume 1
An optimal-time binarization algorithm for linear context-free rewriting systems with fan-out two
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
Learning common grammar from multilingual corpus
ACLShort '10 Proceedings of the ACL 2010 Conference Short Papers
Unsupervised multilingual learning
Unsupervised multilingual learning
An overview of probabilistic tree transducers for natural language processing
CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing
Machine translation based on constraint-based synchronous grammar
IJCNLP'05 Proceedings of the Second international joint conference on Natural Language Processing
Polynomial time learning of some multiple context-free languages with a minimally adequate teacher
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
| Hi-index | 0.00 |
Multitext Grammars (MTGs) generate arbitrarily many parallel texts via production rules of arbitrary length. Both ordinary MTGs and their bilexical subclass admit relatively efficient parsers. Yet, MTGs are more expressive than other synchronous formalisms for which parsers have been described in the literature. The combination of greater expressive power and relatively low cost of inference makes MTGs an attractive foundation for practical models of translational equivalence.