| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ootmest (0) - 1 freq ootpost (2) - 1 freq ootcast (2) - 2 freq totiest (2) - 1 freq ootmaist (2) - 14 freq ootsmert (2) - 1 freq ootset (2) - 15 freq ootlet (2) - 4 freq oontment (2) - 1 freq hottest (2) - 4 freq forrest (3) - 5 freq oonjust (3) - 1 freq howtiest (3) - 1 freq domes (3) - 2 freq comes (3) - 962 freq notes (3) - 117 freq oonces (3) - 3 freq ootpit (3) - 28 freq hoofnest (3) - 1 freq coorsest (3) - 3 freq oonless (3) - 4 freq jatest (3) - 1 freq comeat (3) - 1 freq oonjeest (3) - 1 freq ootsets (3) - 6 freq |
ootmest (0) - 1 freq ootmaist (2) - 14 freq ootset (3) - 15 freq totiest (3) - 1 freq ootpost (3) - 1 freq ootcast (3) - 2 freq utmost (3) - 3 freq utmaist (4) - 6 freq outcast (4) - 2 freq attest (4) - 2 freq eithest (4) - 1 freq outset (4) - 1 freq test (4) - 146 freq ootsmert (4) - 1 freq ootlet (4) - 4 freq oontment (4) - 1 freq hottest (4) - 4 freq taest (4) - 1 freq moist (5) - 9 freq foment (5) - 2 freq oddest (5) - 1 freq soorest (5) - 2 freq torment (5) - 15 freq mast (5) - 21 freq tempest (5) - 5 freq |
SoundEx code - O352 othings - 1 freq outins - 1 freq ootmaist - 14 freq odin's - 2 freq owdience - 10 freq ootmest - 1 freq outing - 2 freq outainsells - 1 freq ootins - 2 freq otinnies - 1 freq odinsbudgie - 1 freq ohtmezpccx - 1 freq |
MetaPhone code - OTMST ootmaist - 14 freq ootmest - 1 freq |
OOTMEST |
| Time to execute Levenshtein function - 0.210449 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.361484 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.027925 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.043219 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.001226 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. |