| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| esslemont (0) - 3 freq easement (3) - 9 freq element (3) - 45 freq elemints (4) - 1 freq inclement (4) - 3 freq rosemount (4) - 4 freq 'seemon' (4) - 1 freq gesserant (4) - 1 freq lemon (4) - 23 freq basement (4) - 9 freq summont (4) - 2 freq lamont (4) - 8 freq silent (4) - 144 freq solemn (4) - 25 freq assent (4) - 2 freq mcclymont (4) - 3 freq salmond (4) - 24 freq excrement (4) - 2 freq stormont (4) - 7 freq exitement (4) - 2 freq aisement (4) - 2 freq implement (4) - 10 freq lemons (4) - 2 freq belmont (4) - 6 freq asclent (4) - 1 freq |
esslemont (0) - 3 freq element (5) - 45 freq easement (5) - 9 freq bellement (6) - 3 freq soleman (6) - 2 freq asklent (6) - 8 freq salmon (6) - 46 freq belmont (6) - 6 freq implement (6) - 10 freq solomon (6) - 32 freq asclent (6) - 1 freq sklent (6) - 31 freq twalmont (6) - 1 freq stelment (6) - 1 freq assailant (6) - 1 freq solempt (6) - 1 freq solomons (6) - 2 freq casement (6) - 3 freq aisement (6) - 2 freq settlement (6) - 17 freq sleent (6) - 1 freq silent (6) - 144 freq solemn (6) - 25 freq lamont (6) - 8 freq basement (6) - 9 freq |
SoundEx code - E245 exclaimt - 24 freq exclaimed - 36 freq exclamation - 4 freq exclaims - 4 freq excellence' - 2 freq excellence - 25 freq exclaimit - 1 freq exclaimations - 1 freq exclaim - 7 freq exhalin - 1 freq excellent - 28 freq exclaimin - 1 freq esquiline - 1 freq exclamaetion - 1 freq eaglewaang - 1 freq easslin - 1 freq esh-lance - 1 freq eglon - 1 freq exclamations - 1 freq esslemont - 3 freq excelling - 1 freq echelons - 1 freq €˜excellent - 2 freq exclaimet - 1 freq |
MetaPhone code - ESLMNT esslemont - 3 freq |
ESSLEMONT |
| Time to execute Levenshtein function - 0.222642 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.385139 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.027929 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.038760 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.000920 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. |