| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oontrow (0) - 1 freq doontrod (2) - 1 freq control (2) - 129 freq ooner (3) - 2 freq doon-low (3) - 1 freq doonlow (3) - 1 freq kowtow (3) - 1 freq morrow (3) - 11 freq monroe (3) - 2 freq cantrol (3) - 1 freq ootthrou (3) - 9 freq ootrun (3) - 3 freq strow (3) - 1 freq monro (3) - 1 freq tonto (3) - 5 freq borrow (3) - 16 freq sorrow (3) - 29 freq intro (3) - 6 freq untrod (3) - 1 freq contrar (3) - 10 freq ooow (3) - 1 freq contrak (3) - 2 freq conrod (3) - 1 freq yondroo (3) - 2 freq ootrel (3) - 3 freq |
oontrow (0) - 1 freq untrod (4) - 1 freq norrow (4) - 1 freq trow (4) - 132 freq inthrow (4) - 1 freq androw (4) - 1 freq strow (4) - 1 freq intro (4) - 6 freq control (4) - 129 freq doontrod (4) - 1 freq untrue (5) - 2 freq entrie (5) - 5 freq entrim (5) - 4 freq unbraw (5) - 2 freq trowe (5) - 65 freq €˜trow (5) - 1 freq contra (5) - 2 freq montrose (5) - 10 freq jondrew (5) - 2 freq nerrow (5) - 1 freq antrin (5) - 67 freq entryway (5) - 1 freq nairrow (5) - 1 freq auntrin (5) - 1 freq antrim (5) - 28 freq |
SoundEx code - O536 ontewhaur - 1 freq 'ontario' - 1 freq onyither - 2 freq ontario - 3 freq oontrow - 1 freq onethreefourtwo - 1 freq |
MetaPhone code - ONTR 'ontario' - 1 freq ontario - 3 freq oontrow - 1 freq |
OONTROW |
| Time to execute Levenshtein function - 0.201650 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.355765 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.028536 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.038241 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.000879 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. |