Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
floried (0) - 1 freq gloried (1) - 1 freq florid (1) - 1 freq flowed (2) - 9 freq flogged (2) - 4 freq flarie (2) - 3 freq glories (2) - 9 freq cooried (2) - 63 freq ferried (2) - 2 freq flocked (2) - 1 freq floret (2) - 1 freq flied (2) - 1 freq forked (2) - 3 freq formed (2) - 47 freq glorie (2) - 32 freq forred (2) - 1 freq florish (2) - 1 freq floorie (2) - 1 freq claried (2) - 1 freq flurried (2) - 1 freq floated (2) - 15 freq fried (2) - 33 freq flooded (2) - 9 freq forgied (2) - 2 freq forged (2) - 3 freq |
floried (0) - 1 freq florid (1) - 1 freq flared (2) - 4 freq florida (2) - 5 freq flured (2) - 1 freq gloried (2) - 1 freq floories (3) - 8 freq flirded (3) - 1 freq flarie (3) - 3 freq florrie (3) - 1 freq flooded (3) - 9 freq floo'ed (3) - 2 freq fried (3) - 33 freq flores (3) - 1 freq flouered (3) - 1 freq flooered (3) - 1 freq flaired (3) - 2 freq flowed (3) - 9 freq floued (3) - 1 freq floated (3) - 15 freq florin (3) - 4 freq forred (3) - 1 freq flied (3) - 1 freq flurried (3) - 1 freq ferried (3) - 2 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 - FLRT flirty - 2 freq flairit - 1 freq flared - 4 freq florida - 5 freq floret - 1 freq flured - 1 freq flaired - 2 freq florid - 1 freq flirt - 6 freq flooered - 1 freq flouered - 1 freq flurried - 1 freq floried - 1 freq flaret - 2 freq |
FLORIED |
Time to execute Levenshtein function - 0.277533 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.607685 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.039849 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.079189 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.001142 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. |