| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| targes (0) - 2 freq barges (1) - 2 freq targets (1) - 6 freq target (1) - 33 freq targe (1) - 5 freq tarves (1) - 8 freq verges (2) - 5 freq trees (2) - 441 freq tagus (2) - 1 freq wares (2) - 6 freq varged (2) - 1 freq bares (2) - 1 freq stages (2) - 16 freq 'ages (2) - 1 freq gadges (2) - 1 freq larger (2) - 3 freq argus (2) - 1 freq argos (2) - 8 freq wauges (2) - 1 freq taigles (2) - 4 freq darger (2) - 2 freq tangles (2) - 3 freq tarts (2) - 40 freq tales (2) - 149 freq dirges (2) - 1 freq |
targes (0) - 2 freq barges (2) - 2 freq tirgs (2) - 1 freq targe (2) - 5 freq tarves (2) - 8 freq target (2) - 33 freq targets (2) - 6 freq rages (3) - 9 freq tres (3) - 1 freq gurges (3) - 1 freq tarns (3) - 1 freq torres (3) - 1 freq forges (3) - 2 freq tries (3) - 74 freq dargs (3) - 4 freq tairgets (3) - 1 freq turves (3) - 1 freq largs (3) - 4 freq cargoes (3) - 2 freq cargos (3) - 1 freq tires (3) - 2 freq bairges (3) - 1 freq tories (3) - 117 freq garages (3) - 5 freq teries (3) - 1 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 - TRJS targes - 2 freq dirges - 1 freq dregies - 1 freq |
TARGES |
| Time to execute Levenshtein function - 0.175179 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.367565 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.027824 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.076856 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.000926 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. |