| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fishcakes (0) - 5 freq fishwifes (3) - 2 freq aitcakes (3) - 3 freq fishes (3) - 17 freq fisheries (3) - 6 freq fishwives (3) - 2 freq fishies (3) - 4 freq mishtake (3) - 1 freq mistakes (3) - 19 freq shakes (3) - 22 freq fish-scale (4) - 1 freq shades (4) - 24 freq fishie (4) - 2 freq fishwife (4) - 2 freq €˜snakes (4) - 1 freq shanes (4) - 1 freq misgaes (4) - 1 freq fish-wives (4) - 1 freq pishwater (4) - 6 freq shakers (4) - 2 freq scares (4) - 5 freq shaves (4) - 15 freq fashes (4) - 5 freq cakes (4) - 54 freq kishies (4) - 4 freq |
fishcakes (0) - 5 freq fishies (5) - 4 freq shakes (5) - 22 freq fisheries (5) - 6 freq fishwives (5) - 2 freq fishwifes (5) - 2 freq fishes (5) - 17 freq fasces (6) - 1 freq fashes (6) - 5 freq fisher's (6) - 3 freq fishnets (6) - 2 freq fasheries (6) - 1 freq fishers (6) - 13 freq fishin's (6) - 1 freq pushbikes (6) - 1 freq feshes (6) - 1 freq shaks (6) - 25 freq shucks (6) - 2 freq shacks (6) - 1 freq mishtake (6) - 1 freq mistakes (6) - 19 freq aitcakes (6) - 3 freq flicks (7) - 7 freq hicks (7) - 5 freq feshers (7) - 1 freq |
SoundEx code - F222 fishcakes - 5 freq focuses - 2 freq fkjyyzwaos - 1 freq fqusuz - 1 freq fkeecuzflk - 1 freq |
MetaPhone code - FXKKS fishcakes - 5 freq |
FISHCAKES |
| Time to execute Levenshtein function - 0.200975 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.370849 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.027293 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.037555 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.000972 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. |