| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| icker (0) - 2 freq ticker (1) - 3 freq wicker (1) - 2 freq licker (1) - 1 freq nicker (1) - 1 freq bicker (1) - 12 freq ickers (1) - 1 freq sicker (1) - 8 freq icey (2) - 3 freq tickler (2) - 4 freq cler (2) - 1 freq minker (2) - 2 freq sticker (2) - 10 freq ice (2) - 254 freq flicker (2) - 13 freq swicker (2) - 1 freq cer (2) - 1 freq inter (2) - 2 freq dickey (2) - 4 freq akker (2) - 1 freq dcer (2) - 1 freq nicer (2) - 6 freq picher (2) - 4 freq acher (2) - 1 freq wiker (2) - 1 freq |
icker (0) - 2 freq ickers (2) - 1 freq ckr (2) - 1 freq bicker (2) - 12 freq ackir (2) - 1 freq sicker (2) - 8 freq licker (2) - 1 freq wicker (2) - 2 freq ticker (2) - 3 freq nicker (2) - 1 freq fecker (3) - 14 freq mucker (3) - 11 freq unker (3) - 4 freq pyker (3) - 1 freq baker (3) - 26 freq sker (3) - 1 freq sucker (3) - 3 freq maker (3) - 18 freq raker (3) - 2 freq rocker (3) - 3 freq locker (3) - 3 freq cocker (3) - 1 freq fucker (3) - 22 freq qiucker (3) - 1 freq ackers (3) - 16 freq |
SoundEx code - I260 icker - 2 freq ichor - 1 freq iger' - 1 freq igor - 6 freq i'car - 1 freq i'shoor - 1 freq i'shore - 1 freq i'core - 1 freq i'cerry - 2 freq i'crew - 2 freq iqgri - 1 freq |
MetaPhone code - IKR icker - 2 freq igor - 6 freq i'car - 1 freq i'core - 1 freq i'crew - 2 freq |
ICKER |
| Time to execute Levenshtein function - 0.689316 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.206587 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.102707 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.103563 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.000915 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. |