Pattern-Based Context-Free Grammars for Machine Translation
| dc.creator | Takeda, Koichi | |
| dc.date | 1996-07-11 | |
| dc.date.accessioned | 2026-07-07T09:10:28Z | |
| dc.date.available | 2026-07-07T09:10:28Z | |
| dc.description | This paper proposes the use of ``pattern-based'' context-free grammars as a basis for building machine translation (MT) systems, which are now being adopted as personal tools by a broad range of users in the cyberspace society. We discuss major requirements for such tools, including easy customization for diverse domains, the efficiency of the translation algorithm, and scalability (incremental improvement in translation quality through user interaction), and describe how our approach meets these requirements. | |
| dc.description | 8 pages, latex + aclap.sty | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9607011 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9607011 | |
| dc.identifier | Proceedings of the 34th Meeting of the Association for Computational Linguistics (ACL'96) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151360 | |
| dc.subject | Computation and Language | |
| dc.title | Pattern-Based Context-Free Grammars for Machine Translation | |
| dc.type | text |