| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| torsos (0) - 1 freq torso (1) - 8 freq tornes (2) - 26 freq tors (2) - 2 freq jornos (2) - 2 freq tosses (2) - 3 freq toasts (2) - 2 freq forss (2) - 3 freq turbos (2) - 2 freq toass (2) - 2 freq torys (2) - 1 freq toss (2) - 27 freq horss (2) - 22 freq corss (2) - 9 freq horsis (2) - 3 freq ternos (2) - 1 freq tormod (2) - 1 freq horses (2) - 113 freq corses (2) - 1 freq oreos (2) - 1 freq torres (2) - 1 freq tories (2) - 115 freq torrs (2) - 2 freq loass (3) - 19 freq rowson (3) - 2 freq |
torsos (0) - 1 freq torso (2) - 8 freq horses (3) - 113 freq horsis (3) - 3 freq corses (3) - 1 freq ternos (3) - 1 freq torres (3) - 1 freq truss (3) - 4 freq torrs (3) - 2 freq tories (3) - 115 freq horss (3) - 22 freq tress (3) - 4 freq corss (3) - 9 freq tosses (3) - 3 freq tornes (3) - 26 freq tors (3) - 2 freq forss (3) - 3 freq turbos (3) - 2 freq toss (3) - 27 freq torys (3) - 1 freq toass (3) - 2 freq courses (4) - 13 freq trews (4) - 3 freq terns (4) - 2 freq tarns (4) - 1 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 - TRSS traces - 6 freq dresses - 18 freq terraces - 4 freq tracy's - 1 freq torsos - 1 freq doris's - 3 freq tresses - 1 freq traeces - 1 freq |
TORSOS |
| Time to execute Levenshtein function - 0.250821 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.397442 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.029931 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.042924 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.000829 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. |