| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| marrying (0) - 1 freq marryin (1) - 1 freq carrying (1) - 2 freq carryin (2) - 16 freq mairryin (2) - 12 freq cairrying (2) - 3 freq marching (2) - 6 freq kerrying (2) - 2 freq partying (2) - 1 freq varying (2) - 7 freq hurrying (2) - 1 freq warring (2) - 1 freq marking (2) - 5 freq worrying (2) - 7 freq merryin (2) - 3 freq warrin (3) - 1 freq markin (3) - 17 freq carting (3) - 1 freq murrin (3) - 1 freq warning (3) - 11 freq baying (3) - 1 freq martins (3) - 2 freq carryon (3) - 1 freq mirrlin (3) - 1 freq martyne (3) - 1 freq |
marrying (0) - 1 freq carrying (2) - 2 freq marryin (2) - 1 freq hurrying (3) - 1 freq warring (3) - 1 freq merryin (3) - 3 freq worrying (3) - 7 freq marking (3) - 5 freq kerrying (3) - 2 freq mairryin (3) - 12 freq cairrying (3) - 3 freq mirrang (3) - 1 freq marroond (4) - 1 freq herring (4) - 3 freq mourning (4) - 2 freq merrin (4) - 1 freq arreinge (4) - 1 freq maturing (4) - 1 freq birring (4) - 1 freq morning (4) - 239 freq murrin (4) - 1 freq varying (4) - 7 freq arrynge (4) - 1 freq partying (4) - 1 freq marching (4) - 6 freq |
SoundEx code - M652 morn's - 49 freq marenich - 1 freq maureen's - 3 freq murns - 1 freq marincr's - 1 freq mooren's - 1 freq merrynes - 2 freq maroongeous - 1 freq morn-cam-never - 1 freq mornice - 2 freq marymass - 1 freq mournes - 2 freq mearns - 6 freq meringue - 3 freq merran's - 1 freq moarn's - 1 freq mirrang - 1 freq mirren's - 1 freq morns - 7 freq mirrens - 1 freq maroons - 1 freq marnock - 2 freq marion's - 1 freq maroonajambo - 1 freq mrmacrobot - 2 freq moorings - 1 freq mrmjcox - 1 freq mrmcenaney - 4 freq mrnickharvey - 8 freq meringue' - 1 freq marinescotland - 1 freq marrying - 1 freq |
MetaPhone code - MRYNK marrying - 1 freq |
MARRYING |
| Time to execute Levenshtein function - 0.203641 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.370530 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.027787 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.039838 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.000918 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. |