| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| quaetlike (0) - 1 freq quietlike (1) - 10 freq quaetlie (1) - 2 freq quaet-like (1) - 2 freq quaitlie (2) - 2 freq quait-like (2) - 3 freq quietlik (2) - 1 freq quaetlins (2) - 10 freq quate-like (2) - 9 freq quiet-like (2) - 5 freq quatelike (2) - 3 freq queerlike (2) - 3 freq quatelik (3) - 1 freq queer-like (3) - 5 freq daftlike (3) - 1 freq waeklike (3) - 1 freq quait-lik (3) - 1 freq queerlik (3) - 1 freq quietie (3) - 1 freq quiethke (3) - 1 freq quaetly (3) - 2 freq saelike (3) - 3 freq quict-like (3) - 1 freq saftlike (3) - 6 freq quaet (4) - 26 freq |
quaetlike (0) - 1 freq quietlike (1) - 10 freq quietlik (2) - 1 freq quatelike (2) - 3 freq quaetlie (2) - 2 freq quaet-like (2) - 2 freq queerlike (3) - 3 freq quaitlie (3) - 2 freq quiet-like (3) - 5 freq quatelik (3) - 1 freq quate-like (3) - 9 freq quait-like (3) - 3 freq quait-lik (4) - 1 freq quiethke (4) - 1 freq quaetly (4) - 2 freq queerlik (4) - 1 freq quaetlins (4) - 10 freq saftlike (5) - 6 freq quietly (5) - 61 freq quaitly (5) - 6 freq fitlike (5) - 1 freq quict-like (5) - 1 freq saelike (5) - 3 freq waeklike (5) - 1 freq daftlike (5) - 1 freq |
SoundEx code - Q342 quiet-like - 5 freq quait-like - 3 freq quate-like - 9 freq quaet-like - 2 freq quatelike - 3 freq quait-lik - 1 freq quietlik - 1 freq quietlike - 10 freq quaetlike - 1 freq quatelik - 1 freq quhytehillis - 1 freq qtlwsilqv - 1 freq |
MetaPhone code - KTLK quiet-like - 5 freq catalogue - 16 freq quait-like - 3 freq quate-like - 9 freq quaet-like - 2 freq quatelike - 3 freq quait-lik - 1 freq gaidhlig - 8 freq quietlik - 1 freq quietlike - 10 freq goodluck - 2 freq cowt-lik - 1 freq gàidhlig - 71 freq cuttie-like - 1 freq cuttie-lik - 2 freq quaetlike - 1 freq cat-like - 1 freq goidelic - 3 freq quatelik - 1 freq godlaek - 1 freq cataloag - 1 freq |
QUAETLIKE |
| Time to execute Levenshtein function - 0.589615 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.704040 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.027650 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.072048 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.000815 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. |