Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
flocers (0) - 1 freq flooers (1) - 197 freq flowers (1) - 15 freq floeers (1) - 3 freq flouers (1) - 67 freq flower (2) - 16 freq lacers (2) - 1 freq lowers (2) - 7 freq fiooers (2) - 2 freq loners (2) - 1 freq floors (2) - 22 freq flouer (2) - 26 freq fleers (2) - 1 freq floo'ers (2) - 2 freq floes (2) - 1 freq flickers (2) - 4 freq glouers (2) - 1 freq floaters (2) - 1 freq floours (2) - 1 freq flouer' (2) - 1 freq fowers (2) - 7 freq blowers (2) - 1 freq clooers (2) - 1 freq 'flouers (2) - 1 freq flouery (2) - 1 freq |
flocers (0) - 1 freq flouers (2) - 67 freq floeers (2) - 3 freq flowers (2) - 15 freq flooers (2) - 197 freq flyters (3) - 1 freq floours (3) - 1 freq flores (3) - 1 freq floowers (3) - 1 freq floo'rs (3) - 1 freq floaters (3) - 1 freq flocks (3) - 10 freq ulcers (3) - 1 freq flickers (3) - 4 freq floors (3) - 22 freq floo'ers (3) - 2 freq fleers (3) - 1 freq lacers (3) - 1 freq flow'rs (4) - 3 freq fleeces (4) - 8 freq grocers (4) - 3 freq flects (4) - 1 freq flyerers (4) - 1 freq flecks (4) - 4 freq flaccus (4) - 1 freq |
SoundEx code - F426 flickered - 6 freq flexure - 1 freq flicker - 13 freq flickerin - 18 freq falkirk - 19 freq fluckert - 1 freq falsers - 18 freq flickert - 2 freq flickerit - 1 freq flickering - 5 freq flickers - 4 freq fleggar - 1 freq full-grown - 1 freq flagrant - 1 freq flocers - 1 freq falkirk's - 1 freq flick'ran - 1 freq falserfree - 1 freq folk'r - 3 freq flickeran - 2 freq flickerkan - 1 freq fleegaries - 1 freq filigree - 2 freq folkore - 1 freq flecker's - 1 freq flicherin - 1 freq flecker - 1 freq flagerie - 1 freq fleshery - 1 freq fleshers - 3 freq flesher - 5 freq flyscreen - 1 freq falkirkbairns - 1 freq falkirktv - 1 freq falkirkfc - 1 freq falkirkshire - 1 freq flcro - 1 freq falkirk-based - 1 freq falkirkhigh - 1 freq falkirk' - 1 freq |
MetaPhone code - FLSRS falsers - 18 freq flocers - 1 freq |
FLOCERS |
Time to execute Levenshtein function - 0.588649 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.808602 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.039983 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.070511 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.000903 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. |