Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
flailin (0) - 8 freq flaitin (1) - 4 freq failin (1) - 26 freq flairin (1) - 2 freq flailin' (1) - 1 freq blaikin (2) - 1 freq fallin (2) - 48 freq flailed (2) - 2 freq trailin (2) - 27 freq flakin (2) - 1 freq nailin (2) - 1 freq claimin (2) - 14 freq slaikin (2) - 2 freq flawin (2) - 1 freq foalin (2) - 1 freq flaffin (2) - 6 freq wailin (2) - 11 freq filin (2) - 3 freq pailin (2) - 8 freq tailin (2) - 1 freq skailin (2) - 39 freq flappin (2) - 25 freq flankin (2) - 1 freq flaapin (2) - 2 freq flashin (2) - 27 freq |
flailin (0) - 8 freq fallin (2) - 48 freq flailin' (2) - 1 freq fllin (2) - 1 freq flaitin (2) - 4 freq failin (2) - 26 freq flairin (2) - 2 freq fallen (3) - 29 freq fleitin (3) - 1 freq foallien (3) - 1 freq fillin (3) - 59 freq flarin (3) - 3 freq flamin (3) - 20 freq flail (3) - 5 freq fellin (3) - 3 freq faalin (3) - 12 freq fluidin (3) - 1 freq fliein (3) - 4 freq flaapin (3) - 2 freq flitin (3) - 1 freq fullin (3) - 29 freq flayin (3) - 1 freq flawin (3) - 1 freq fallyin (3) - 1 freq foalin (3) - 1 freq |
SoundEx code - F445 flailin - 8 freq flailin' - 1 freq fellah-weel-met - 1 freq |
MetaPhone code - FLLN flailin - 8 freq flailin' - 1 freq |
FLAILIN |
Time to execute Levenshtein function - 0.215742 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.343122 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.027434 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.037531 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.000866 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. |