Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
flooered (0) - 1 freq flouered (1) - 1 freq shooered (2) - 3 freq glowered (2) - 98 freq cloored (2) - 3 freq foonered (2) - 1 freq pooered (2) - 3 freq floo'ed (2) - 2 freq flottered (2) - 1 freq tooered (2) - 1 freq flooerin (2) - 4 freq flooeries (2) - 1 freq flooded (2) - 8 freq flooery (2) - 13 freq flooers (2) - 195 freq plootered (2) - 2 freq footered (2) - 5 freq blootered (2) - 25 freq flooerie (2) - 3 freq flooer (2) - 150 freq lowered (2) - 25 freq glower'd (3) - 1 freq fleed (3) - 13 freq flopped (3) - 3 freq leered (3) - 1 freq |
flooered (0) - 1 freq flouered (1) - 1 freq flooerie (3) - 3 freq flaired (3) - 2 freq flooer (3) - 150 freq flooery (3) - 13 freq flooers (3) - 195 freq flared (3) - 4 freq florid (3) - 1 freq floried (3) - 1 freq flooded (3) - 8 freq flured (3) - 1 freq footered (3) - 5 freq floo'ed (3) - 2 freq foonered (3) - 1 freq flooeries (3) - 1 freq flooerin (3) - 4 freq cloored (3) - 3 freq favoured (4) - 12 freq fleetered (4) - 1 freq faidered (4) - 1 freq fleres (4) - 1 freq faltered (4) - 3 freq floory (4) - 6 freq filtered (4) - 6 freq |
SoundEx code - F463 floor-to-ceiling - 1 freq flirtin - 6 freq flirty - 2 freq flairit - 1 freq flared - 4 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 florida - 4 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 flured - 1 freq flaired - 2 freq florid - 1 freq flirt - 6 freq flooered - 1 freq flouered - 1 freq flurried - 1 freq florida - 4 freq floried - 1 freq flaret - 2 freq |
FLOOERED |
Time to execute Levenshtein function - 0.216187 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.408438 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.027264 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.036736 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.000806 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. |