| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| skarcelins (0) - 5 freq scarcelins (1) - 5 freq searecelins (2) - 1 freq saucepins (3) - 1 freq starlins (3) - 1 freq faircelins (3) - 1 freq skarcement (3) - 1 freq skantlins (3) - 1 freq barelins (3) - 1 freq barnekins (4) - 1 freq skreivins (4) - 1 freq sharpenin (4) - 3 freq starklin (4) - 1 freq 'barcelona (4) - 1 freq scarcely (4) - 4 freq truelins (4) - 4 freq sharein (4) - 1 freq hamelins (4) - 1 freq shortlins (4) - 1 freq faceline (4) - 2 freq staelin (4) - 1 freq darklins (4) - 1 freq searchin (4) - 26 freq shauchlin (4) - 10 freq scrievins (4) - 19 freq |
skarcelins (0) - 5 freq scarcelins (2) - 5 freq searecelins (3) - 1 freq skantlins (5) - 1 freq skarcement (5) - 1 freq faircelins (5) - 1 freq starlins (5) - 1 freq skirling (6) - 1 freq stirlins (6) - 1 freq shortlins (6) - 1 freq skirteens (6) - 1 freq skirtins (6) - 1 freq skreivins (6) - 1 freq saucepins (6) - 1 freq barelins (6) - 1 freq skirlin (6) - 48 freq sparklin' (7) - 1 freq startling (7) - 1 freq spallins (7) - 1 freq marcel's (7) - 1 freq skelpins (7) - 1 freq saplins (7) - 2 freq searching (7) - 2 freq sparkling (7) - 3 freq skailin' (7) - 1 freq |
SoundEx code - S624 seriously - 72 freq skyrie-seelent - 1 freq scrauchles - 2 freq serious-like - 2 freq scrauchle - 4 freq screws'll - 1 freq sircul - 1 freq seriouslee - 1 freq square-sailed - 1 freq sairiously - 8 freq sarky-lookin - 1 freq scargill - 3 freq searchlights - 2 freq scarcely - 4 freq skarcelins - 5 freq sirkil - 1 freq syer-cloot - 1 freq scragland - 1 freq squaresail - 1 freq scarcelins - 5 freq searecelins - 1 freq sairious-like - 1 freq sairiouslie - 1 freq sairiouslik - 1 freq scrauchlin - 1 freq scrauchlet - 2 freq seriouslie - 2 freq searchlight - 1 freq squerr-slice - 1 freq |
MetaPhone code - SKRSLNS skarcelins - 5 freq scarcelins - 5 freq |
SKARCELINS |
| Time to execute Levenshtein function - 0.205220 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.366376 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.027637 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.036670 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.000837 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. |