Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
krishnas (0) - 5 freq krishna (1) - 11 freq krishnan (1) - 1 freq krisamas (2) - 6 freq krishgm (3) - 2 freq prisons (3) - 1 freq prison's (3) - 1 freq risings (3) - 2 freq krispies (3) - 1 freq irishness (3) - 1 freq geishas (3) - 1 freq krings (3) - 1 freq krista (3) - 4 freq trisha (3) - 9 freq risins (3) - 2 freq irishman (3) - 6 freq kishies (3) - 4 freq króna (4) - 1 freq risen (4) - 16 freq kyisses (4) - 1 freq isna (4) - 389 freq prisoner (4) - 35 freq kirns (4) - 2 freq pishae (4) - 2 freq kinnae (4) - 10 freq |
krishnas (0) - 5 freq krishnan (2) - 1 freq krishna (2) - 11 freq krisamas (4) - 6 freq irishness (5) - 1 freq risins (5) - 2 freq krispies (5) - 1 freq kishies (5) - 4 freq krishgm (5) - 2 freq prisons (5) - 1 freq konshis (6) - 1 freq resins (6) - 1 freq rehns (6) - 1 freq rushes (6) - 19 freq freshness (6) - 7 freq rosines (6) - 1 freq brushan (6) - 1 freq kardashians (6) - 2 freq presons (6) - 1 freq perishes (6) - 1 freq freshner (6) - 1 freq raisons (6) - 18 freq frisians (6) - 3 freq rashes (6) - 29 freq crushes (6) - 1 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 - KRXNS croatians - 2 freq creation's - 1 freq creations - 3 freq creatioun's - 1 freq krishnas - 5 freq |
KRISHNAS |
Time to execute Levenshtein function - 0.256549 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.782049 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.047859 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.078180 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.001025 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. |