| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kayakers (0) - 1 freq maakers (2) - 3 freq taakers (2) - 4 freq knockers (3) - 2 freq waarkers (3) - 4 freq rakers (3) - 1 freq waaters (3) - 4 freq takers (3) - 2 freq knackers (3) - 2 freq waaker (3) - 1 freq kickers (3) - 1 freq maskers (3) - 1 freq makkers (3) - 2 freq tankers (3) - 2 freq markers (3) - 7 freq speakers (3) - 223 freq naysayers (3) - 1 freq jakers (3) - 1 freq packers (3) - 1 freq bayker's (3) - 1 freq taaker (3) - 1 freq mackers (3) - 1 freq jaykets (3) - 1 freq layers (3) - 21 freq ackers (3) - 16 freq |
kayakers (0) - 1 freq keekers (3) - 3 freq taakers (3) - 4 freq maakers (3) - 3 freq fakers (4) - 1 freq makkers (4) - 2 freq makers (4) - 8 freq jakers (4) - 1 freq ackers (4) - 16 freq beakers (4) - 1 freq waukers (4) - 1 freq kakes (4) - 1 freq bakers (4) - 24 freq rakers (4) - 1 freq takers (4) - 2 freq kickers (4) - 1 freq nokers (5) - 1 freq hikers (5) - 2 freq bikers (5) - 2 freq knickers (5) - 43 freq gawkers (5) - 1 freq kayak (5) - 1 freq maaker (5) - 1 freq hookers (5) - 2 freq hackers (5) - 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 - KYKRS kayakers - 1 freq |
KAYAKERS |
| Time to execute Levenshtein function - 0.215799 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.360868 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.028168 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.038007 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.000888 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. |