| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| admiration (0) - 13 freq aduration (2) - 1 freq aspiration (2) - 4 freq adoration (2) - 6 freq admieraetion (2) - 1 freq limitation (3) - 1 freq lamination (3) - 1 freq aberration (3) - 2 freq admirin (3) - 22 freq immigration (3) - 6 freq duration (3) - 5 freq imitation (3) - 4 freq adaptation (3) - 4 freq admittin (3) - 6 freq edication (3) - 3 freq alteration (3) - 1 freq abomination (3) - 5 freq domination (3) - 1 freq radiation (3) - 3 freq nomination (3) - 1 freq addition (3) - 17 freq admiran (3) - 2 freq abjuration (3) - 1 freq affirmation (3) - 1 freq animation (3) - 6 freq |
admiration (0) - 13 freq admieraetion (2) - 1 freq aduration (3) - 1 freq adoration (3) - 6 freq admittin (4) - 6 freq admonition (4) - 3 freq dmartin (4) - 4 freq admiran (4) - 2 freq domination (4) - 1 freq duration (4) - 5 freq aspiration (4) - 4 freq admirin (4) - 22 freq damnation (5) - 3 freq abjuration (5) - 1 freq decoration (5) - 4 freq animation (5) - 6 freq eddication (5) - 51 freq addiction (5) - 9 freq dominatin (5) - 6 freq migration (5) - 10 freq admeirin (5) - 1 freq admission (5) - 4 freq imitation (5) - 4 freq adaptation (5) - 4 freq edication (5) - 3 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 - ATMRXN admiration - 13 freq admieraetion - 1 freq |
ADMIRATION |
| Time to execute Levenshtein function - 0.179482 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.339204 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.027330 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.036663 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.000796 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. |