Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
kickarse (0) - 2 freq kickass (2) - 1 freq kickers (2) - 1 freq vicars (3) - 1 freq carse (3) - 17 freq lickers (3) - 2 freq kildare (3) - 2 freq pickers (3) - 1 freq sikkars (3) - 1 freq pickaxe (3) - 1 freq ickers (3) - 1 freq lockars (3) - 2 freq nickers (3) - 1 freq kickan (3) - 2 freq wickers (3) - 1 freq knickers (3) - 43 freq kicks (3) - 29 freq kitkats (3) - 1 freq coarse (3) - 67 freq kirsen (4) - 2 freq airse (4) - 13 freq recharge (4) - 1 freq muckers (4) - 4 freq kirst (4) - 6 freq nicklaus (4) - 1 freq |
kickarse (0) - 2 freq kickers (2) - 1 freq kickass (3) - 1 freq ickers (4) - 1 freq nickers (4) - 1 freq knickers (4) - 43 freq lockars (4) - 2 freq kicks (4) - 29 freq pickers (4) - 1 freq lickers (4) - 2 freq wickers (4) - 1 freq kuckles (5) - 1 freq ackers (5) - 16 freq feckers (5) - 7 freq hackers (5) - 1 freq backers (5) - 2 freq heckers (5) - 1 freq lockers (5) - 4 freq keckles (5) - 2 freq keekers (5) - 3 freq packers (5) - 1 freq deckers (5) - 2 freq fuckers (5) - 9 freq dockers (5) - 12 freq knackers (5) - 2 freq |
SoundEx code - K262 keekers - 3 freq kickers - 1 freq kaiser's - 2 freq keeker-kistie - 2 freq kayakers - 1 freq keekersqeeker - 1 freq kickarse - 2 freq keysersosse - 2 freq kaiserchiefs - 2 freq |
MetaPhone code - KKRS keekers - 3 freq kickers - 1 freq quaikeriss - 1 freq gawkers - 1 freq gowkairse - 7 freq gowkairsey - 2 freq gowkairsy - 2 freq cookiris - 4 freq kickarse - 2 freq |
KICKARSE |
Time to execute Levenshtein function - 0.184279 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.351609 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.027841 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.037761 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.000843 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. |