| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| flooerdirect (0) - 1 freq flooeries (4) - 1 freq flooerie (4) - 3 freq hoosedirect (4) - 1 freq flooerpot (5) - 3 freq flooer-beds (5) - 4 freq flouer-deckt (5) - 1 freq redirect (5) - 1 freq flooers'r (5) - 1 freq floorie (5) - 1 freq floodit (5) - 2 freq flooerin (5) - 4 freq flooer-pot (5) - 3 freq flouerie (5) - 2 freq floories (5) - 8 freq flooered (5) - 1 freq flower-beds (6) - 2 freq flookie (6) - 1 freq florescent (6) - 1 freq ferrest (6) - 1 freq fowerties (6) - 1 freq floret (6) - 1 freq owerairch (6) - 1 freq flouer-pat (6) - 1 freq bloodit (6) - 1 freq |
flooerdirect (0) - 1 freq redirect (7) - 1 freq hoosedirect (7) - 1 freq flouer-deckt (8) - 1 freq flooered (8) - 1 freq floodit (8) - 2 freq fordert (8) - 4 freq flooeries (8) - 1 freq flooer-pot (8) - 3 freq flooerie (8) - 3 freq flooerpot (8) - 3 freq fordest (9) - 2 freq floor-pot (9) - 1 freq forrest (9) - 5 freq 'correct (9) - 1 freq correct (9) - 40 freq direct (9) - 55 freq overdraft (9) - 1 freq fleudit (9) - 2 freq fordelt (9) - 2 freq ferriet (9) - 1 freq frederick (9) - 4 freq flourishet (9) - 1 freq maryindirect (9) - 2 freq verdict (9) - 30 freq |
SoundEx code - F463 floor-to-ceiling - 1 freq flirtin - 5 freq flirty - 2 freq flairit - 1 freq flared - 4 freq florida - 5 freq floret - 1 freq flirtin' - 1 freq flured - 1 freq flaired - 2 freq florid - 1 freq flirtit - 1 freq flirt - 6 freq flaherty - 1 freq flooered - 1 freq flirtatious - 1 freq flirded - 1 freq flouered - 1 freq flurried - 1 freq flooerdirect - 1 freq flouer-deckt - 1 freq filler-outer - 1 freq floried - 1 freq flirtation - 1 freq flrth - 1 freq €œfloor-deh-lee - 1 freq flaret - 2 freq flair-tae-ceilin - 1 freq |
MetaPhone code - FLRTRKT flooerdirect - 1 freq |
FLOOERDIRECT |
| Time to execute Levenshtein function - 0.317894 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.525751 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.031836 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.043334 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. |