| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| killin-strang (0) - 1 freq rivlin-strings (4) - 1 freq billie-cans (6) - 2 freq millstane (6) - 2 freq hillington (6) - 2 freq killing (6) - 7 freq killins (6) - 1 freq kie-stane (6) - 3 freq callishang (6) - 1 freq klinsman (6) - 1 freq plainsang (6) - 1 freq bellinagrana (6) - 1 freq plainstane (6) - 1 freq kilwinning (6) - 1 freq killertron (6) - 1 freq illustrate (6) - 14 freq killings (6) - 2 freq palin-stabs (6) - 1 freq klinsmann (6) - 3 freq harsh-strung (7) - 1 freq willintlie (7) - 2 freq lanrang (7) - 2 freq alvinstraight (7) - 1 freq mirror-stand (7) - 1 freq dillderan (7) - 1 freq |
killin-strang (0) - 1 freq rivlin-strings (7) - 1 freq killertron (10) - 1 freq draa-string (11) - 1 freq harsh-strung (11) - 1 freq palin-stabs (11) - 1 freq illustrate (11) - 14 freq klinsmann (11) - 3 freq ill-setten (11) - 3 freq well-traint (11) - 1 freq naelstring (11) - 1 freq bully-steens (11) - 1 freq harp-strung (11) - 1 freq neilarmstrong (11) - 2 freq killings (11) - 2 freq killins (11) - 1 freq kie-stane (11) - 3 freq killing (11) - 7 freq hillington (11) - 2 freq ill-turn (11) - 1 freq millstane (11) - 2 freq kilwinning (11) - 1 freq callishang (11) - 1 freq plainsang (11) - 1 freq plainstane (11) - 1 freq |
SoundEx code - K452 killing - 7 freq killins - 1 freq klankan - 1 freq killinchy - 3 freq killin-strang - 1 freq klyms - 1 freq kelng - 1 freq kilns - 1 freq killings - 2 freq kleenex - 3 freq klinsmann - 3 freq klinsmann's - 2 freq klinsman - 1 freq kilncadzow-kincadie - 1 freq klingons - 1 freq kalonji - 1 freq killingeve - 1 freq klines - 1 freq kilngranny - 1 freq |
MetaPhone code - KLNSTRNK killin-strang - 1 freq |
KILLIN-STRANG |
| Time to execute Levenshtein function - 0.292566 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.513914 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.030727 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.045866 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.000929 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. |