Skip to main content

Part of the book series: Text, Speech and Language Technology ((TLTB,volume 21))

Abstract

The TELA structure — a set of layered and linked lattices — the notion of similarity between TELA structures based on the notion of Edit Distance, and the MSSM algorithm based on dynamic programming techniques are all introduced in order to formalize Translation Memories (TM). We show how this approach leads to a real gain in recall and precision, and allows the extension of TM towards rudimentary, yet useful Example-Based Machine Translation (EBMT) that we call ‘Shallow Translation’.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Argamon, S., I. Dagan and Y. Krymolowski. 1998. A Memory-Based Approach to Learning Shallow Natural Language Patterns. In 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, Montreal, Quebec, Canada, 1:67–73.

    Google Scholar 

  • Collins, B. and P. Cunningham. 1997. Adaptation Guided Retrieval: Approaching EBMT with Caution. In Proceedings of the 7th International Conference on Theoretical and Methodological issues in Machine Translation, Santa Fe, NM., pp.119–126.

    Google Scholar 

  • Cranias, L., H. Papageorgiou and S. Piperidis. 1997. Example retrieval from a Translation Memory. Natural Language Engineering 3(4):255–277.

    Article  Google Scholar 

  • Furuse, O. and H. Iida. 1994. Constituent Boundary Parsing for Example-Based Machine Translation. In COLING-94: Proceedings of the 15th International Conference on Computational Linguistics, Kyoto, Japan, pp.105–111.

    Google Scholar 

  • Gale, W. and K. Church. 1993. A Program for Aligning Sentences in Bilingual Corpora. Computational Linguistics 19(l):75–102.

    Google Scholar 

  • Lafourcade, M. 1993. LEAF ou comment garder l’Originalité de l’ambiguité, Actualité Scientifique. In Troisièmes Journées Scientifiques Traductique-TA-TAO, Montréal, Quebec, Canada, pp.165–185 (inFrench).

    Google Scholar 

  • Lepage, Y. 1998. Solving analogies on words: an algorithm. In 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, Montreal, Quebec, Canada, 1:728–734.

    Google Scholar 

  • Planas, E. 1998. TELA: Structures and Algorithms for Memory-Based Machine Translation. PhD thesis, University Joseph Fourier, Grenoble, France (in French).

    Google Scholar 

  • Planas, E. 1999a. Towards Second Generation Translation Memories. In LISA Newsletter 1999 8(2):7–11.

    Google Scholar 

  • Planas, E. 1999b. Translation Memory Tools: Comparative studies of Star, Trados, IBM TM2 and Shallow Translation. In Proceedings of the LISA Asia Forum Workshop, Shanghai, China.

    Google Scholar 

  • Planas, E. 2000. Extending Translation Memories. In Proceedings of the Fifth EAMT Workshop, Harvesting Existing Resources, Ljubljana, Slovenia, [no page numbers], http://www.eamt.org/archive/1jubljana/Planas.htm.

    Google Scholar 

  • Sellers, P.H. 1980. The theory and computation of evolutionary distances: pattern recognition. Journal of Algorithms 127:359–373

    Article  MathSciNet  Google Scholar 

  • Takeda, K. 1996. Pattern-Based Machine Translation. In COLING-96: Proceedings of the 16th International Conference on Computational Linguistics, Copenhagen, Denmark, pp.1155–1158.

    Google Scholar 

  • Thompson, H. and C. Brew. 1996. Automatic Evaluation of Computer Generated text: Final Report on the TextEval Project. HCRC Working Paper, Human Communication Research Centre, University of Edinburgh, UK.

    Google Scholar 

  • Thurmair, G. 1997. Exchange Interfaces for Translation Tools. In Machine Translation Summit VI, San Diego, CA., pp.74–93.

    Google Scholar 

  • Ukkonen, E. 1985. Algorithms for Approximate String Matching. Information and Control 64:100–118.

    Article  MathSciNet  MATH  Google Scholar 

  • Veale, T. and A. Way. 1997. Gaijin: A Bootstrapping, Template-Driven Approach to Example-Based MT. In International Conference, Recent Advances in Natural Language Processing, Tzigov Chark, Bulgaria, pp.239–244.

    Google Scholar 

  • Wagner, A. and M. Fischer. 1974. The String-to-String Correction Problem. Journal of the ACM 21(1):168-173.

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Planas, E., Furuse, O. (2003). Formalizing Translation Memory. In: Carl, M., Way, A. (eds) Recent Advances in Example-Based Machine Translation. Text, Speech and Language Technology, vol 21. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-0181-6_5

Download citation

  • DOI: https://doi.org/10.1007/978-94-010-0181-6_5

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-1-4020-1401-7

  • Online ISBN: 978-94-010-0181-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics