| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| adamrutherford (0) - 1 freq alanrutherford (2) - 14 freq rutherford (4) - 4 freq waterford (6) - 1 freq charterfor (6) - 1 freq heatheryfold (7) - 1 freq carruthers' (7) - 1 freq brotherhood (7) - 1 freq aither-or (7) - 1 freq hungerford (7) - 1 freq anstruther (7) - 2 freq akawakeford (7) - 3 freq furthermore (7) - 1 freq britherhood (7) - 4 freq faitherhood (7) - 1 freq dartboord (7) - 1 freq carruthers (7) - 1 freq drakeford (7) - 1 freq thetford (7) - 1 freq apartheid (7) - 7 freq farthermost (7) - 1 freq tharefore (8) - 2 freq chartered (8) - 1 freq miuther (8) - 1 freq mouthed (8) - 1 freq |
adamrutherford (0) - 1 freq alanrutherford (4) - 14 freq rutherford (6) - 4 freq charterfor (10) - 1 freq waterford (10) - 1 freq furthermore (11) - 1 freq britherhood (11) - 4 freq murtherers (11) - 2 freq murthered (11) - 3 freq dartboord (11) - 1 freq brotherhood (11) - 1 freq heatheryfold (11) - 1 freq murtherd (11) - 1 freq thetford (11) - 1 freq drakeford (11) - 1 freq murtherer (11) - 3 freq therefore (12) - 31 freq someitherbody (12) - 1 freq smithyfor (12) - 1 freq therefor (12) - 1 freq smothered (12) - 6 freq motherboards (12) - 1 freq stratford (12) - 1 freq mitherheid (12) - 1 freq britherhuid (12) - 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 - ATMR0RFR |
ADAMRUTHERFORD |
| Time to execute Levenshtein function - 0.222431 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.404233 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.028013 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.039925 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.000919 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. |