| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| obayed (0) - 2 freq okayed (1) - 1 freq obeyed (1) - 4 freq bawed (2) - 2 freq xrayed (2) - 1 freq sayed (2) - 1135 freq baaed (2) - 1 freq payed (2) - 4 freq frayed (2) - 2 freq baed (2) - 3 freq played (2) - 256 freq based (2) - 84 freq stayed (2) - 53 freq obayit (2) - 2 freq swayed (2) - 9 freq bayes (2) - 1 freq oaged (2) - 1 freq bared (2) - 6 freq baled (2) - 2 freq prayed (2) - 42 freq layed (2) - 16 freq slayed (2) - 2 freq baked (2) - 28 freq flayed (2) - 2 freq bayd (2) - 1 freq |
obayed (0) - 2 freq obeyed (1) - 4 freq baed (2) - 3 freq obed (2) - 27 freq baaed (2) - 1 freq okayed (2) - 1 freq bayd (2) - 1 freq beed (3) - 22 freq oobed (3) - 1 freq beyd (3) - 10 freq obud (3) - 1 freq baid (3) - 7 freq abated (3) - 1 freq boued (3) - 22 freq baad (3) - 20 freq baud (3) - 12 freq bade (3) - 237 freq iboyd (3) - 1 freq booed (3) - 40 freq obaida (3) - 1 freq baked (3) - 28 freq boyd (3) - 13 freq byd (3) - 1 freq bayes (3) - 1 freq oaged (3) - 1 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 - OBYT obeyed - 4 freq obayit - 2 freq obayed - 2 freq |
OBAYED |
| Time to execute Levenshtein function - 0.182570 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.383129 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.030662 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.068326 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.000870 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. |