Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
otder (0) - 1 freq other (1) - 579 freq otter (1) - 3 freq order (1) - 277 freq odder (1) - 1 freq older (1) - 27 freq owder (1) - 1 freq ode (2) - 13 freq fother (2) - 4 freq 'other (2) - 1 freq adder (2) - 4 freq voter (2) - 11 freq over (2) - 340 freq syder (2) - 5 freq vader (2) - 3 freq border (2) - 145 freq taer (2) - 1 freq bolder (2) - 2 freq ooner (2) - 2 freq solder (2) - 2 freq oÂ’er (2) - 6 freq bother (2) - 329 freq tther (2) - 6 freq aider (2) - 2 freq ooter (2) - 25 freq |
otder (0) - 1 freq owder (2) - 1 freq older (2) - 27 freq odder (2) - 1 freq other (2) - 579 freq otter (2) - 3 freq order (2) - 277 freq tier (3) - 36 freq etter (3) - 2 freq under (3) - 447 freq elder (3) - 58 freq utter (3) - 63 freq ryder (3) - 1 freq udder (3) - 1 freq der (3) - 303 freq cider (3) - 38 freq ootdoor (3) - 8 freq othir (3) - 1 freq ther (3) - 111 freq rider (3) - 10 freq pouder (3) - 1 freq wider (3) - 54 freq alder (3) - 1 freq teer (3) - 5 freq ether (3) - 27 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 - OTTR outdoor - 7 freq otder - 1 freq ootdoor - 8 freq outdoory - 1 freq |
OTDER |
Time to execute Levenshtein function - 0.212449 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.403389 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.029279 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.037472 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.000871 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. |