Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
athenry (0) - 2 freq ahenny (2) - 1 freq athene (2) - 1 freq henry (2) - 43 freq theory (2) - 32 freq ather (2) - 3 freq €™henry (2) - 5 freq athenor (2) - 1 freq wathery (2) - 1 freq athena (2) - 26 freq mchenry (2) - 1 freq attery (2) - 1 freq athens (2) - 17 freq 'the'r (3) - 2 freq tenty (3) - 6 freq awery (3) - 1 freq then- (3) - 2 freq gaithery (3) - 8 freq cattery (3) - 8 freq bathers (3) - 2 freq their (3) - 5043 freq aither (3) - 140 freq they (3) - 11266 freq thers (3) - 1 freq attends (3) - 1 freq |
athenry (0) - 2 freq athenor (2) - 1 freq athens (3) - 17 freq athena (3) - 26 freq ather (3) - 3 freq theory (3) - 32 freq henry (3) - 43 freq athene (3) - 1 freq then' (4) - 3 freq theng (4) - 2 freq atheen (4) - 1 freq henery (4) - 1 freq therr (4) - 11 freq then (4) - 4451 freq thetr (4) - 1 freq athein (4) - 1 freq thenk (4) - 23 freq the'r (4) - 275 freq there (4) - 6720 freq ether (4) - 26 freq aether (4) - 1 freq athin (4) - 226 freq athins (4) - 2 freq ither (4) - 3062 freq theyre (4) - 5 freq |
SoundEx code - A356 admirin - 22 freq admiration - 13 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 - A0NR athenor - 1 freq athenry - 2 freq |
ATHENRY |
Time to execute Levenshtein function - 0.445344 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.598527 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.078478 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.042071 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.030085 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. |