| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| currieboram (0) - 1 freq furlierorams (4) - 1 freq furlieorams (4) - 2 freq currie-coo (5) - 1 freq carrier (5) - 15 freq territoral (5) - 1 freq curried (5) - 2 freq reheboam (5) - 2 freq cerebrum (5) - 1 freq cerrier (5) - 1 freq currie (5) - 1 freq carriers (5) - 2 freq currie's (5) - 2 freq wurriet'at (5) - 1 freq eirieorum (5) - 1 freq curriculum (5) - 65 freq curries (5) - 7 freq cerebral (5) - 1 freq furrier (5) - 1 freq curriest (5) - 1 freq corridor (5) - 56 freq corridors (5) - 22 freq curriestarfc (5) - 1 freq eirieorams (5) - 1 freq curators (6) - 1 freq |
currieboram (0) - 1 freq cerebrum (6) - 1 freq cerrier (7) - 1 freq cerebral (7) - 1 freq corridors (7) - 22 freq carrier (7) - 15 freq curriculum (7) - 65 freq corridor (7) - 56 freq carriers (7) - 2 freq furrier (8) - 1 freq cairrier (8) - 13 freq crerar (8) - 1 freq cairriers (8) - 1 freq verborum (8) - 1 freq cairngorm (8) - 6 freq carradore (8) - 1 freq curriest (8) - 1 freq curried (8) - 2 freq reheboam (8) - 2 freq curries (8) - 7 freq furlieorams (8) - 2 freq territoral (8) - 1 freq currie-coo (8) - 1 freq currie (8) - 1 freq eirieorum (8) - 1 freq |
SoundEx code - C616 carefree - 6 freq carbrini - 1 freq cerebrum - 1 freq carberry - 2 freq caur-parks - 1 freq cerberus - 15 freq car-pairk - 3 freq corporate - 26 freq corporation - 5 freq corporations - 4 freq care-free - 1 freq crawford - 5 freq cerebral - 1 freq crapper - 1 freq cropper - 3 freq carpairk - 1 freq corporal - 22 freq cerbuird - 1 freq crafurds - 1 freq crawfurd - 1 freq creepers - 1 freq crawford's - 2 freq cerberus's - 1 freq chair-frame - 1 freq carpark - 5 freq currieboram - 1 freq carver - 14 freq corporately - 1 freq crobertsonuk - 15 freq corfuarts - 1 freq crawfor - 1 freq crowberries - 1 freq |
MetaPhone code - KRBRM currieboram - 1 freq |
CURRIEBORAM |
| Time to execute Levenshtein function - 0.219361 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.373445 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.027920 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.038139 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.000920 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. |