| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| shoreline (0) - 4 freq shorelin (1) - 2 freq shore-line (1) - 1 freq storyline (2) - 5 freq shortlie (2) - 1 freq shortlins (2) - 1 freq shovelin (2) - 2 freq hotline (3) - 1 freq shore-win (3) - 1 freq snorklin (3) - 1 freq shouldne (3) - 1 freq shooerin (3) - 2 freq shouglin (3) - 2 freq showein (3) - 6 freq shortlist (3) - 1 freq sturelie (3) - 1 freq shortenin (3) - 2 freq storylines (3) - 2 freq andreline (3) - 1 freq shouglie (3) - 1 freq shooglin (3) - 17 freq shrine (3) - 12 freq score-in (3) - 2 freq soorlike (3) - 1 freq shielin (3) - 1 freq |
shoreline (0) - 4 freq shorelin (1) - 2 freq shore-line (2) - 1 freq shovelin (3) - 2 freq storyline (3) - 5 freq shielin (4) - 1 freq shrine (4) - 12 freq sharlie (4) - 1 freq whorlin (4) - 1 freq shorin (4) - 1 freq shooglin (4) - 17 freq sharein (4) - 1 freq sheerlin (4) - 3 freq sworlin (4) - 1 freq shouglin (4) - 2 freq shooerin (4) - 2 freq shortlie (4) - 1 freq shortlins (4) - 1 freq shuirlie (5) - 38 freq charlene (5) - 519 freq sherpin (5) - 1 freq snarlene (5) - 1 freq shullin (5) - 3 freq whurlin (5) - 1 freq whirlin (5) - 5 freq |
SoundEx code - S645 swirlin - 21 freq skirlin - 48 freq scrollin - 6 freq scrollin' - 1 freq shorelin - 2 freq surlin - 1 freq shore-line - 1 freq sworlin - 1 freq sirloin - 7 freq sheerlin - 3 freq skirlan - 1 freq shoreline - 4 freq swirlan - 2 freq shirley-anne - 2 freq skirling - 1 freq swurlin - 1 freq swirling - 2 freq scorland - 1 freq sharleen - 1 freq 'sharleen - 1 freq |
MetaPhone code - XRLN chirlin - 1 freq shorelin - 2 freq shore-line - 1 freq charlene - 519 freq charlene' - 1 freq charlen - 1 freq sheerlin - 3 freq shoreline - 4 freq shirley-anne - 2 freq sharleen - 1 freq 'sharleen - 1 freq |
SHORELINE |
| Time to execute Levenshtein function - 0.555076 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.776529 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.046787 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.045332 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.000934 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. |