| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ofzm (0) - 1 freq onzm (1) - 1 freq rzm (2) - 1 freq oft (2) - 5 freq fm (2) - 90 freq ocbm (2) - 1 freq fhm (2) - 1 freq gfm (2) - 1 freq hfz (2) - 1 freq o'em (2) - 3 freq off (2) - 546 freq oz (2) - 15 freq osz (2) - 1 freq tfrm (2) - 1 freq oqm (2) - 1 freq nfum (2) - 2 freq bizm (2) - 1 freq of (2) - 4117 freq oam (2) - 2 freq ofcom (2) - 5 freq fz (2) - 12 freq offt (2) - 1 freq fom (2) - 2 freq zm (2) - 1 freq otz (2) - 1 freq |
ofzm (0) - 1 freq onzm (2) - 1 freq fom (3) - 2 freq fz (3) - 12 freq ofcom (3) - 5 freq zm (3) - 1 freq fim (3) - 4 freq fum (3) - 1 freq bizm (3) - 1 freq fam (3) - 23 freq ryzm (3) - 1 freq fm (3) - 90 freq fhm (3) - 1 freq rzm (3) - 1 freq afzal (4) - 1 freq flem (4) - 1 freq faze (4) - 2 freq fame (4) - 48 freq fawm (4) - 2 freq furm (4) - 20 freq fuzz (4) - 2 freq fozzy (4) - 1 freq gizmo (4) - 2 freq zma (4) - 1 freq oz (4) - 15 freq |
SoundEx code - O125 obscene - 13 freq obscenities - 2 freq offcn - 1 freq oohyafuckin - 1 freq obscenely - 3 freq off-chance - 1 freq ovey-somethin - 1 freq opposin - 3 freq opposing - 2 freq obviousness - 1 freq ofcom - 5 freq oybxmv - 1 freq obknit - 1 freq ofzm - 1 freq ophusnnk - 1 freq ofjnzg - 1 freq opscmh - 1 freq |
MetaPhone code - OFSM ofzm - 1 freq |
OFZM |
| Time to execute Levenshtein function - 0.189703 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.348751 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.028899 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.037257 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. |