Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
quatelik (0) - 1 freq quatelike (1) - 3 freq quate-like (2) - 9 freq quately (2) - 21 freq quait-lik (2) - 1 freq quaeit (3) - 1 freq nate-lik (3) - 1 freq quarterit (3) - 1 freq quaet-like (3) - 2 freq quaitlie (3) - 2 freq squattlin (3) - 1 freq quaten (3) - 2 freq quietlik (3) - 1 freq quate (3) - 161 freq quatened (3) - 2 freq saelik (3) - 1 freq blate-lik (3) - 1 freq quaetlike (3) - 1 freq queelin (3) - 1 freq quater (3) - 5 freq quarely (3) - 5 freq quaters (3) - 1 freq quaetlie (3) - 2 freq blatelike (3) - 1 freq queerlik (3) - 1 freq |
quatelik (0) - 1 freq quatelike (1) - 3 freq quaetlike (3) - 1 freq quietlik (3) - 1 freq quait-lik (3) - 1 freq quate-like (3) - 9 freq quately (3) - 21 freq queerlik (4) - 1 freq quait-like (4) - 3 freq quietlike (4) - 10 freq quaetlie (4) - 2 freq quaitlie (4) - 2 freq quaet-like (4) - 2 freq queerlike (5) - 3 freq blatelike (5) - 1 freq quhilk (5) - 4 freq nate-lik (5) - 1 freq quiet-like (5) - 5 freq quaten (5) - 2 freq quaeit (5) - 1 freq quaters (5) - 1 freq quarely (5) - 5 freq quate (5) - 161 freq quaitly (5) - 6 freq quatened (5) - 2 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 |
QUATELIK |
Time to execute Levenshtein function - 0.259675 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.461466 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.031522 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.045892 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.000827 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. |