| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| trochs (0) - 5 freq troch (1) - 13 freq brochs (1) - 5 freq rochs (1) - 1 freq thocts (2) - 1 freq tracks (2) - 49 freq broche (2) - 1 freq crocus (2) - 5 freq mochs (2) - 4 freq trows (2) - 35 freq troughs (2) - 4 freq vrocht (2) - 35 freq throcht (2) - 1 freq drocht (2) - 3 freq thochy (2) - 1 freq trucks (2) - 11 freq wrocht (2) - 202 freq lochs (2) - 30 freq trock (2) - 12 freq frocks (2) - 16 freq thoche (2) - 1 freq crocks (2) - 5 freq trouch (2) - 1 freq trotts (2) - 1 freq rocks (2) - 85 freq |
trochs (0) - 5 freq brochs (2) - 5 freq rochs (2) - 1 freq troch (2) - 13 freq trucks (3) - 11 freq torches (3) - 14 freq tricks (3) - 38 freq trecks (3) - 1 freq traces (3) - 6 freq trochfus (3) - 1 freq troughs (3) - 4 freq trooths (3) - 1 freq tracks (3) - 49 freq truths (3) - 6 freq trouch (3) - 1 freq tracts (3) - 4 freq trenches (4) - 11 freq erches (4) - 1 freq triceps (4) - 1 freq truiths (4) - 2 freq torche (4) - 8 freq troves (4) - 1 freq trophy (4) - 15 freq troth (4) - 18 freq hochs (4) - 12 freq |
SoundEx code - T622 traces - 6 freq turkish - 23 freq triggest - 1 freq trackies - 8 freq tragic - 16 freq turquoise - 4 freq terraces - 4 freq targes - 2 freq tarshish - 1 freq torche's - 1 freq torches - 14 freq tracy's - 1 freq torsos - 1 freq tricycle - 2 freq tregijo - 13 freq 'tregijo - 1 freq 'turkish - 1 freq turkeys - 3 freq trochs - 5 freq turkey's - 1 freq trokes - 1 freq troughs - 4 freq trosky's - 1 freq tresses - 1 freq turkeesh - 1 freq traeces - 1 freq torquoise - 1 freq trossachs - 7 freq tharsis - 1 freq tras-os-montes - 1 freq tragically - 2 freq trajectory - 4 freq tragicomic - 1 freq thiriggies - 1 freq turkistan - 2 freq trashcan - 1 freq traceysmith - 1 freq |
MetaPhone code - TRXS torche's - 1 freq torches - 14 freq trochs - 5 freq |
TROCHS |
| Time to execute Levenshtein function - 0.194537 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.383484 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.027415 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.037501 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.001008 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. |