Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
krishnan (0) - 1 freq krishnas (1) - 5 freq krishna (1) - 11 freq irishman (2) - 6 freq crashan (3) - 3 freq arisan (3) - 1 freq grinnan (3) - 1 freq rinnan (3) - 3 freq risan (3) - 7 freq rashan (3) - 2 freq kithan (3) - 1 freq irishland (3) - 1 freq riseman (3) - 1 freq brissan (3) - 1 freq writhan (3) - 1 freq freshnen (3) - 1 freq wishan (3) - 2 freq freshnin (3) - 1 freq tristan (3) - 15 freq krisamas (3) - 6 freq fishman (3) - 8 freq trisha (3) - 9 freq fishan (3) - 1 freq krishgm (3) - 2 freq brushan (3) - 1 freq |
krishnan (0) - 1 freq krishna (2) - 11 freq krishnas (2) - 5 freq freshnin (4) - 1 freq freshnen (4) - 1 freq irishman (4) - 6 freq freshenin (5) - 3 freq krishgm (5) - 2 freq irishmen (5) - 1 freq kirsenin (5) - 1 freq brosnan (5) - 1 freq brushan (5) - 1 freq rashan (5) - 2 freq trashcan (5) - 1 freq crashan (5) - 3 freq crashin (6) - 17 freq roushian (6) - 1 freq karohna (6) - 1 freq creshin (6) - 2 freq proushian (6) - 1 freq rissenin (6) - 1 freq brushin (6) - 10 freq crushin (6) - 5 freq treshin (6) - 1 freq rushin (6) - 16 freq |
SoundEx code - K625 kirkmaiden - 3 freq kirk-gangin - 1 freq kirk-goin - 1 freq kirsent - 2 freq kerosene - 2 freq kirkness - 1 freq kraikin - 1 freq kerrjin - 2 freq krissint - 1 freq kirsen - 2 freq kirkconnel - 3 freq kirsenin - 1 freq kirkmen - 2 freq kargem - 1 freq kirkmabreeke - 2 freq krissent - 1 freq kirkman - 1 freq krisamas - 6 freq kirkintilloch - 1 freq krishnas - 5 freq krishna - 11 freq kirkmuirhill - 1 freq keirsimmonsitv - 1 freq kerryjaneellis - 1 freq krishnan - 1 freq kerrycann - 1 freq krazkmr - 8 freq kkrcnnzbuj - 1 freq kriskiwim - 4 freq |
MetaPhone code - KRXNN krishnan - 1 freq |
KRISHNAN |
Time to execute Levenshtein function - 0.202826 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.367063 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.028511 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.037045 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.003152 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. |