Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
admiralty (0) - 4 freq admiral (2) - 3 freq admirals (2) - 2 freq ammirall (3) - 1 freq admiran (3) - 2 freq awmichty (4) - 2 freq admire (4) - 32 freq airty (4) - 1 freq admirer (4) - 4 freq airly (4) - 20 freq smirlt (4) - 1 freq admired (4) - 15 freq admirin (4) - 22 freq admit (4) - 100 freq dirty (4) - 107 freq dairkly (4) - 1 freq admits (4) - 2 freq admittit (4) - 10 freq admirers (4) - 4 freq almerals (4) - 1 freq a'michty (4) - 1 freq almighty (4) - 9 freq amity (4) - 2 freq amichty (4) - 1 freq adversity (4) - 7 freq |
admiralty (0) - 4 freq admirals (3) - 2 freq admiral (3) - 3 freq smirlt (5) - 1 freq morality (5) - 8 freq dirlt (5) - 4 freq admiran (5) - 2 freq ammirall (5) - 1 freq mirlt (5) - 1 freq adversity (6) - 7 freq admiration (6) - 14 freq malty (6) - 6 freq liminality (6) - 1 freq dirlit (6) - 1 freq marlt (6) - 2 freq admir (6) - 1 freq admiring (6) - 2 freq mirly (6) - 1 freq amoral (6) - 1 freq morally (6) - 3 freq admit (6) - 100 freq admire (6) - 32 freq admirin (6) - 22 freq admired (6) - 15 freq admirer (6) - 4 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 - ATMRLT admiralty - 4 freq |
ADMIRALTY |
Time to execute Levenshtein function - 0.289464 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.409356 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.027703 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.037166 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.000874 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. |