| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| torches (0) - 14 freq torche (1) - 8 freq touches (1) - 21 freq torche's (1) - 1 freq torchie (2) - 1 freq iurches (2) - 1 freq teaches (2) - 3 freq touchts (2) - 1 freq torch (2) - 27 freq pouches (2) - 5 freq erches (2) - 1 freq torres (2) - 1 freq tories (2) - 117 freq touched (2) - 75 freq horshes (2) - 1 freq arches (2) - 17 freq tochts (2) - 6 freq lurches (2) - 2 freq hooches (2) - 1 freq coaches (2) - 9 freq airches (2) - 12 freq pooches (2) - 44 freq orchis (2) - 1 freq perches (2) - 2 freq taiches (2) - 1 freq |
torches (0) - 14 freq touches (2) - 21 freq torche's (2) - 1 freq torche (2) - 8 freq orchis (3) - 1 freq airches (3) - 12 freq perches (3) - 2 freq marches (3) - 16 freq merches (3) - 3 freq arches (3) - 17 freq taiches (3) - 1 freq lurches (3) - 2 freq trochs (3) - 5 freq teaches (3) - 3 freq iurches (3) - 1 freq torchie (3) - 1 freq erches (3) - 1 freq torch (3) - 27 freq teechis (4) - 1 freq eitches (4) - 1 freq rochs (4) - 1 freq trachels (4) - 1 freq riches (4) - 23 freq brooches (4) - 1 freq crouches (4) - 2 freq |
SoundEx code - T622 traces - 7 freq turkish - 23 freq triggest - 1 freq trackies - 8 freq tragic - 17 freq turquoise - 5 freq terraces - 4 freq targes - 2 freq tarshish - 1 freq torche's - 1 freq trossachs - 8 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 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 |
TORCHES |
| Time to execute Levenshtein function - 0.205863 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.353602 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.027691 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.038275 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.000925 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. |