| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| offair (0) - 11 freq offairs (1) - 1 freq affair (1) - 36 freq effair (1) - 1 freq offay (2) - 1 freq offae (2) - 1 freq unfair (2) - 10 freq affair' (2) - 1 freq offaice (2) - 11 freq fair (2) - 1530 freq offaicer (2) - 3 freq oaffir (2) - 5 freq 'fair (2) - 6 freq effeir (2) - 1 freq flair (2) - 398 freq offal (2) - 2 freq affatr (2) - 1 freq affairs (2) - 42 freq effairs (2) - 3 freq offer (2) - 177 freq offin (2) - 20 freq offrin (2) - 1 freq offie (2) - 2 freq offaired (2) - 1 freq obsair (2) - 11 freq |
offair (0) - 11 freq affair (1) - 36 freq effair (1) - 1 freq offairs (2) - 1 freq effeir (2) - 1 freq oaffir (2) - 5 freq offer (2) - 177 freq affeir (2) - 1 freq offin (3) - 20 freq oaffer (3) - 2 freq offrin (3) - 1 freq offaired (3) - 1 freq offairin (3) - 1 freq oaffur (3) - 1 freq affer (3) - 2 freq iffer (3) - 1 freq effairs (3) - 3 freq oonfair (3) - 1 freq offie (3) - 2 freq offay (3) - 1 freq affair' (3) - 1 freq affairs (3) - 42 freq unfair (3) - 10 freq offae (3) - 1 freq fair (3) - 1530 freq |
SoundEx code - O160 over - 340 freq offer - 177 freq oaffer - 2 freq o'fare - 1 freq opera - 11 freq oaffir - 5 freq opera' - 1 freq oppor - 1 freq offair - 11 freq oeuvre - 1 freq overaw - 3 freq operae - 1 freq owver - 1 freq oafur - 1 freq oaffur - 1 freq ovr - 1 freq oooveer - 1 freq oboarw - 1 freq |
MetaPhone code - OFR over - 340 freq offer - 177 freq oaffer - 2 freq o'fare - 1 freq oaffir - 5 freq offair - 11 freq oeuvre - 1 freq overaw - 3 freq owver - 1 freq oafur - 1 freq oaffur - 1 freq ovr - 1 freq oooveer - 1 freq |
OFFAIR |
| Time to execute Levenshtein function - 0.229224 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.385899 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.029313 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.040023 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.000904 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. |