Machine Translation

, Volume 25, Issue 4, pp 291–315

A \({\mathcal{O}(|G|n^6)}\) time extension of inversion transduction grammars

Article

DOI: 10.1007/s10590-011-9107-8

Cite this article as:
Søgaard, A. Machine Translation (2011) 25: 291. doi:10.1007/s10590-011-9107-8
  • 90 Downloads

Abstract

Range concatenation grammars are viewed as a hierarchy of synchronous grammars. It is shown how inversion transduction grammars (ITGs) and extensions thereof, including synchronous tree-adjoining grammars, are captured by the hierarchy, and the expressivity and linguistic relevance of subclasses of the hierarchy are discussed. A \({\mathcal{O}(|G|n^6)}\) time extension of ITGs is proposed. The extension translates cross-serial dependencies into nested ones and handles complex kinds of discontinuous translation units and so-called inside-out alignments. In fact, our \({\mathcal{O}(|G|n^6)}\) time extension generates all possible alignments. It is shown that this additional expressivity comes at the cost of probabilistic parsing.

Keywords

Range concatenation grammar Generative capacity Computational complexity Inversion transduction grammar Synchronous tree-adjoining grammar 

Copyright information

© Springer Science+Business Media B.V. 2011

Authors and Affiliations

  1. 1.Center for Language TechnologyUniversity of CopenhagenCopenhagenDenmark

Personalised recommendations