| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| obey (0) - 7 freq obe (1) - 2 freq obed (1) - 27 freq owey (1) - 1 freq okey (1) - 1 freq oney (1) - 15 freq bey (1) - 24 freq obes (1) - 1 freq ovey (1) - 1 freq quey (2) - 3 freq obvs (2) - 4 freq bay (2) - 80 freq only (2) - 1847 freq yey (2) - 2 freq dovey (2) - 3 freq ooy (2) - 1 freq ojly (2) - 1 freq owes (2) - 4 freq onty (2) - 3 freq offy (2) - 2 freq oyer (2) - 2 freq key (2) - 217 freq chey (2) - 1 freq toley (2) - 1 freq beh (2) - 18 freq |
obey (0) - 7 freq bey (1) - 24 freq obe (1) - 2 freq bee (2) - 51 freq ebay (2) - 6 freq aby (2) - 11 freq bea (2) - 2 freq buey (2) - 10 freq abee (2) - 3 freq biy (2) - 3 freq be (2) - 14795 freq ob (2) - 2 freq boy (2) - 524 freq oboe (2) - 1 freq bei (2) - 55 freq obes (2) - 1 freq ovey (2) - 1 freq buy (2) - 378 freq oney (2) - 15 freq okey (2) - 1 freq obed (2) - 27 freq owey (2) - 1 freq abe (2) - 3 freq beuy (2) - 64 freq by (2) - 4520 freq |
SoundEx code - O100 off - 542 freq of - 4012 freq oaf - 51 freq ouf - 1 freq oof - 6 freq oaff - 110 freq 'of - 16 freq oo've - 3 freq oba - 2 freq obey - 7 freq ov - 59 freq obe - 2 freq oaffy - 3 freq oaffae - 2 freq ope - 3 freq oboe - 1 freq ouff - 1 freq oop - 2 freq ove - 1 freq ofhe - 1 freq owef - 1 freq o'view - 2 freq owf - 1 freq offae - 1 freq ovey - 1 freq 'of' - 1 freq oob - 1 freq ohff - 1 freq offy - 2 freq €œof - 6 freq op - 7 freq offie - 2 freq €˜of - 3 freq €™ope - 2 freq offay - 1 freq oov - 8 freq €™of - 3 freq owuhv - 1 freq opo - 1 freq obvo - 1 freq ooof - 1 freq opyu - 1 freq obf - 1 freq obv - 4 freq obbv - 1 freq ohp - 1 freq ofh - 1 freq opui - 1 freq obh - 2 freq oup - 1 freq ob - 2 freq oupa - 1 freq oove - 1 freq opp - 2 freq obp - 1 freq |
MetaPhone code - OB oba - 2 freq obey - 7 freq obe - 2 freq oboe - 1 freq oob - 1 freq obh - 2 freq ob - 2 freq |
OBEY |
| Time to execute Levenshtein function - 0.196870 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.335876 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.027311 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.036710 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.000821 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. |