| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| traller (0) - 1 freq taaller (1) - 1 freq trailer (1) - 13 freq traaler (1) - 3 freq taller (1) - 23 freq trawler (1) - 3 freq raeler (2) - 1 freq trilled (2) - 1 freq trailen (2) - 1 freq trailed (2) - 17 freq driller (2) - 5 freq trolley (2) - 27 freq traveller (2) - 10 freq traaled (2) - 1 freq crawler (2) - 1 freq teller (2) - 1 freq traber (2) - 1 freq trawled (2) - 3 freq tiller (2) - 12 freq caller (2) - 78 freq traalers (2) - 2 freq traivler (2) - 2 freq trolled (2) - 1 freq trainer (2) - 10 freq smaller (2) - 13 freq |
traller (0) - 1 freq taller (2) - 23 freq traaler (2) - 3 freq trawler (2) - 3 freq trailer (2) - 13 freq taaller (2) - 1 freq thriller (3) - 1 freq tiller (3) - 12 freq traivler (3) - 2 freq teller (3) - 1 freq trolled (3) - 1 freq roller (3) - 27 freq trolley (3) - 27 freq trilled (3) - 1 freq traveller (3) - 10 freq driller (3) - 5 freq trellis (4) - 1 freq trolly (4) - 1 freq traiveller (4) - 22 freq trillin (4) - 1 freq trills (4) - 2 freq trolleys (4) - 4 freq troll (4) - 11 freq traill (4) - 2 freq trellan (4) - 2 freq |
SoundEx code - T646 trawlers - 4 freq trailer - 13 freq thriller - 1 freq trailers - 1 freq tirli-wirli - 3 freq traller - 1 freq thrillers - 1 freq trawler - 3 freq trawlerman - 1 freq traalers - 2 freq traaler - 3 freq tirlie-wirlie - 1 freq tarlair - 7 freq therealrayquinn - 1 freq |
MetaPhone code - TRLR trailer - 13 freq driller - 5 freq dirler - 1 freq traller - 1 freq trawler - 3 freq traaler - 3 freq tarlair - 7 freq |
TRALLER |
| Time to execute Levenshtein function - 0.215325 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 - 0.349378 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.028550 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.038495 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.000854 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. |