Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
flechs (0) - 8 freq flech (1) - 8 freq fechs (1) - 1 freq flecks (1) - 4 freq fleechs (1) - 1 freq flech' (1) - 1 freq fklechs (1) - 1 freq flechy (1) - 2 freq flects (1) - 1 freq luchs (2) - 1 freq flicht (2) - 47 freq flelds (2) - 1 freq fleh (2) - 2 freq flacht (2) - 1 freq flegs (2) - 10 freq flocht (2) - 4 freq fleers (2) - 1 freq flocks (2) - 10 freq fechts (2) - 31 freq kechs (2) - 1 freq fleech (2) - 1 freq fiecht (2) - 1 freq flea's (2) - 2 freq pechs (2) - 6 freq flees (2) - 73 freq |
flechs (0) - 8 freq fleechs (1) - 1 freq flects (2) - 1 freq fleeches (2) - 2 freq fklechs (2) - 1 freq flechy (2) - 2 freq fechs (2) - 1 freq flech' (2) - 1 freq flecks (2) - 4 freq flech (2) - 8 freq flechin (3) - 1 freq lochs (3) - 32 freq fleechd (3) - 1 freq fleicht (3) - 1 freq flicks (3) - 7 freq faachs (3) - 1 freq fliche (3) - 1 freq flechan (3) - 1 freq flichts (3) - 6 freq cleuchs (3) - 5 freq flechie (3) - 9 freq lachs (3) - 3 freq fleech (3) - 1 freq flacht (3) - 1 freq flocht (3) - 4 freq |
SoundEx code - F422 flakes - 20 freq flashes - 24 freq flushes - 7 freq flaggies - 3 freq flea-heuchs - 1 freq fleeces - 8 freq flughic - 1 freq flech-champit - 1 freq folkies - 4 freq fleechs - 1 freq flechs - 8 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 - 24 freq flushes - 7 freq fleechs - 1 freq flechs - 8 freq fleshes - 1 freq fowlsheugh's - 1 freq fleeches - 2 freq fleitches - 2 freq flatches - 2 freq |
FLECHS |
Time to execute Levenshtein function - 0.172157 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.322622 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.031127 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.037711 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.000895 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. |