| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| turkish (0) - 23 freq 'turkish (1) - 1 freq duskish (2) - 1 freq turks (2) - 4 freq turnis (2) - 6 freq kurdish (2) - 1 freq turkeesh (2) - 1 freq buikish (2) - 1 freq trish (2) - 4 freq tuaks (3) - 1 freq turriff (3) - 1 freq varnish (3) - 6 freq turst (3) - 3 freq gutnish (3) - 1 freq mulish (3) - 1 freq turnips' (3) - 1 freq hurkilt (3) - 1 freq warnish (3) - 4 freq turnip (3) - 4 freq turn's (3) - 2 freq turfs (3) - 1 freq perish (3) - 12 freq zurich (3) - 5 freq verish (3) - 1 freq wankish (3) - 1 freq |
turkish (0) - 23 freq 'turkish (2) - 1 freq turkeesh (2) - 1 freq turks (3) - 4 freq trish (3) - 4 freq trash (4) - 11 freq parkash (4) - 1 freq turkeys (4) - 3 freq trisha (4) - 9 freq buikish (4) - 1 freq duskish (4) - 1 freq turnis (4) - 6 freq kurdish (4) - 1 freq truism (5) - 2 freq starfish (5) - 7 freq turps (5) - 2 freq tourism (5) - 88 freq garish (5) - 1 freq creish (5) - 5 freq lurks (5) - 6 freq thresh (5) - 3 freq trith (5) - 1 freq hrish (5) - 1 freq thickish (5) - 1 freq turves (5) - 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 - TRKX turkish - 23 freq 'turkish - 1 freq turkeesh - 1 freq |
TURKISH |
| Time to execute Levenshtein function - 0.782757 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 - 1.696851 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.106623 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.190049 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.000786 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. |