A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is
Reversible Grammar in Natural Language Processing
We present a uniform computational architecture for developing reversible grammars for parsing and generation, and for bidirectipnal transfer in MT. We sketch the principles of a general reversible architecture and show how they are realized in the rewriting system for typed feature structu:res developed at the University of Stuttgart. The reversibility of parsing and gen:eration, and the bidirectionality of tralisfer rules fall out of general properties of the uniform architecture.doi:10.1007/978-1-4615-2722-0_4 fatcat:d7gw3hq55jfhlfmlvmivdp6r64