Pattern-based context-free grammars for machine translation

12Citations
Citations of this article
75Readers
Mendeley users who have this article in their library.

Abstract

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.

References Powered by Scopus

An Efficient Context-Free Parsing Algorithm

974Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Semantic language and multi-language MT approach based on SL

20Citations
N/AReaders
Get full text

A pattern-based machine translation system extended by example-based processing

10Citations
N/AReaders
Get full text

A new machine translation approach using multiple translation engines and sentence partitioning

2Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Takeda, K. (1996). Pattern-based context-free grammars for machine translation. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (Vol. 1996-June, pp. 144–151). Association for Computational Linguistics (ACL). https://doi.org/10.3115/981863.981883

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 24

69%

Researcher 7

20%

Professor / Associate Prof. 2

6%

Lecturer / Post doc 2

6%

Readers' Discipline

Tooltip

Computer Science 30

79%

Linguistics 5

13%

Social Sciences 2

5%

Philosophy 1

3%

Save time finding and organizing research with Mendeley

Sign up for free