| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kickers (0) - 1 freq wickers (1) - 1 freq pickers (1) - 1 freq lickers (1) - 2 freq ickers (1) - 1 freq knickers (1) - 43 freq nickers (1) - 1 freq packers (2) - 1 freq sickens (2) - 2 freq ticker (2) - 3 freq wikkers (2) - 1 freq kivvers (2) - 5 freq kicks (2) - 29 freq mackers (2) - 1 freq wicker (2) - 2 freq pickters (2) - 1 freq minkers (2) - 3 freq dockers (2) - 12 freq bicker (2) - 12 freq jinkers (2) - 1 freq bikers (2) - 2 freq wiskers (2) - 1 freq killers (2) - 9 freq kickass (2) - 1 freq bicker's (2) - 2 freq |
kickers (0) - 1 freq knickers (2) - 43 freq kickarse (2) - 2 freq ickers (2) - 1 freq nickers (2) - 1 freq lickers (2) - 2 freq wickers (2) - 1 freq pickers (2) - 1 freq lockers (3) - 4 freq ackers (3) - 16 freq feckers (3) - 7 freq keekers (3) - 3 freq muckers (3) - 4 freq hackers (3) - 1 freq fuckers (3) - 9 freq kickass (3) - 1 freq deckers (3) - 2 freq backers (3) - 2 freq heckers (3) - 1 freq knockers (3) - 2 freq knackers (3) - 2 freq dockers (3) - 12 freq kicks (3) - 29 freq packers (3) - 1 freq mackers (3) - 1 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 |
KICKERS |
| Time to execute Levenshtein function - 0.210044 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.419100 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.035834 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.046325 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.000938 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. |