| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ob (0) - 2 freq os (1) - 11 freq mb (1) - 5 freq bob (1) - 213 freq kb (1) - 4 freq uob (1) - 1 freq eb (1) - 6 freq ub (1) - 3 freq oc (1) - 2 freq oq (1) - 4 freq orb (1) - 2 freq gob (1) - 14 freq cb (1) - 3 freq oob (1) - 1 freq of (1) - 4012 freq lob (1) - 5 freq ow (1) - 12 freq obh (1) - 2 freq 'b (1) - 1 freq or (1) - 9206 freq bb (1) - 9 freq zob (1) - 1 freq dob (1) - 1 freq on (1) - 18792 freq hob (1) - 10 freq |
ob (0) - 2 freq b (1) - 745 freq oob (1) - 1 freq oba (1) - 2 freq ub (1) - 3 freq ab (1) - 25 freq ib (1) - 1 freq yb (1) - 3 freq eb (1) - 6 freq uob (1) - 1 freq obe (1) - 2 freq xb (2) - 3 freq rob (2) - 73 freq obv (2) - 4 freq oy (2) - 5 freq obs (2) - 1 freq qb (2) - 2 freq om (2) - 6 freq ot (2) - 18 freq obp (2) - 1 freq od (2) - 8 freq zb (2) - 3 freq oi (2) - 18 freq op (2) - 7 freq job (2) - 519 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 |
OB |
| Time to execute Levenshtein function - 0.294322 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.435223 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.028255 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.037377 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.000794 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. |