| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| drjoshuawolrich (0) - 1 freq derhawlish (8) - 1 freq dashodoric (8) - 2 freq resource-rich (8) - 1 freq josherick (8) - 3 freq dishworth (8) - 1 freq rhuaridh (8) - 1 freq droolin' (9) - 1 freq smourich (9) - 1 freq ardscatholic (9) - 14 freq johnwick (9) - 1 freq rosario (9) - 1 freq resoorce-rich (9) - 1 freq drawbrig (9) - 1 freq resaerch (9) - 1 freq grieshoch (9) - 1 freq squaich (9) - 1 freq drooling (9) - 2 freq ulrich (9) - 1 freq frostlicht (9) - 1 freq greeshoch (9) - 3 freq squalloch (9) - 2 freq broth-logic (9) - 1 freq shoepolish (9) - 2 freq squarish (9) - 1 freq |
drjoshuawolrich (0) - 1 freq dishworth (12) - 1 freq derhawlish (12) - 1 freq dashodoric (13) - 2 freq josherick (13) - 3 freq resource-rich (13) - 1 freq dishealth (14) - 1 freq research (14) - 166 freq 'research (14) - 2 freq todshawhauch (14) - 3 freq greeshach (14) - 2 freq crianlarich (14) - 1 freq prestwich (14) - 1 freq resairch (14) - 12 freq denishakilloh (14) - 3 freq greeshoch (14) - 3 freq dogsflourish (14) - 1 freq asjoshtaylor (14) - 4 freq rersearch (14) - 1 freq drumtulloch (14) - 7 freq drumshorlit (14) - 1 freq resaerch (14) - 1 freq resoorce-rich (14) - 1 freq grieshoch (14) - 1 freq rosehauch (14) - 1 freq |
SoundEx code - D622 dresses - 18 freq door-cheek - 3 freq darkest - 16 freq dairkest - 3 freq derkest - 2 freq darkish - 1 freq daurkest - 5 freq druggies - 1 freq drakes - 2 freq door-cheek's - 1 freq driechest - 2 freq door-chik - 1 freq darkies - 2 freq dreichest - 2 freq derkies - 1 freq dirges - 1 freq dregies - 1 freq dreich-as-cauld-parritch - 1 freq durexuk - 1 freq drkkhgagrj - 1 freq doricocd - 1 freq derekweston - 5 freq drxuaywz - 1 freq darcyoake - 2 freq drjoshuawolrich - 1 freq |
MetaPhone code - TRJXWLRX drjoshuawolrich - 1 freq |
DRJOSHUAWOLRICH |
| Time to execute Levenshtein function - 0.231775 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.424191 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.027290 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.037233 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.000911 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. |