| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sweirt-like (0) - 1 freq sweir-like (1) - 1 freq swift-like (2) - 3 freq smert-like (2) - 3 freq weird-like (2) - 2 freq swith-like (3) - 1 freq wirm-like (3) - 1 freq shairp-like (3) - 1 freq whit-like (3) - 1 freq sherp-like (3) - 2 freq steive-like (3) - 4 freq smert-lyke (3) - 1 freq sweirtie (3) - 2 freq smertlike (3) - 1 freq feart-like (3) - 1 freq sleikit-lik (4) - 1 freq still-like (4) - 1 freq quiet-like (4) - 5 freq gleyt-like (4) - 1 freq tent-like (4) - 1 freq roit-like (4) - 1 freq worrit-like (4) - 4 freq saft-like (4) - 1 freq snaar-like (4) - 1 freq sneistie-like (4) - 2 freq |
sweirt-like (0) - 1 freq sweir-like (2) - 1 freq smert-like (3) - 3 freq swift-like (3) - 3 freq smert-lyke (4) - 1 freq weird-like (4) - 2 freq smertlike (5) - 1 freq swith-like (5) - 1 freq sherp-like (5) - 2 freq feart-like (5) - 1 freq wirm-like (5) - 1 freq shairp-like (5) - 1 freq whit-like (5) - 1 freq angirt-lik (6) - 1 freq whit-lik (6) - 1 freq swack-like (6) - 1 freq separate-like (6) - 2 freq swippert-like (6) - 4 freq owre-like (6) - 1 freq shairp-lik (6) - 1 freq warm-like (6) - 1 freq sojer-like (6) - 1 freq saut-like (6) - 1 freq angert-like (6) - 1 freq saft-like (6) - 1 freq |
SoundEx code - S634 shortly - 33 freq short-leeved - 1 freq sweirt-like - 1 freq sky-hurtlin - 1 freq shortlisted - 1 freq shrewdly - 1 freq short-lived - 3 freq sort'll - 1 freq shoartly - 2 freq shortlie - 1 freq shirtlifter - 1 freq scorriedale - 1 freq shortlins - 1 freq scartlin - 1 freq schortly - 2 freq short-leetit - 1 freq scartled - 1 freq scrittlin - 1 freq shirt'll - 1 freq shirtll - 1 freq shortlist - 1 freq shortlists - 1 freq shortlistit - 1 freq shortleesa - 2 freq |
MetaPhone code - SWRTLK sweirt-like - 1 freq |
SWEIRT-LIKE |
| Time to execute Levenshtein function - 0.243906 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.430723 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.028228 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.039816 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.000923 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. |