Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
flallin (0) - 1 freq fallin (1) - 48 freq flailin (1) - 9 freq flashin (2) - 28 freq swallin (2) - 11 freq brallin (2) - 1 freq flatlins (2) - 2 freq diallin (2) - 4 freq fallen (2) - 29 freq ballin (2) - 3 freq flankin (2) - 1 freq dwallin (2) - 15 freq lallan (2) - 6 freq flampin (2) - 1 freq flaggin (2) - 4 freq flairin (2) - 2 freq flappin (2) - 26 freq caallin (2) - 1 freq flayin (2) - 1 freq fillin (2) - 63 freq flakin (2) - 1 freq flawin (2) - 1 freq foalin (2) - 1 freq pallin (2) - 2 freq flannin (2) - 1 freq |
flallin (0) - 1 freq flailin (2) - 9 freq fallin (2) - 48 freq fallan (3) - 4 freq lallan (3) - 6 freq fllin (3) - 1 freq fillin (3) - 63 freq foallien (3) - 1 freq fellin (3) - 3 freq fallen (3) - 29 freq fallyin (3) - 1 freq fullin (3) - 29 freq lollin (3) - 2 freq flailin' (4) - 1 freq faalin (4) - 12 freq fal'in (4) - 1 freq callin (4) - 30 freq flaitin (4) - 4 freq foallie (4) - 5 freq fullen (4) - 1 freq follain (4) - 3 freq fulfillin (4) - 4 freq telllin (4) - 1 freq fillan (4) - 8 freq follien (4) - 1 freq |
SoundEx code - F445 flallin - 1 freq flailin - 9 freq flailin' - 1 freq fellah-weel-met - 1 freq |
MetaPhone code - FLLN flallin - 1 freq flailin - 9 freq flailin' - 1 freq |
FLALLIN |
Time to execute Levenshtein function - 0.212010 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.374222 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.027995 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.037775 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.000918 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. |