| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| quatened (0) - 2 freq quietened (2) - 1 freq quateness (2) - 8 freq quartered (2) - 5 freq quavered (2) - 2 freq quaten (2) - 2 freq wakened (3) - 9 freq equated (3) - 1 freq quivered (3) - 3 freq uttered (3) - 10 freq quatelik (3) - 1 freq buttered (3) - 19 freq quaregeg (3) - 1 freq quickened (3) - 3 freq maened (3) - 1 freq buttoned (3) - 11 freq quaeter (3) - 1 freq quene (3) - 12 freq quatre (3) - 1 freq flattened (3) - 8 freq mustered (3) - 1 freq quately (3) - 21 freq quited (3) - 1 freq quoted (3) - 9 freq quieted (3) - 1 freq |
quatened (0) - 2 freq quietened (2) - 1 freq quaten (3) - 2 freq quoted (4) - 9 freq quieted (4) - 1 freq quaiten (4) - 1 freq equated (4) - 1 freq quited (4) - 1 freq quateness (4) - 8 freq quartered (4) - 5 freq quavered (4) - 2 freq queen'd (5) - 1 freq quotient (5) - 1 freq attuned (5) - 2 freq stend (5) - 1 freq quotin (5) - 9 freq quietenin (5) - 1 freq quaicked (5) - 7 freq awakened (5) - 1 freq fattened (5) - 2 freq traetened (5) - 1 freq quarried (5) - 3 freq quacked (5) - 1 freq weakened (5) - 1 freq quietent (5) - 1 freq |
SoundEx code - Q353 quietent - 1 freq quietened - 1 freq quoydandy's - 1 freq quatened - 2 freq quotient - 1 freq qzdntdquci - 1 freq |
MetaPhone code - KTNT goodnight - 7 freq 'goodnight - 1 freq gotten't - 1 freq quietent - 1 freq quietened - 1 freq gate-end - 1 freq quatened - 2 freq quotient - 1 freq gdnd - 1 freq |
QUATENED |
| Time to execute Levenshtein function - 0.217713 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.427569 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.029802 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.038832 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.000874 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. |