| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| skinnymalinkie (0) - 5 freq skinny-malinkie (1) - 1 freq skinnymalink (2) - 14 freq skinnymalinky (2) - 11 freq €œskinnymalinky (4) - 1 freq skinniemalink (4) - 1 freq skinnylinky (4) - 1 freq skinwalker (7) - 7 freq funny-like (7) - 2 freq skinkling (7) - 1 freq skraikie (7) - 1 freq kin-like (7) - 1 freq seingularitie (7) - 1 freq skrankie (7) - 4 freq skyline (7) - 6 freq kennymacaskill (7) - 3 freq malinkies (7) - 1 freq sing-sangie (7) - 1 freq canny-like (7) - 1 freq skinklin (7) - 32 freq kin-walin (7) - 1 freq skinning (7) - 1 freq kinnlin (7) - 10 freq semolinie (7) - 1 freq stenalineukie (7) - 1 freq |
skinnymalinkie (0) - 5 freq skinnymalinky (2) - 11 freq skinnymalink (2) - 14 freq skinny-malinkie (2) - 1 freq skinniemalink (4) - 1 freq skinnylinky (5) - 1 freq €œskinnymalinky (6) - 1 freq stenalineukie (10) - 1 freq skinflint (10) - 3 freq skinning (10) - 1 freq skinkling (10) - 1 freq skinnin (10) - 3 freq kinnlin (10) - 10 freq skinklin (10) - 32 freq skrinkie (11) - 1 freq saimelike (11) - 1 freq skeenklin (11) - 5 freq sunblink (11) - 1 freq skrunklin (11) - 3 freq rekinnlin (11) - 1 freq skinklan (11) - 3 freq jonnymain (11) - 4 freq sinnonie (11) - 1 freq kinglike (11) - 1 freq skantlins (11) - 1 freq |
SoundEx code - S554 seeminlie - 30 freq seeminly - 17 freq skinnymalink - 14 freq skinnymalinky - 11 freq seminal - 1 freq sin-in-laaw - 5 freq son-in-law - 4 freq son-inlaw - 1 freq skinnymalinkie - 5 freq skinny-malinkie - 1 freq samanalakande - 1 freq skinniemalink - 1 freq €œskinnymalinky - 1 freq simonwhall - 3 freq |
MetaPhone code - SKNMLNK skinnymalink - 14 freq skinnymalinky - 11 freq skinnymalinkie - 5 freq skinny-malinkie - 1 freq skinniemalink - 1 freq €œskinnymalinky - 1 freq |
SKINNYMALINKIE |
| Time to execute Levenshtein function - 0.208017 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.400950 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.027386 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.037604 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.000980 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. |