| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| admire (0) - 32 freq admirer (1) - 4 freq admired (1) - 15 freq admir (1) - 1 freq admit (2) - 100 freq aire (2) - 61 freq doire (2) - 1 freq admin (2) - 5 freq attire (2) - 12 freq admirin (2) - 22 freq advice (2) - 137 freq dire (2) - 9 freq admirers (2) - 4 freq adie (2) - 16 freq admeir (2) - 2 freq mire (2) - 14 freq addie (2) - 6 freq amyire (2) - 1 freq adore (2) - 12 freq admins (2) - 1 freq adwise (2) - 1 freq aspire (2) - 4 freq adhere (2) - 7 freq a'mie (2) - 1 freq apsire (2) - 1 freq |
admire (0) - 32 freq admir (1) - 1 freq admired (2) - 15 freq admirer (2) - 4 freq admeir (2) - 2 freq adhere (3) - 7 freq mire (3) - 14 freq amyire (3) - 1 freq adore (3) - 12 freq dire (3) - 9 freq admiran (3) - 2 freq admirin (3) - 22 freq adair (3) - 1 freq admit (3) - 100 freq doire (3) - 1 freq admin (3) - 5 freq amore (3) - 1 freq admiral (3) - 3 freq amor (4) - 1 freq smore (4) - 7 freq dair (4) - 11 freq mir (4) - 5 freq dmin (4) - 1 freq aumrie (4) - 3 freq more (4) - 465 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 - ATMR admire - 32 freq 'admire' - 1 freq admeir - 2 freq admir - 1 freq awtmry - 1 freq |
ADMIRE |
| Time to execute Levenshtein function - 0.189248 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.335952 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.027417 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.037593 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.000863 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. |