| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| skinnylinky (0) - 1 freq skinnymalinky (2) - 11 freq skinnymalink (3) - 14 freq skinklin (4) - 32 freq skinnymalinkie (4) - 5 freq skinnin (4) - 3 freq kinnlin (4) - 10 freq €œskinnymalinky (4) - 1 freq skinning (4) - 1 freq skinflint (4) - 3 freq skinkling (4) - 1 freq sannyin (5) - 1 freq shinsplints (5) - 1 freq skyline (5) - 6 freq rekinnlin (5) - 1 freq skinnier (5) - 1 freq singling (5) - 1 freq kindlin (5) - 5 freq spinnly (5) - 1 freq skilin (5) - 4 freq sinnin (5) - 2 freq spinning (5) - 9 freq slinky (5) - 1 freq sunblinks (5) - 1 freq hinnyin (5) - 1 freq |
skinnylinky (0) - 1 freq skinnymalinky (3) - 11 freq skinnymalink (4) - 14 freq skinnymalinkie (5) - 5 freq skinflint (6) - 3 freq skinniemalink (6) - 1 freq skinkling (6) - 1 freq skinning (6) - 1 freq skinnin (6) - 3 freq skinklin (6) - 32 freq kinnlin (6) - 10 freq kennlin (7) - 5 freq skinny-malinkie (7) - 1 freq sunblink (7) - 1 freq skeenklin (7) - 5 freq skinklan (7) - 3 freq skantlins (7) - 1 freq €œskinnymalinky (7) - 1 freq rekinnlin (7) - 1 freq skinkin (8) - 1 freq kinnik (8) - 1 freq skirling (8) - 1 freq skyline (8) - 6 freq skrunklin (8) - 3 freq skinklit (8) - 3 freq |
SoundEx code - S545 smilin - 155 freq smallness - 1 freq smellin - 15 freq smiling - 16 freq smilin' - 1 freq semolina - 5 freq snailin - 1 freq snuilin - 1 freq sun-loungers - 1 freq smilan - 8 freq smelling - 4 freq skinnylinky - 1 freq smeilin - 1 freq sun-lounge - 1 freq somnolent - 1 freq semolina-textured - 1 freq semolinie - 1 freq sámiland - 1 freq scanlon - 49 freq €˜scanlon - 2 freq snawline - 1 freq smilnehomes - 1 freq smellin' - 1 freq shonawhillansx - 1 freq |
MetaPhone code - SKNLNK skinnylinky - 1 freq |
SKINNYLINKY |
| Time to execute Levenshtein function - 0.254334 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.429807 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.027200 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.037385 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.000944 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. |