| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| miriam (0) - 2 freq maria (2) - 8 freq marias (2) - 1 freq midian (2) - 1 freq marram (2) - 2 freq birian (2) - 1 freq mirra (2) - 3 freq mirrae (2) - 1 freq mairiac (2) - 1 freq mrim (2) - 1 freq mirras (2) - 2 freq myriad (2) - 11 freq birnam (2) - 1 freq maria' (2) - 2 freq riam (2) - 1 freq oriam (2) - 1 freq wirkan (3) - 12 freq mirlt (3) - 1 freq prism (3) - 2 freq ninian (3) - 5 freq tirlan (3) - 5 freq wirm (3) - 17 freq missan (3) - 6 freq mrsa (3) - 1 freq moray (3) - 80 freq |
miriam (0) - 2 freq mrim (2) - 1 freq mairiac (3) - 1 freq maria' (3) - 2 freq oriam (3) - 1 freq riam (3) - 1 freq mirrae (3) - 1 freq myriad (3) - 11 freq mirra (3) - 3 freq marias (3) - 1 freq maria (3) - 8 freq marram (3) - 2 freq mereat (4) - 1 freq mri (4) - 1 freq miami (4) - 1 freq mairead (4) - 6 freq dram (4) - 115 freq moreas (4) - 1 freq marra (4) - 19 freq pirm (4) - 1 freq akram (4) - 1 freq trim (4) - 16 freq murcia (4) - 1 freq mairi (4) - 5 freq morra (4) - 79 freq |
SoundEx code - M650 morn - 389 freq mair'n - 9 freq murn - 9 freq marion - 42 freq murine - 1 freq moron - 4 freq morn- - 4 freq marine - 15 freq moarn - 18 freq mourn - 14 freq maureen - 41 freq 'maureen - 1 freq maroon - 9 freq mirren - 144 freq mairryin - 12 freq mary-anne - 5 freq morin - 2 freq moorn - 1 freq merrin - 1 freq miriam - 2 freq morna - 12 freq merran - 4 freq marnie - 3 freq marina - 4 freq mourne - 6 freq murrin - 1 freq merryin - 3 freq marram - 2 freq marone - 1 freq €œmirren - 1 freq marianne - 1 freq mairi-ann - 1 freq moran - 8 freq marianna - 1 freq mourinho - 1 freq morn' - 3 freq marryin - 1 freq moarn' - 1 freq mooreme - 1 freq mrim - 1 freq |
MetaPhone code - MRM miriam - 2 freq marram - 2 freq mooreme - 1 freq mrim - 1 freq |
MIRIAM |
| Time to execute Levenshtein function - 0.236481 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.447403 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.030806 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.038841 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.000889 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. |