Error analysis of two types of grammar for the purpose of automatic rule refinement

3Citations
Citations of this article
36Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper compares a manually written MT grammar and a grammar learned automatically from an English-Spanish elicitation corpus with the ultimate purpose of automatically refining the translation rules. The experiment described here shows that the kind of automatic refinement operations required to correct a translation not only varies depending on the type of error, but also on the type of grammar. This paper describes the two types of grammars and gives a detailed error analysis of their output, indicating what kinds of refinements are required in each case. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Llitjós, A. F., Probst, K., & Carbonell, J. (2004). Error analysis of two types of grammar for the purpose of automatic rule refinement. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3265, 187–196. https://doi.org/10.1007/978-3-540-30194-3_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free