---

Next: Introduction

---

Reversible Unification Based Machine Translation

Gertjan van Noord
OTS RUU Trans 10
3512 JK Utrecht
vannoord@hutruu59.BITnet

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.

---

• Introduction
• Unification-based Transfer
• Reversible Unification Grammars
  • Reversibility
    • Symmetry
    • Computability
  • Possible relaxations
    • Cyclic and non-cyclic attributes
    • Reentrancies
• Final remarks
• Acknowledgements
• References
• About this document ...

---

Gertjan van Noord
Fri Nov 25 13:42:02 MET 1994