| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ofc (0) - 1 freq afc (1) - 27 freq off (1) - 546 freq oft (1) - 5 freq fc (1) - 54 freq osc (1) - 3 freq qfc (1) - 1 freq onc (1) - 1 freq of (1) - 4117 freq efc (1) - 1 freq oc (1) - 2 freq ofh (1) - 1 freq dfc (1) - 2 freq mfc (1) - 7 freq oic (1) - 1 freq lfc (1) - 4 freq opc (1) - 1 freq kfc (1) - 5 freq rfc (1) - 1 freq oqc (1) - 1 freq ogfc (1) - 1 freq ouh (2) - 1 freq o‘ (2) - 1 freq syc (2) - 1 freq jfv (2) - 1 freq |
ofc (0) - 1 freq efc (1) - 1 freq afc (1) - 27 freq fc (1) - 54 freq ogfc (2) - 1 freq oqc (2) - 1 freq kfc (2) - 5 freq opc (2) - 1 freq iufc (2) - 1 freq fac (2) - 18 freq fic (2) - 1 freq lfc (2) - 4 freq fca (2) - 1 freq efuc (2) - 1 freq rfc (2) - 1 freq oic (2) - 1 freq onc (2) - 1 freq osc (2) - 3 freq oft (2) - 5 freq off (2) - 546 freq of (2) - 4117 freq qfc (2) - 1 freq dfc (2) - 2 freq mfc (2) - 7 freq ofh (2) - 1 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 - OFK ofc - 1 freq oghic - 1 freq |
OFC |
| Time to execute Levenshtein function - 0.335627 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.704129 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.036377 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.092939 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.000976 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. |