| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ooft (0) - 5 freq oof (1) - 6 freq oooft (1) - 4 freq coft (1) - 9 freq soft (1) - 51 freq oot (1) - 13735 freq offt (1) - 1 freq oaft (1) - 5 freq toft (1) - 1 freq oft (1) - 5 freq loft (1) - 13 freq oolt (1) - 1 freq 'ooft (1) - 3 freq doft (1) - 1 freq oort (1) - 8 freq tolt (2) - 138 freq root (2) - 35 freq got (2) - 3871 freq cost (2) - 113 freq eft (2) - 3 freq oov (2) - 8 freq lofty (2) - 2 freq loott (2) - 1 freq post (2) - 224 freq pfft (2) - 3 freq |
ooft (0) - 5 freq oft (1) - 5 freq oaft (1) - 5 freq oooft (1) - 4 freq eft (2) - 3 freq foot (2) - 74 freq oort (2) - 8 freq aft (2) - 67 freq ft (2) - 19 freq aift (2) - 14 freq doft (2) - 1 freq ooooft (2) - 1 freq fot (2) - 4 freq soft (2) - 51 freq 'ooft (2) - 3 freq offt (2) - 1 freq oot (2) - 13735 freq loft (2) - 13 freq toft (2) - 1 freq oolt (2) - 1 freq coft (2) - 9 freq oof (2) - 6 freq gout (3) - 10 freq ooto (3) - 85 freq out (3) - 773 freq |
SoundEx code - O130 obed - 27 freq 'ooft - 3 freq obitu - 1 freq obeyed - 4 freq oft - 5 freq obayit - 2 freq opt - 2 freq oubit - 2 freq obayed - 2 freq €˜ooft - 1 freq ovoid - 1 freq off-beat - 1 freq oped - 1 freq oobed - 1 freq ovid - 1 freq ovd - 3 freq oooft - 4 freq obud - 1 freq obaida - 1 freq ooft - 5 freq oaft - 5 freq owbbt - 3 freq obda - 1 freq oftea - 1 freq ooooft - 1 freq opoty - 1 freq offt - 1 freq |
MetaPhone code - OFT ought - 11 freq oaght - 1 freq 'ooft - 3 freq oft - 5 freq €˜ooft - 1 freq ovoid - 1 freq €˜ought - 1 freq ovid - 1 freq ovd - 3 freq oooft - 4 freq ooft - 5 freq oaft - 5 freq oftea - 1 freq ooooft - 1 freq offt - 1 freq |
OOFT |
| Time to execute Levenshtein function - 0.186307 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.316703 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.027226 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.036373 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.000843 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. |