Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/de-gruyter/translation-memory-and-computer-assisted-translation-tool-for-medieval-tkOCWaWtVg
References (7)
-
I. Melamed (1997)
A Portable Algorithm for Mapping Bitext Correspondence -
Marcel Bollmann, Stefanie Dipper, J. Krasselt, Florian Petran (2012)
Manual and semi-automatic normalization of historical spelling - case studies from Early New High German -
I. Melamed (1996)
Automatic construction of clean broad-coverage translation lexiconsArXiv, cmp-lg/9607037
-
Jiawei Han, J. Pei, Yiwen Yin, Runying Mao (2006)
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree ApproachData Mining and Knowledge Discovery, 8
-
R. Agrawal, H. Mannila, R. Srikant, Hannu Toivonen, A. Verkamo (1996)
Fast Discovery of Association Rules -
S. Vogel, H. Ney, C. Tillmann (1996)
HMM-Based Word Alignment in Statistical Translation -
Melamed (1996)
v Automatic Construction of Clean Broad - Coverage Translation Lexicons in nd Conference of the Association for Machine Translation in the Montreal PQAmericas
- Publisher
- de Gruyter
- Copyright
- Copyright © 2013 by the
- ISSN
- 2064-0404
- eISSN
- 2064-0404
- DOI
- 10.1515/apd-2015-0008
- Publisher site
- See Article on Publisher Site
Abstract
Abstract Translation memories (TMs), as part of Computer Assisted Translation (CAT) tools, support translators reusing portions of formerly translated text. Fencing books are good candidates for using TMs due to the high number of repeated terms. Medieval texts suffer a number of drawbacks that make hard even “simple” rewording to the modern version of the same language. The analyzed difficulties are: lack of systematic spelling, unusual word orders and typos in the original. A hypothesis is made and verified that even simple modernization increases legibility and it is feasible, also it is worthwhile to apply translation memories due to the numerous and even extremely long repeated terms. Therefore, methods and algorithms are presented 1. for automated transcription of medieval texts (when a limited training set is available), and 2. collection of repeated patterns. The efficiency of the algorithms is analyzed for recall and precision.
Journal
Acta Periodica Duellatorum – de Gruyter
Published: May 1, 2013