| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oaght (0) - 1 freq oagit (1) - 5 freq ought (1) - 12 freq laaght (2) - 1 freq aught (2) - 4 freq hight (2) - 2 freq faught (2) - 2 freq tasht (2) - 1 freq oags (2) - 2 freq ocht (2) - 317 freq dasht (2) - 1 freq sought (2) - 10 freq ight (2) - 1 freq noght (2) - 1 freq ba'ht (2) - 1 freq foght (2) - 1 freq boght (2) - 2 freq oat (2) - 12 freq fasht (2) - 63 freq facht (2) - 1 freq oath (2) - 13 freq oag (2) - 2 freq acht (2) - 14 freq ootht (2) - 4 freq oeht (2) - 1 freq |
oaght (0) - 1 freq ought (1) - 12 freq ght (2) - 1 freq ight (2) - 1 freq eight (2) - 69 freq eaught (2) - 1 freq eyght (2) - 4 freq aught (2) - 4 freq oagit (2) - 5 freq saught (3) - 1 freq myght (3) - 2 freq toght (3) - 1 freq aacht (3) - 5 freq aghw (3) - 1 freq fight (3) - 95 freq aget (3) - 1 freq aht (3) - 27 freq tought (3) - 3 freq light (3) - 300 freq aaht (3) - 1 freq oucht (3) - 21 freq agh (3) - 11 freq lyght (3) - 2 freq night (3) - 955 freq sight (3) - 134 freq |
SoundEx code - O230 ocht - 317 freq ought - 12 freq oaght - 1 freq 'ocht - 2 freq oozit - 2 freq oucht - 21 freq oozed - 1 freq oagit - 5 freq owsed - 9 freq ouecht - 1 freq oxide - 1 freq oecd - 1 freq oakwood - 1 freq oesed - 3 freq oct - 4 freq oosed - 1 freq ought - 1 freq oaged - 1 freq ocd - 1 freq okda - 1 freq ocd - 4 freq ojdhii - 1 freq oushed - 1 freq oqsd - 1 freq okayed - 1 freq |
MetaPhone code - OFT ought - 12 freq oaght - 1 freq 'ooft - 3 freq oft - 5 freq ooaft - 2 freq oaft - 6 freq ooft - 1 freq ovoid - 1 freq ought - 1 freq ovid - 1 freq ovd - 3 freq oooft - 4 freq ooft - 5 freq oftea - 1 freq ooooft - 1 freq offt - 1 freq |
OAGHT |
| Time to execute Levenshtein function - 0.224502 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.377620 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.028734 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.038205 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.000905 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. |