Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
oagit (0) - 5 freq oaght (1) - 1 freq oagin (1) - 6 freq voamit (2) - 2 freq ragiy (2) - 1 freq foggit (2) - 2 freq wabit (2) - 1 freq oaged (2) - 1 freq coaxit (2) - 1 freq edgit (2) - 1 freq vaigit (2) - 1 freq saggit (2) - 1 freq pangit (2) - 6 freq warit (2) - 1 freq raggit (2) - 9 freq ladit (2) - 2 freq datit (2) - 6 freq oleit (2) - 1 freq orbit (2) - 10 freq baggit (2) - 4 freq gapit (2) - 1 freq oakiv (2) - 1 freq cakit (2) - 1 freq wadit (2) - 1 freq tacit (2) - 1 freq |
oagit (0) - 5 freq gait (2) - 137 freq git (2) - 1232 freq aget (2) - 1 freq agait (2) - 1 freq eegit (2) - 4 freq oagin (2) - 6 freq oaght (2) - 1 freq mait (3) - 84 freq uggit (3) - 1 freq hait (3) - 16 freq 'git (3) - 5 freq gieit (3) - 1 freq agin (3) - 700 freq aagist (3) - 1 freq payit (3) - 1 freq lait (3) - 4 freq gat (3) - 367 freq gatie (3) - 1 freq oubit (3) - 2 freq voyagit (3) - 8 freq egt (3) - 1 freq ought (3) - 11 freq obayit (3) - 2 freq abit (3) - 1 freq |
SoundEx code - O230 ocht - 317 freq ought - 11 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 - OJT oagit - 5 freq oaged - 1 freq |
OAGIT |
Time to execute Levenshtein function - 0.211157 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.551009 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.027325 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.081905 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.000771 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. |