| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| floor-pot (0) - 1 freq flooer-pot (1) - 3 freq flooerpot (2) - 3 freq flower-pot (2) - 1 freq flood-lit (3) - 1 freq flouer-pat (3) - 1 freq flooerpots (3) - 3 freq look-oot (3) - 5 freq froo-oot (3) - 1 freq floory (4) - 6 freq forpit (4) - 1 freq far-oot (4) - 1 freq floorie (4) - 1 freq floorish (4) - 3 freq lamb-pot (4) - 1 freq blood-shot (4) - 1 freq flat-oot (4) - 1 freq forgot (4) - 157 freq floodit (4) - 2 freq flouer-lit (4) - 1 freq poot-poot (4) - 2 freq floomp (4) - 1 freq floors (4) - 21 freq cloort (4) - 1 freq four-foot (4) - 1 freq |
floor-pot (0) - 1 freq flooer-pot (1) - 3 freq flower-pot (3) - 1 freq flouer-pat (3) - 1 freq flooerpot (3) - 3 freq froo-oot (5) - 1 freq flouer-lit (5) - 1 freq flood-lit (5) - 1 freq flooerpots (5) - 3 freq four-foot (6) - 1 freq faur-oot (6) - 1 freq flat-oot (6) - 1 freq far-oot (6) - 1 freq forpit (6) - 1 freq look-oot (6) - 5 freq clear-cut (7) - 1 freq follae-spot (7) - 1 freq flaret (7) - 2 freq flappit (7) - 11 freq fleapit (7) - 1 freq flairit (7) - 1 freq fower-fit (7) - 1 freq fleerup (7) - 1 freq flourishet (7) - 1 freq fleppit (7) - 1 freq |
SoundEx code - F461 flooer-beds - 4 freq flooer-pot - 3 freq flairboords - 1 freq flouer-beds - 1 freq flouer-pat - 1 freq flairboards - 6 freq fluirboards - 1 freq fleerboord's - 1 freq flower-beds - 2 freq flooerpots - 3 freq flower-pot - 1 freq floorboards - 2 freq florie-phrasin - 1 freq flairboard - 1 freq flooerpot - 3 freq fleerboords - 1 freq floor-pot - 1 freq flair-burd - 1 freq flouer-bed - 1 freq fleerboards - 1 freq fleerboord - 2 freq flouer-bauks - 1 freq floorboard - 1 freq fleerup - 1 freq flyraiph - 2 freq flrobertburns - 1 freq |
MetaPhone code - FLRPT flooer-pot - 3 freq flouer-pat - 1 freq flooerpot - 3 freq floor-pot - 1 freq |
FLOOR-POT |
| Time to execute Levenshtein function - 0.219965 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.380916 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.027851 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.038192 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.000870 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. |