Web service for implementing a large-scale translation memory.
Version 0.0 — It's free!
Find the closest matches to your current text using powerful matching algorithms such as Levenshtein distance measures.
Focused on speed
Optimized for speed so that your translators get the matches they need as quickly as possible.
Load many different file formats so that your Translation Memory can be constructed from your existing data.