Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
fleeces (0) - 8 freq fleece (1) - 11 freq fleeced (1) - 3 freq fleeches (1) - 2 freq tleeces (1) - 1 freq fleeched (2) - 1 freq flees (2) - 70 freq freezes (2) - 2 freq fleeds (2) - 1 freq fleechd (2) - 1 freq flects (2) - 1 freq fleshes (2) - 1 freq fleeter (2) - 1 freq flechs (2) - 8 freq fleechem (2) - 2 freq fleecht (2) - 3 freq flee-ee (2) - 2 freq fleeted (2) - 3 freq flenches (2) - 2 freq leeches (2) - 4 freq plaeces (2) - 3 freq flee'ers (2) - 1 freq flecks (2) - 3 freq leeves (2) - 19 freq fleers (2) - 1 freq |
fleeces (0) - 8 freq tleeces (2) - 1 freq fleeches (2) - 2 freq fleece (2) - 11 freq fleeced (2) - 3 freq fleres (3) - 1 freq flechs (3) - 8 freq plaeces (3) - 3 freq flecks (3) - 3 freq fleecin (3) - 2 freq fences (3) - 22 freq pleces (3) - 1 freq fleers (3) - 1 freq fleeds (3) - 1 freq fleets (3) - 3 freq flees (3) - 70 freq flects (3) - 1 freq fleech (3) - 1 freq flech (4) - 8 freq flocers (4) - 1 freq floes (4) - 1 freq flocks (4) - 10 freq fasces (4) - 1 freq fleas (4) - 13 freq fleys (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 - FLSS fleeces - 8 freq floss's - 1 freq failzies - 1 freq fallicies - 1 freq vlisses - 2 freq vlzs - 1 freq flzeys - 1 freq |
FLEECES |
Time to execute Levenshtein function - 0.396294 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.446880 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.027889 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.038341 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.000853 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. |