| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| offt (0) - 1 freq offs (1) - 9 freq fft (1) - 1 freq ooft (1) - 5 freq offy (1) - 2 freq ufft (1) - 1 freq oft (1) - 5 freq cofft (1) - 1 freq pfft (1) - 3 freq off (1) - 546 freq afft (1) - 1 freq oaft (1) - 6 freq ocht (2) - 317 freq ofc (2) - 1 freq loft (2) - 13 freq doff (2) - 3 freq offer (2) - 177 freq oafs (2) - 1 freq omfg (2) - 1 freq ooaft (2) - 2 freq oeht (2) - 1 freq offie (2) - 2 freq oaff (2) - 110 freq hufft (2) - 1 freq mufft (2) - 3 freq |
offt (0) - 1 freq ufft (1) - 1 freq fft (1) - 1 freq afft (1) - 1 freq oaft (2) - 6 freq fyft (2) - 1 freq fift (2) - 14 freq pfft (2) - 3 freq off (2) - 546 freq offs (2) - 9 freq ooft (2) - 5 freq offy (2) - 2 freq cofft (2) - 1 freq oft (2) - 5 freq soft (3) - 52 freq ft (3) - 19 freq offys (3) - 8 freq lift (3) - 496 freq offen (3) - 17 freq effi (3) - 1 freq ff (3) - 7 freq taft (3) - 1 freq affs (3) - 4 freq lyft (3) - 2 freq reft (3) - 4 freq |
SoundEx code - O130 obed - 27 freq 'ooft - 3 freq obitu - 1 freq obeyed - 4 freq oft - 5 freq ooaft - 2 freq oaft - 6 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 owbbt - 3 freq obda - 1 freq oftea - 1 freq ooooft - 1 freq opoty - 1 freq offt - 1 freq |
MetaPhone code - OFT ought - 12 freq oaght - 1 freq 'ooft - 3 freq oft - 5 freq ooaft - 2 freq oaft - 6 freq €˜ooft - 1 freq ovoid - 1 freq €˜ought - 1 freq ovid - 1 freq ovd - 3 freq oooft - 4 freq ooft - 5 freq oftea - 1 freq ooooft - 1 freq offt - 1 freq |
OFFT |
| Time to execute Levenshtein function - 0.206650 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.337229 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.027757 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.038378 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.000934 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. |