| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| turkistan (0) - 2 freq tristan (2) - 15 freq kurdistan (2) - 1 freq traistin (3) - 1 freq burstan (3) - 1 freq turkish (3) - 23 freq puritan (3) - 2 freq christan (3) - 1 freq pakistan (3) - 3 freq thristin (3) - 2 freq traistit (4) - 2 freq tisan (4) - 2 freq testan (4) - 1 freq tredsman (4) - 3 freq durkit (4) - 1 freq surprisan (4) - 1 freq driltan (4) - 1 freq furgittin (4) - 3 freq insistan (4) - 1 freq tiftan (4) - 1 freq risan (4) - 7 freq prodistan (4) - 2 freq terestin (4) - 1 freq hurkilt (4) - 1 freq wurkin (4) - 22 freq |
turkistan (0) - 2 freq tristan (3) - 15 freq traistin (4) - 1 freq kurdistan (4) - 1 freq trustin (5) - 6 freq torsten (5) - 1 freq thristin (5) - 2 freq terestin (5) - 1 freq trystin (5) - 5 freq turkish (5) - 23 freq pakistan (5) - 3 freq burstan (5) - 1 freq tristie (6) - 1 freq tristy (6) - 1 freq ruistin (6) - 1 freq ristin (6) - 3 freq freistin (6) - 1 freq trimsan (6) - 2 freq crestan (6) - 1 freq roostan (6) - 1 freq kistin (6) - 3 freq tourists (6) - 57 freq froestan (6) - 1 freq tertan (6) - 1 freq pakistani (6) - 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 - TRKSTN turkistan - 2 freq |
TURKISTAN |
| Time to execute Levenshtein function - 0.599774 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.772837 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.032842 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.085859 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.000920 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. |