Synchronous Models of Language
cmp-lg
2008-02-03 v1 Computation and Language
Abstract
In synchronous rewriting, the productions of two rewriting systems are paired and applied synchronously in the derivation of a pair of strings. We present a new synchronous rewriting system and argue that it can handle certain phenomena that are not covered by existing synchronous systems. We also prove some interesting formal/computational properties of our system.
Cite
@article{arxiv.cmp-lg/9605032,
title = {Synchronous Models of Language},
author = {Owen Rambow and Giorgio Satta},
journal= {arXiv preprint arXiv:cmp-lg/9605032},
year = {2008}
}
Comments
8 pages uuencoded gzipped ps file