Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
quietude (0) - 1 freq quieted (2) - 1 freq quiethke (2) - 1 freq quietie (2) - 1 freq quintus (3) - 1 freq quietens (3) - 1 freq quite (3) - 486 freq quited (3) - 1 freq queue (3) - 82 freq latietude (3) - 2 freq quietent (3) - 1 freq quaetlie (3) - 2 freq quietest (3) - 1 freq tubetube (3) - 1 freq quieten (3) - 2 freq quietened (3) - 1 freq quietlike (3) - 10 freq quieter (3) - 11 freq quietly (3) - 61 freq quitie (3) - 2 freq yuletide (3) - 12 freq quilted (3) - 1 freq yuiltide (3) - 1 freq quiet (3) - 243 freq quietlik (3) - 1 freq |
quietude (0) - 1 freq quieted (2) - 1 freq quited (3) - 1 freq quietie (3) - 1 freq quitie (4) - 2 freq yuletide (4) - 12 freq quietened (4) - 1 freq quilted (4) - 1 freq quieter (4) - 11 freq quiet (4) - 243 freq quoted (4) - 9 freq etude (4) - 1 freq quieten (4) - 2 freq yuiltide (4) - 1 freq quietly (4) - 61 freq quite (4) - 486 freq quaetlie (4) - 2 freq quiethke (4) - 1 freq quaetly (5) - 2 freq quate (5) - 161 freq ruited (5) - 4 freq quit (5) - 30 freq queets (5) - 6 freq quid (5) - 88 freq quiat (5) - 2 freq |
SoundEx code - Q330 quoted - 9 freq quotit - 11 freq quieted - 1 freq quietude - 1 freq quottit - 1 freq quited - 1 freq |
MetaPhone code - KTT cat'd - 1 freq gutted - 32 freq cuttit - 21 freq guidit - 17 freq quoted - 9 freq kiddit - 1 freq quotit - 11 freq gteat - 1 freq guttit - 4 freq goadit - 3 freq guttet - 8 freq guided - 16 freq coatit - 5 freq cutted - 1 freq cuddied - 1 freq quieted - 1 freq coated - 4 freq kittit - 2 freq coatet - 3 freq kiddet - 3 freq cadet - 2 freq kitted - 10 freq quietude - 1 freq quottit - 1 freq gated - 1 freq quited - 1 freq caaed-oot - 1 freq goaded - 1 freq godot - 1 freq coded - 2 freq €™guided - 1 freq gtid - 1 freq kidded - 1 freq ctodd - 1 freq ktid - 1 freq |
QUIETUDE |
Time to execute Levenshtein function - 0.507388 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.674419 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.041141 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.060108 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.000902 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. |