Reversible unification based machine translation

  • Authors:
  • Gertjan van Noord

  • Affiliations:
  • OTS RUU Trans, Utrecht

  • Venue:
  • COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper it will be shown how unification grammars can be used to build a reversible machine translation system.Unification grammars are often used to define the relation between strings and meaning representations in a declarative way. Such grammars are sometimes used in a bidirectional way, thus the same grammar is used for both parsing and generation. In this paper I will show how to use bidirectional unification grammars to define reversible relations between language dependent meaning representations. Furthermore it is shown how to obtain a completely reversible MT system using a series of (bidirectional) unification grammars.