| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| trailer (0) - 13 freq trailers (1) - 1 freq traller (1) - 1 freq trailed (1) - 17 freq traivler (1) - 2 freq traaler (1) - 3 freq trailen (1) - 1 freq trawler (1) - 3 freq trainer (1) - 10 freq traivel (2) - 66 freq raider (2) - 1 freq trained (2) - 27 freq tailor (2) - 28 freq drainer (2) - 2 freq trader (2) - 9 freq tailen (2) - 1 freq tailfer (2) - 1 freq taaller (2) - 1 freq taller (2) - 23 freq traited (2) - 1 freq traiken (2) - 1 freq taaler (2) - 3 freq trail't (2) - 4 freq traiked (2) - 3 freq traivlar (2) - 3 freq |
trailer (0) - 13 freq traaler (1) - 3 freq trailen (2) - 1 freq trainer (2) - 10 freq trawler (2) - 3 freq trailers (2) - 1 freq traivler (2) - 2 freq traller (2) - 1 freq trailed (2) - 17 freq traalers (3) - 2 freq trails (3) - 13 freq traaled (3) - 1 freq traitor (3) - 7 freq trailin (3) - 27 freq traill (3) - 2 freq trailt (3) - 7 freq traivlar (3) - 3 freq traeder (3) - 1 freq raeler (3) - 1 freq trail (3) - 57 freq traber (3) - 1 freq traisur (3) - 3 freq trail' (3) - 1 freq taller (3) - 23 freq taaller (3) - 1 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 |
TRAILER |
| Time to execute Levenshtein function - 0.210008 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.378266 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.038361 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.051945 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.001150 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. |