Previous abstract | CoNLL-2001 Proceedings | Next abstract
This paper presents an algorithm for extracting invertible probabilistic translation grammars from bilingual aligned and linguistically bracketed text. The invertibility condition requires all translation ambiguities to be resolved in the final translation grammar. The paper examines the complexity of inducing translation grammars and proposes a number of heuristics to reduce the theoretically exponential computation time.
[ps] [pdf] [bibtex]