| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| salyerites (0) - 1 freq samarites (3) - 1 freq galleries (3) - 8 freq salaries (3) - 3 freq ayerit (4) - 1 freq sillerie (4) - 15 freq fulyerie (4) - 1 freq favourites (4) - 27 freq sayrious (4) - 1 freq albert's (4) - 2 freq galleried (4) - 1 freq valkyries (4) - 1 freq arteries (4) - 5 freq sprites (4) - 2 freq valerie (4) - 4 freq fasheries (4) - 1 freq galeries' (4) - 1 freq batteries (4) - 8 freq leeries (4) - 6 freq sculleries (4) - 1 freq salopettes (4) - 1 freq sclytes (4) - 1 freq allergies (4) - 2 freq saerious (4) - 1 freq preterites (4) - 2 freq |
salyerites (0) - 1 freq salaries (4) - 3 freq samarites (4) - 1 freq sprites (5) - 2 freq speerits (5) - 18 freq asperities (5) - 1 freq blairites (5) - 1 freq sauler's (6) - 1 freq saeperit (6) - 6 freq streits (6) - 2 freq saegates (6) - 1 freq alerted (6) - 2 freq solkits (6) - 3 freq satellites (6) - 7 freq saltires (6) - 6 freq calories (6) - 11 freq saeperate (6) - 2 freq salaried (6) - 2 freq laureates (6) - 1 freq separates (6) - 4 freq slayers (6) - 2 freq slates (6) - 53 freq saulers (6) - 1 freq asserts (6) - 1 freq sacrets (6) - 1 freq |
SoundEx code - S463 siller-reid - 1 freq slairt - 1 freq scholard - 2 freq slairit - 2 freq sillert - 1 freq schuilyairds - 1 freq shouler-taeshouler - 1 freq scholards - 3 freq scholarts - 1 freq sclarriet - 1 freq slurred - 7 freq sillerweed - 1 freq schuilyaird - 1 freq slawards - 1 freq sillered - 1 freq scullerty-hungerties - 1 freq salyerites - 1 freq salaried - 2 freq |
MetaPhone code - SLYRTS salyerites - 1 freq |
SALYERITES |
| Time to execute Levenshtein function - 0.202054 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.422568 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.029291 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.044947 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.000902 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. |