| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| quaet-like (0) - 2 freq quiet-like (1) - 5 freq quait-like (1) - 3 freq quaetlike (1) - 1 freq quict-like (2) - 1 freq quatelike (2) - 3 freq quietlike (2) - 10 freq quate-like (2) - 9 freq quaetlie (2) - 2 freq quait-lik (2) - 1 freq queer-like (2) - 5 freq taen-like (3) - 3 freq saut-like (3) - 1 freq saft-like (3) - 1 freq quatelik (3) - 1 freq cult-like (3) - 1 freq feart-like (3) - 1 freq daft-like (3) - 9 freq quietlik (3) - 1 freq queerlike (3) - 3 freq rat-like (3) - 1 freq cat-like (3) - 1 freq quaitlie (3) - 2 freq quick-like (3) - 2 freq quaetlins (3) - 10 freq |
quaet-like (0) - 2 freq quait-like (1) - 3 freq quiet-like (1) - 5 freq quait-lik (2) - 1 freq quaetlike (2) - 1 freq quate-like (2) - 9 freq queer-like (3) - 5 freq quietlike (3) - 10 freq quatelike (3) - 3 freq quict-like (3) - 1 freq rat-like (4) - 1 freq cat-like (4) - 1 freq quatelik (4) - 1 freq quietlik (4) - 1 freq saut-like (4) - 1 freq quaetlie (4) - 2 freq saft-like (5) - 1 freq gyte-like (5) - 1 freq feart-like (5) - 1 freq roit-like (5) - 1 freq quait-blak (5) - 1 freq quaitlie (5) - 2 freq quick-like (5) - 2 freq daft-like (5) - 9 freq taen-like (5) - 3 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 |
QUAET-LIKE |
| Time to execute Levenshtein function - 0.235170 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.382145 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.028272 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.038067 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.000896 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. |