| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| overnight (0) - 1 freq oversight (1) - 1 freq owernight (1) - 2 freq owernicht (2) - 12 freq everynight (2) - 1 freq oversicht (2) - 1 freq overweight (2) - 4 freq thenight (3) - 5 freq governit (3) - 2 freq love-light (3) - 1 freq oersicht (3) - 1 freq overwecht (3) - 1 freq ootright (3) - 1 freq outright (3) - 1 freq owersicht (3) - 7 freq govermint (4) - 1 freq aright (4) - 7 freq overt (4) - 4 freq overbite (4) - 1 freq vertigo (4) - 1 freq ferninst (4) - 1 freq verish (4) - 1 freq vertish (4) - 1 freq cokernit (4) - 1 freq overview (4) - 1 freq |
overnight (0) - 1 freq owernight (2) - 2 freq everynight (2) - 1 freq oversight (2) - 1 freq overweight (3) - 4 freq oversicht (4) - 1 freq owernicht (4) - 12 freq overwecht (5) - 1 freq outright (5) - 1 freq rnght (5) - 1 freq ootright (5) - 1 freq thenight (5) - 5 freq fortnight (6) - 17 freq bernagh (6) - 1 freq goodnight (6) - 7 freq €œnight (6) - 1 freq 'right (6) - 21 freq overgate (6) - 3 freq varnish (6) - 6 freq aalright (6) - 1 freq vanisht (6) - 4 freq datenight (6) - 2 freq ahright (6) - 1 freq foresight (6) - 1 freq forenicht (6) - 26 freq |
SoundEx code - O165 offerin - 65 freq oafferin - 1 freq offrin - 1 freq offering - 9 freq offerins - 5 freq o'brian's - 1 freq over-indulge - 1 freq overweaning - 1 freq offern - 1 freq offeran - 2 freq overindulgin - 1 freq offerain - 7 freq offairin - 1 freq offerains - 1 freq offerin' - 2 freq offerings - 3 freq offrands - 1 freq oberon - 1 freq overhung - 1 freq obrans - 1 freq oafferins - 1 freq o'brien - 1 freq overnight - 1 freq overrun - 1 freq overmorrow - 2 freq |
MetaPhone code - OFRNFT overnight - 1 freq |
OVERNIGHT |
| Time to execute Levenshtein function - 0.217529 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.408279 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.027712 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.037231 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.000934 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. |