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.- Anthology ID:
- 2004.amta-papers.21
- Volume:
- Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers
- Month:
- September 28 - October 2
- Year:
- 2004
- Address:
- Washington, USA
- Venue:
- AMTA
- SIG:
- Publisher:
- Springer
- Note:
- Pages:
- 187–196
- Language:
- URL:
- https://link.springer.com/chapter/10.1007/978-3-540-30194-3_21
- DOI:
- Cite (ACL):
- Ariadna Font Llitjós, Katharina Probst, and Jaime Carbonell. 2004. Error analysis of two types of grammar for the purpose of automatic rule refinement. In Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers, pages 187–196, Washington, USA. Springer.
- Cite (Informal):
- Error analysis of two types of grammar for the purpose of automatic rule refinement (Font Llitjós et al., AMTA 2004)
- PDF:
- https://link.springer.com/chapter/10.1007/978-3-540-30194-3_21