Synchronous Models of Language
| dc.creator | Rambow, Owen | |
| dc.creator | Satta, Giorgio | |
| dc.date | 1996-05-27 | |
| dc.date.accessioned | 2026-07-07T09:10:19Z | |
| dc.date.available | 2026-07-07T09:10:19Z | |
| dc.description | 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. | |
| dc.description | 8 pages uuencoded gzipped ps file | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9605032 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9605032 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151318 | |
| dc.subject | Computation and Language | |
| dc.title | Synchronous Models of Language | |
| dc.type | text |