| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| offish (0) - 12 freq oaffish (1) - 1 freq fuish (2) - 1 freq wolfish (2) - 1 freq offisher (2) - 19 freq offys (2) - 8 freq €œfish (2) - 1 freq offishes (2) - 1 freq offie (2) - 2 freq offishis (2) - 2 freq waffish (2) - 2 freq offing (2) - 1 freq office (2) - 216 freq offies (2) - 1 freq offin (2) - 20 freq offess (2) - 1 freq offs (2) - 9 freq 'fish (2) - 2 freq fish (2) - 400 freq feish (2) - 51 freq o'pish (2) - 1 freq boyish (3) - 1 freq coffs (3) - 2 freq leish (3) - 2 freq bitish (3) - 1 freq |
offish (0) - 12 freq oaffish (1) - 1 freq offies (3) - 1 freq offs (3) - 9 freq waffish (3) - 2 freq fish (3) - 400 freq feish (3) - 51 freq offishis (3) - 2 freq 'fish (3) - 2 freq offess (3) - 1 freq offishes (3) - 1 freq offys (3) - 8 freq fuish (3) - 1 freq offisher (3) - 19 freq finish (4) - 76 freq affs (4) - 4 freq effies (4) - 1 freq fesh (4) - 20 freq ffs (4) - 152 freq forsh (4) - 1 freq flush (4) - 26 freq fysh (4) - 5 freq flesh (4) - 122 freq affest (4) - 1 freq frush (4) - 4 freq |
SoundEx code - O120 offski - 6 freq office - 216 freq obvious - 86 freq oaffice - 8 freq offish - 12 freq oops - 18 freq oaps - 4 freq offies - 1 freq obveeous - 1 freq offess - 1 freq offs - 9 freq oaffish - 1 freq opaque - 6 freq office' - 1 freq obese - 8 freq offece - 1 freq offce - 2 freq offys - 8 freq offiece - 3 freq offees - 1 freq offaice - 11 freq oobag - 1 freq opus - 2 freq opsi - 1 freq oafice - 6 freq €˜oops - 1 freq ops - 1 freq oepg - 1 freq obusy - 1 freq ofkg - 1 freq ofc - 1 freq oppkks - 1 freq ofjk - 1 freq o'bugs - 1 freq o'pish - 1 freq opc - 1 freq oavzje - 1 freq offsky - 2 freq ooppssssss - 1 freq obes - 1 freq oppose - 2 freq obs - 1 freq obvs - 4 freq obg - 1 freq oevci - 2 freq obz - 1 freq opps - 1 freq oafs - 1 freq |
MetaPhone code - OFX offish - 12 freq oaffish - 1 freq |
OFFISH |
| Time to execute Levenshtein function - 0.200218 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.345719 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.029007 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.040638 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.000900 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. |