| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| trilingual (0) - 8 freq tri-lingual (1) - 1 freq bilingual (2) - 37 freq 'bilingual' (3) - 1 freq trilingualism (3) - 1 freq billingual (3) - 1 freq bi-lingual (3) - 2 freq tribunal (4) - 4 freq trailing (4) - 6 freq trivial (4) - 3 freq multilingual (4) - 27 freq toiling (4) - 2 freq trianglar (4) - 2 freq lingua (4) - 10 freq criminal (4) - 37 freq criminoal (4) - 1 freq monolingual (4) - 5 freq original (4) - 117 freq writing' (5) - 1 freq trivia (5) - 2 freq wilinae (5) - 1 freq illegal (5) - 31 freq richual (5) - 1 freq tring (5) - 1 freq critical (5) - 19 freq |
trilingual (0) - 8 freq tri-lingual (2) - 1 freq bilingual (4) - 37 freq bi-lingual (5) - 2 freq billingual (5) - 1 freq trailing (5) - 6 freq trilingualism (5) - 1 freq trianglar (6) - 2 freq 'bilingual' (6) - 1 freq triangle (6) - 8 freq monolingual (6) - 5 freq toiling (6) - 2 freq tribunal (6) - 4 freq tellingly (6) - 1 freq tryangil (6) - 1 freq railing (7) - 6 freq trailin (7) - 27 freq terminal (7) - 11 freq ruling (7) - 1 freq trolling (7) - 3 freq tranquil (7) - 1 freq erling (7) - 1 freq trailin' (7) - 1 freq tingil (7) - 4 freq trading (7) - 11 freq |
SoundEx code - T645 trailin - 27 freq trilingual - 8 freq truelins - 4 freq thirlin-tae - 1 freq trailing - 6 freq tirlin - 13 freq twirlin' - 1 freq trailen - 1 freq tirlan - 5 freq traalin - 1 freq thairlane - 4 freq treelined - 1 freq thirlins - 4 freq thirlin - 7 freq trewlins - 3 freq twirlin - 5 freq trellan - 2 freq trawlin - 12 freq tri-lingual - 1 freq trillin - 1 freq tree-lined - 2 freq tarland - 4 freq tarlan - 4 freq trillions - 1 freq trilingualism - 1 freq trillion - 1 freq twirling - 1 freq trailin' - 1 freq trolling - 3 freq trollin - 1 freq thrilling - 1 freq therealmac - 1 freq |
MetaPhone code - TRLNKL trilingual - 8 freq tri-lingual - 1 freq |
TRILINGUAL |
| Time to execute Levenshtein function - 0.678413 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 1.103404 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.037874 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.094248 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.001052 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |