Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
aidanreilly (0) - 16 freq asiareilly (3) - 5 freq neilly (5) - 12 freq adverbially (5) - 1 freq cantilly (5) - 1 freq fianally (5) - 1 freq reilly (5) - 3 freq mireille (5) - 4 freq danbell (5) - 2 freq donnelly (5) - 1 freq dasheill (5) - 1 freq allanerly (5) - 1 freq aippairently (5) - 1 freq aareidy (5) - 7 freq aidansi (5) - 2 freq financially (5) - 7 freq bizarrely (5) - 1 freq airtill (5) - 1 freq apparently (5) - 85 freq lindaarella (5) - 3 freq oreilly (5) - 1 freq daniella (5) - 1 freq ideally (5) - 2 freq appairently (5) - 18 freq ainerly (5) - 2 freq |
aidanreilly (0) - 16 freq asiareilly (5) - 5 freq donnelly (6) - 1 freq danbell (6) - 2 freq daniella (6) - 1 freq danielle (6) - 1 freq lindaarella (7) - 3 freq donella (7) - 5 freq ainerly (7) - 2 freq donnell (7) - 1 freq drill (7) - 53 freq oreilly (7) - 1 freq ideally (7) - 2 freq jonrell (7) - 1 freq fianally (7) - 1 freq cantilly (7) - 1 freq adverbially (7) - 1 freq neilly (7) - 12 freq reilly (7) - 3 freq mireille (7) - 4 freq dasheill (7) - 1 freq danielbye (8) - 1 freq raelly (8) - 67 freq manfully (8) - 1 freq liberally (8) - 1 freq |
SoundEx code - A356 admirin - 22 freq admiration - 14 freq admirer - 4 freq admire - 32 freq 'admire' - 1 freq admirers - 4 freq admiralty - 4 freq admired - 15 freq admiral - 3 freq admirals - 2 freq athenor - 1 freq admeir - 2 freq admieraetion - 1 freq admiran - 2 freq athenry - 2 freq admir - 1 freq admeirin - 1 freq admiring - 2 freq adamrooney - 1 freq aidanreilly - 16 freq adamrutherford - 1 freq adamramsay - 2 freq adamrmcvey - 1 freq awtmry - 1 freq atomheart - 1 freq |
MetaPhone code - ATNRL aidanreilly - 16 freq |
AIDANREILLY |
Time to execute Levenshtein function - 0.333710 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.707958 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.083308 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.091083 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.000872 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. |