| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| flashes (0) - 23 freq clashes (1) - 2 freq lashes (1) - 7 freq fleshes (1) - 1 freq flashed (1) - 17 freq flushes (1) - 7 freq fashes (1) - 5 freq flashen (1) - 2 freq plashes (1) - 1 freq stashes (2) - 1 freq flashy (2) - 4 freq snashes (2) - 2 freq feshes (2) - 1 freq clashed (2) - 4 freq ashes (2) - 18 freq sashes (2) - 3 freq plashed (2) - 1 freq flakes (2) - 20 freq flares (2) - 10 freq fleshers (2) - 3 freq flatches (2) - 2 freq classes (2) - 46 freq knashes (2) - 1 freq flashin (2) - 27 freq dashes (2) - 1 freq |
flashes (0) - 23 freq fleshes (1) - 1 freq flushes (1) - 7 freq fashes (2) - 5 freq flashen (2) - 2 freq plashes (2) - 1 freq flashed (2) - 17 freq lashes (2) - 7 freq clashes (2) - 2 freq fleshers (3) - 3 freq flashin (3) - 27 freq flasks (3) - 9 freq flesher (3) - 5 freq flash (3) - 76 freq sleshes (3) - 1 freq blushes (3) - 3 freq flashan (3) - 2 freq flushed (3) - 14 freq fishes (3) - 17 freq flashy (3) - 4 freq eelashes (3) - 4 freq feshes (3) - 1 freq crashes (4) - 7 freq finishes (4) - 7 freq offishes (4) - 1 freq |
SoundEx code - F422 flakes - 20 freq flashes - 23 freq flushes - 7 freq flaggies - 3 freq flea-heuchs - 1 freq fleeces - 8 freq flughic - 1 freq flech-champit - 1 freq flechs - 8 freq folkies - 2 freq fleshes - 1 freq flaccus - 1 freq fowlsheugh's - 1 freq fleeches - 2 freq flaesocks - 1 freq flaesoks - 1 freq failzies - 1 freq flezicks - 1 freq fallicies - 1 freq foulkes - 4 freq flzeys - 1 freq folkestone - 1 freq fliskies - 1 freq |
MetaPhone code - FLXS flashes - 23 freq flushes - 7 freq flechs - 8 freq fleshes - 1 freq fowlsheugh's - 1 freq fleeches - 2 freq fleitches - 2 freq flatches - 2 freq |
FLASHES |
| Time to execute Levenshtein function - 0.250039 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.548308 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.027141 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.037032 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.000785 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. |