| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| whit-lik (0) - 1 freq whit-like (1) - 1 freq whitlik (1) - 35 freq €œwhit-lik (2) - 1 freq whicrlin (3) - 1 freq quait-lik (3) - 1 freq whilk (3) - 193 freq whitelet (3) - 1 freq whitll (3) - 1 freq whit'll (3) - 15 freq whitin (3) - 25 freq wicelik (3) - 1 freq weirlik (3) - 1 freq whistlit (3) - 1 freq roit-like (3) - 1 freq cowt-lik (3) - 1 freq whittil (3) - 1 freq €œwhitlik (3) - 3 freq whittrick (3) - 1 freq whistlin (3) - 22 freq ghaist-lik (3) - 1 freq whirlit (3) - 1 freq whitit (3) - 1 freq whitmuir (3) - 1 freq whimplin (3) - 3 freq |
whit-lik (0) - 1 freq whit-like (1) - 1 freq whitlik (2) - 35 freq €œwhit-lik (4) - 1 freq whittled (5) - 2 freq saft-lik (5) - 1 freq whitelaw (5) - 1 freq whittil (5) - 1 freq ghaist-lik (5) - 1 freq whuttlin (5) - 2 freq whittle (5) - 3 freq whittlt (5) - 1 freq cowt-lik (5) - 1 freq whitreck (5) - 1 freq daft-lik (5) - 2 freq whitley (5) - 1 freq whit'll (5) - 15 freq quait-lik (5) - 1 freq whitelet (5) - 1 freq whitll (5) - 1 freq whilk (5) - 193 freq roit-like (5) - 1 freq white-cley (6) - 1 freq whut'll (6) - 1 freq whittelt (6) - 1 freq |
SoundEx code - W342 witless - 6 freq white-lugged - 1 freq wutless - 1 freq wedlock - 4 freq whut-like's - 1 freq whit-like - 1 freq whitlik - 35 freq whit-lik - 1 freq €œwhitlik - 3 freq €œwhit-lik - 1 freq wattles - 1 freq waddles - 1 freq wadlock - 1 freq wottles - 1 freq watlzers - 1 freq whatalaugh - 1 freq whitehills - 2 freq wtlqtxl - 1 freq |
MetaPhone code - WTLK wedlock - 4 freq whit-like - 1 freq whitlik - 35 freq whit-lik - 1 freq €œwhitlik - 3 freq €œwhit-lik - 1 freq wadlock - 1 freq |
WHIT-LIK |
| Time to execute Levenshtein function - 0.229739 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.421642 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.029073 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.040296 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.001157 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. |