| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ootpost (0) - 1 freq ootposts (1) - 1 freq ootput (2) - 2 freq ootcast (2) - 2 freq hotpot (2) - 1 freq compost (2) - 7 freq ootpit (2) - 28 freq ootmest (2) - 1 freq ootlat (3) - 6 freq ootgait (3) - 1 freq hotspot (3) - 1 freq ootcom (3) - 1 freq ostoft (3) - 1 freq noteyst (3) - 2 freq compose (3) - 6 freq ootwart (3) - 2 freq outcast (3) - 2 freq oonjust (3) - 1 freq ootmaist (3) - 14 freq ootgoin (3) - 1 freq ootfit (3) - 12 freq ootlook (3) - 2 freq roost (3) - 41 freq ooooft (3) - 1 freq toost (3) - 1 freq |
ootpost (0) - 1 freq ootposts (2) - 1 freq ootpit (3) - 28 freq ootmest (3) - 1 freq ootput (3) - 2 freq ootcast (3) - 2 freq ootset (4) - 15 freq utmost (4) - 3 freq toost (4) - 1 freq output (4) - 2 freq tost (4) - 2 freq totiest (4) - 1 freq outcast (4) - 2 freq repost (4) - 1 freq post (4) - 228 freq ootmaist (4) - 14 freq hotpot (4) - 1 freq compost (4) - 7 freq opposeit (5) - 1 freq ootht (5) - 4 freq papist (5) - 3 freq ooprt (5) - 1 freq pest (5) - 25 freq tapmost (5) - 1 freq twist (5) - 48 freq |
SoundEx code - O312 ootby's - 2 freq oot-bak - 1 freq oot-foxed - 1 freq outfacin - 1 freq ootposts - 1 freq ootfaws - 1 freq ootpost - 1 freq ootouypjrn - 1 freq odybcn - 1 freq |
MetaPhone code - OTPST ootpost - 1 freq |
OOTPOST |
| Time to execute Levenshtein function - 0.213291 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.355876 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.027589 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.038158 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.000892 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. |