| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| marinells (0) - 1 freq marineris (2) - 1 freq mariner (3) - 4 freq harebells (3) - 2 freq pannells (3) - 1 freq marigolds (3) - 4 freq martello (3) - 1 freq mainers (3) - 2 freq maries (3) - 60 freq kirnells (3) - 1 freq marginally (3) - 3 freq martell (3) - 1 freq marincr's (3) - 1 freq marine (3) - 15 freq mariners' (3) - 2 freq marshalls (3) - 1 freq marvels (3) - 1 freq marie's (3) - 27 freq marcel's (3) - 1 freq marcelli (3) - 1 freq marinade (4) - 3 freq maryhill (4) - 3 freq marion's (4) - 1 freq carlines (4) - 3 freq macinnes (4) - 4 freq |
marinells (0) - 1 freq kirnells (4) - 1 freq marineris (4) - 1 freq marvels (5) - 1 freq martell (5) - 1 freq marseilles (5) - 1 freq marcelli (5) - 1 freq marvellous (5) - 10 freq marginally (5) - 3 freq marcel's (5) - 1 freq marshalls (5) - 1 freq marigolds (5) - 4 freq pannells (5) - 1 freq martello (5) - 1 freq harebells (5) - 2 freq manuals (6) - 2 freq macneil's (6) - 2 freq pringles (6) - 3 freq munnell (6) - 2 freq furtells (6) - 1 freq drills (6) - 14 freq annalls (6) - 1 freq murmell (6) - 2 freq purnell (6) - 1 freq trills (6) - 2 freq |
SoundEx code - M654 marmalade - 12 freq murmled - 5 freq muirmiln - 2 freq mairmalade - 1 freq murmlin - 2 freq murmeln - 1 freq murmell - 2 freq murmelt - 2 freq marinells - 1 freq mrmalky - 32 freq mrmalcovitch - 1 freq mrneilforsyth - 1 freq |
MetaPhone code - MRNLS marinells - 1 freq |
MARINELLS |
| Time to execute Levenshtein function - 0.224342 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.350133 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.028457 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.038531 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.000880 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. |