| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| square-lickly (0) - 1 freq square-lookin (4) - 1 freq squarely (5) - 3 freq quarestick (5) - 1 freq quate-like (5) - 9 freq squaresail (5) - 1 freq quickly (6) - 191 freq star-licht (6) - 1 freq squerr-slice (6) - 1 freq square-sailed (6) - 1 freq squally (6) - 1 freq soar-lik (6) - 1 freq quatelik (6) - 1 freq quait-lik (6) - 1 freq quaet-like (6) - 2 freq quaetlike (6) - 1 freq quatelike (6) - 3 freq surreally (6) - 1 freq square-shaped (6) - 1 freq snaar-like (6) - 1 freq quait-like (6) - 3 freq square-gos (6) - 1 freq squaiky-like (6) - 2 freq sae-lik (6) - 2 freq squarebottle (6) - 1 freq |
square-lickly (0) - 1 freq square-lookin (6) - 1 freq squaiky-like (9) - 2 freq strickly (9) - 1 freq star-licht (9) - 1 freq soar-lik (9) - 1 freq snaar-like (9) - 1 freq squarely (9) - 3 freq quarestick (9) - 1 freq quate-like (9) - 9 freq squaresail (9) - 1 freq squarebottle (10) - 1 freq sae-lik (10) - 2 freq square-goes (10) - 1 freq sojer-like (10) - 1 freq sprickle (10) - 1 freq spreckle (10) - 1 freq square-gos (10) - 1 freq queer-like (10) - 5 freq couardie-lick (10) - 2 freq squarebreeks (10) - 1 freq square-sailed (10) - 1 freq quickly (10) - 191 freq quait-like (10) - 3 freq squerr-slice (10) - 1 freq |
SoundEx code - S642 skirls - 16 freq square-lookin - 1 freq sherlock - 7 freq squirrels - 20 freq scrolls - 6 freq scurrilous - 2 freq sair-leukin - 1 freq soar-lik - 1 freq soorlike - 1 freq 'squirrels - 1 freq swirls - 7 freq surrealism - 2 freq sairless - 1 freq square-lickly - 1 freq scurls - 1 freq soor-lukkan - 1 freq skerls - 3 freq serialise - 1 freq surrealist - 1 freq sweir-like - 1 freq skirls'll - 1 freq skroils - 1 freq surreywallcreep - 1 freq |
MetaPhone code - SKRLKL square-lickly - 1 freq |
SQUARE-LICKLY |
| Time to execute Levenshtein function - 0.280473 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.472801 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.030248 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.042350 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.001123 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. |