Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
fabiani (0) - 5 freq taviani (2) - 2 freq abiine (3) - 3 freq faain (3) - 60 freq fabius (3) - 2 freq saiand (3) - 1 freq abane (3) - 28 freq fatman (3) - 1 freq gabbana (3) - 1 freq italiani (3) - 1 freq faking (3) - 1 freq kanani (3) - 1 freq fading (3) - 7 freq abiah (3) - 1 freq faint (3) - 35 freq abins (3) - 1 freq farins (3) - 1 freq radiant (3) - 5 freq cabins (3) - 2 freq caani (3) - 1 freq fabils (3) - 2 freq dabhand (3) - 1 freq fiann (3) - 1 freq asian (3) - 13 freq abean (3) - 1 freq |
fabiani (0) - 5 freq farin (4) - 10 freq fabio (4) - 1 freq faan (4) - 70 freq faelan (4) - 1 freq fain (4) - 44 freq fairnie (4) - 30 freq fadin (4) - 20 freq sabine (4) - 3 freq abin (4) - 43 freq fenian (4) - 3 freq cabin (4) - 20 freq arabian (4) - 1 freq fawin (4) - 88 freq fakin (4) - 3 freq facin (4) - 33 freq feibn (4) - 1 freq faeman (4) - 1 freq fadan (4) - 1 freq famine (4) - 15 freq fa-in (4) - 1 freq faalan (4) - 4 freq abean (4) - 1 freq fa'in (4) - 20 freq faain (4) - 60 freq |
SoundEx code - F150 fuffin - 2 freq fobbin - 3 freq faffin - 1 freq foofin - 1 freq fifin' - 1 freq fabiani - 5 freq fee-pyin - 1 freq fee-peyin - 1 freq feibn - 1 freq |
MetaPhone code - FBN fobbin - 3 freq fabiani - 5 freq feibn - 1 freq |
FABIANI |
Time to execute Levenshtein function - 0.224606 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.454591 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.030561 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.038233 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.001041 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. |