| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| flail (0) - 5 freq flair (1) - 398 freq fail (1) - 54 freq frail (1) - 18 freq flait (1) - 1 freq flaisk (2) - 2 freq flakie (2) - 3 freq flip (2) - 9 freq plait (2) - 6 freq gail (2) - 3 freq fufil (2) - 2 freq flamit (2) - 1 freq flaigs (2) - 1 freq flarin (2) - 3 freq pail (2) - 50 freq flyin (2) - 45 freq flie (2) - 9 freq skail (2) - 51 freq flaen (2) - 2 freq snail (2) - 33 freq fluit (2) - 11 freq kail (2) - 42 freq foal (2) - 2 freq quail (2) - 5 freq flaff (2) - 5 freq |
flail (0) - 5 freq fall (2) - 62 freq fll (2) - 1 freq faill (2) - 1 freq fuaill (2) - 1 freq frail (2) - 18 freq flair (2) - 398 freq flait (2) - 1 freq fail (2) - 54 freq fluid (3) - 17 freq fael (3) - 2 freq flaat (3) - 2 freq flaur (3) - 1 freq flax (3) - 3 freq flit (3) - 64 freq fuil (3) - 21 freq flake (3) - 7 freq flayin (3) - 1 freq fil (3) - 2 freq flap (3) - 32 freq feil (3) - 7 freq falla (3) - 1 freq fleit (3) - 2 freq flaaw (3) - 1 freq fluir (3) - 40 freq |
SoundEx code - F440 flail - 5 freq |
MetaPhone code - FLL flail - 5 freq |
FLAIL |
| Time to execute Levenshtein function - 0.391460 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.349069 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.029260 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.040774 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.000953 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. |