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.
| Original language | English |
|---|---|
| Pages (from-to) | 116-123 |
| Number of pages | 8 |
| Journal | Proceedings of the Annual Meeting of the Association for Computational Linguistics |
| Volume | 1996-June |
| DOIs | |
| State | Published - 1996 |
| Event | 34th Annual Meeting of the Association for Computational Linguistics, ACL 1996 - Santa Cruz, United States Duration: Jun 24 1996 → Jun 27 1996 |
Fingerprint
Dive into the research topics of 'Synchronous models of language'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver