| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ettlin-like (0) - 1 freq peityin-like (3) - 1 freq cuttie-like (4) - 1 freq eerie-like (4) - 2 freq thing-like (4) - 1 freq gutsie-like (4) - 1 freq ferlie-like (4) - 1 freq better-like (4) - 2 freq dillie-like (4) - 2 freq dentie-like (4) - 1 freq tentie-like (4) - 1 freq cuttit-like (4) - 2 freq taen-like (4) - 3 freq still-like (4) - 1 freq gentie-like (4) - 10 freq kin-like (4) - 1 freq ettlin (5) - 315 freq earth-like (5) - 1 freq warld-like (5) - 1 freq gleg-like (5) - 1 freq puggie-like (5) - 1 freq wabbit-like (5) - 2 freq delytit-like (5) - 1 freq electric-like (5) - 1 freq awfie-like (5) - 1 freq |
ettlin-like (0) - 1 freq peityin-like (5) - 1 freq taen-like (6) - 3 freq still-like (6) - 1 freq tentie-like (7) - 1 freq tailor-like (7) - 1 freq tattoo-like (7) - 1 freq taen-lik (7) - 1 freq kin-like (7) - 1 freq cuttit-like (7) - 2 freq gutsie-like (7) - 1 freq dillie-like (7) - 2 freq cuttie-like (7) - 1 freq ferlie-like (7) - 1 freq thing-like (7) - 1 freq better-like (7) - 2 freq skeelie-like (8) - 2 freq sudden-like (8) - 1 freq cuttie-lik (8) - 2 freq solemn-like (8) - 1 freq ertfu-lik (8) - 1 freq thrawn-like (8) - 1 freq quait-like (8) - 3 freq rat-like (8) - 1 freq ettlin' (8) - 1 freq |
SoundEx code - E345 ettlin - 315 freq ettling - 2 freq ettlins - 26 freq ettlin-like - 1 freq ettlin's - 1 freq ettlin' - 1 freq ettilin - 1 freq ettlan - 1 freq eytalian - 1 freq ethwilliams - 1 freq |
MetaPhone code - ETLNLK ettlin-like - 1 freq |
ETTLIN-LIKE |
| Time to execute Levenshtein function - 0.223986 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.437183 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.029178 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.038651 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.000852 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. |