| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sellafield (0) - 1 freq seafield (2) - 7 freq millfield (3) - 2 freq bellied (4) - 3 freq enfield (4) - 7 freq renfield (4) - 2 freq settified (4) - 1 freq afield (4) - 8 freq selled (4) - 1 freq jellied (4) - 1 freq smithfield (4) - 1 freq heathfield (4) - 1 freq sheffield (4) - 3 freq caulfield (4) - 1 freq linfield (4) - 2 freq valleyfield (4) - 1 freq schofield (4) - 1 freq salaried (4) - 2 freq sallied (4) - 3 freq somerfield (4) - 5 freq skellied (4) - 2 freq southfield (4) - 1 freq yella-eed (4) - 1 freq sellie (4) - 2 freq shawfield (4) - 1 freq |
sellafield (0) - 1 freq millfield (4) - 2 freq seafield (4) - 7 freq valleyfield (5) - 1 freq linfield (6) - 2 freq caulfield (6) - 1 freq schofield (6) - 1 freq skellied (6) - 2 freq southfield (6) - 1 freq sheffield (6) - 3 freq somerfield (6) - 5 freq sallied (6) - 3 freq lea-field (6) - 1 freq selled (6) - 1 freq shawfield (6) - 1 freq fullfill (7) - 3 freq eaglesfield (7) - 1 freq solfarid (7) - 1 freq sellotaped (7) - 2 freq syllable (7) - 12 freq swallaed (7) - 34 freq sallowed (7) - 1 freq spelled (7) - 13 freq selfhood (7) - 1 freq scaffold (7) - 4 freq |
SoundEx code - S414 sleeplin - 1 freq self-labellin - 1 freq sleepless - 7 freq syllable - 12 freq self-help - 3 freq self-flagellatin - 1 freq self-belief - 3 freq skilful - 4 freq self-learnt - 1 freq skillfully - 1 freq selfless - 3 freq syllables - 8 freq syllable's - 1 freq selflessness - 1 freq skilfully - 1 freq sellafield - 1 freq sea-level - 1 freq self-loathers - 1 freq scalpels - 1 freq sleep-walkin - 3 freq sleep-walking - 1 freq sleepwalk - 1 freq sleeveless - 1 freq selflessly - 1 freq sallyblackledg - 5 freq sleepwalkers - 1 freq sluvvly - 1 freq self-fulfilling - 1 freq schoolofppls - 1 freq |
MetaPhone code - SLFLT sellafield - 1 freq |
SELLAFIELD |
| Time to execute Levenshtein function - 0.369202 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.593384 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.028597 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.089239 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.000891 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. |