Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
odoir (0) - 3 freq ooir (1) - 1 freq odour (1) - 3 freq ooin (2) - 1 freq oor (2) - 3996 freq ordnir (2) - 1 freq doin (2) - 75 freq choir (2) - 16 freq ooie (2) - 1 freq dair (2) - 11 freq dorr (2) - 43 freq afoir (2) - 68 freq doire (2) - 1 freq odhar (2) - 1 freq dois (2) - 3 freq oo'r (2) - 3 freq odo (2) - 1 freq pooir (2) - 1 freq d'ir (2) - 39 freq doar (2) - 29 freq dir (2) - 400 freq ooirs (2) - 2 freq owir (2) - 7 freq foir (2) - 6 freq iddir (2) - 11 freq |
odoir (0) - 3 freq odour (1) - 3 freq deir (2) - 7 freq duir (2) - 26 freq door (2) - 1906 freq doar (2) - 29 freq doer (2) - 1 freq doyr (2) - 1 freq dor (2) - 5 freq dour (2) - 126 freq doire (2) - 1 freq adair (2) - 1 freq dir (2) - 400 freq ooir (2) - 1 freq dair (2) - 11 freq ooer (3) - 17 freq dairy (3) - 28 freq ordour (3) - 2 freq daur (3) - 73 freq dore (3) - 3 freq deer (3) - 71 freq dr (3) - 199 freq admir (3) - 1 freq daar (3) - 11 freq adore (3) - 12 freq |
SoundEx code - O360 other - 579 freq ooter - 25 freq ootower - 22 freq out-throu - 6 freq oot-throu - 8 freq 'out-throu - 1 freq odder - 1 freq odour - 3 freq outdoor - 7 freq otder - 1 freq otter - 3 freq ootowre - 5 freq 'other - 1 freq oot-thru - 1 freq other' - 2 freq owder - 1 freq odhar - 1 freq outer - 4 freq ootdoor - 8 freq ootthrou - 9 freq owthar - 5 freq oh-tuh-rah - 7 freq outower - 5 freq owider - 1 freq owthor - 11 freq othir - 1 freq outhir - 1 freq owther - 5 freq oot-ower - 1 freq oot-owre - 1 freq 'other' - 1 freq out-ower - 1 freq outowre - 1 freq outdoory - 1 freq €˜other - 1 freq odoir - 3 freq o'their - 1 freq |
MetaPhone code - OTR ooter - 25 freq odder - 1 freq odour - 3 freq otter - 3 freq ootowre - 5 freq owder - 1 freq outer - 4 freq ootthrou - 9 freq oh-tuh-rah - 7 freq oot-owre - 1 freq outowre - 1 freq ootthrough - 1 freq odoir - 3 freq |
ODOIR |
Time to execute Levenshtein function - 0.220974 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.393077 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.027267 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.037183 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.000875 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. |