| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| flooerin (0) - 4 freq flouerin (1) - 2 freq flooerie (1) - 3 freq flooeries (2) - 1 freq flooer (2) - 151 freq shooerin (2) - 2 freq foonerin (2) - 1 freq lowerin (2) - 12 freq footerin (2) - 8 freq pooerin (2) - 1 freq kloorin (2) - 1 freq plooterin (2) - 7 freq fleerin (2) - 4 freq flooers (2) - 197 freq flowetin (2) - 1 freq flooered (2) - 1 freq floodin (2) - 9 freq flooery (2) - 13 freq florin (2) - 4 freq hooerin (2) - 1 freq blooterin (2) - 3 freq tooerin (2) - 1 freq cloorin (2) - 1 freq flowein (2) - 1 freq flouerie (2) - 2 freq |
flooerin (0) - 4 freq flouerin (1) - 2 freq florin (2) - 4 freq fleerin (2) - 4 freq flooerie (2) - 3 freq flooery (3) - 13 freq floodin (3) - 9 freq flowein (3) - 1 freq flarin (3) - 3 freq floorie (3) - 1 freq flouerie (3) - 2 freq flooered (3) - 1 freq cloorin (3) - 1 freq flairin (3) - 2 freq flooer (3) - 151 freq flooeries (3) - 1 freq footerin (3) - 8 freq kloorin (3) - 1 freq foonerin (3) - 1 freq flooers (3) - 197 freq gleerin (4) - 1 freq clourin (4) - 1 freq floor (4) - 87 freq flexin (4) - 4 freq leerin (4) - 5 freq |
SoundEx code - F465 florence - 29 freq flairin - 2 freq florin - 4 freq flouerin - 2 freq florence's - 2 freq flooerin - 4 freq flaran - 1 freq floareen - 1 freq fleerin - 4 freq flarin - 3 freq fleerymaneerie - 1 freq florewnce - 1 freq florentines - 1 freq florencerounda - 1 freq flyering - 1 freq |
MetaPhone code - FLRN flairin - 2 freq florin - 4 freq flouerin - 2 freq flooerin - 4 freq flaran - 1 freq floareen - 1 freq fleerin - 4 freq flarin - 3 freq valerian - 1 freq |
FLOOERIN |
| Time to execute Levenshtein function - 0.270043 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.511249 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.036146 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.047699 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.001156 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. |