| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| serialise (0) - 1 freq socialise (2) - 9 freq socialised (3) - 1 freq specialises (3) - 1 freq materialise (3) - 2 freq equalise (3) - 4 freq moralise (3) - 1 freq gervaise (3) - 1 freq specialised (3) - 2 freq seillie (3) - 2 freq normalise (3) - 4 freq realise (3) - 107 freq fertilise (3) - 3 freq specialist (3) - 11 freq seilie (3) - 6 freq seiklie (3) - 1 freq serial (3) - 3 freq socialism (3) - 21 freq speecialise (3) - 1 freq servaice (3) - 1 freq reealise (3) - 1 freq herbalist (3) - 1 freq socialist (3) - 16 freq selkse (4) - 1 freq erline (4) - 1 freq |
serialise (0) - 1 freq socialise (3) - 9 freq reealise (4) - 1 freq realise (4) - 107 freq moralise (4) - 1 freq serial (4) - 3 freq trials (5) - 18 freq socialist (5) - 16 freq railise (5) - 1 freq seals (5) - 22 freq beirials (5) - 1 freq serious (5) - 152 freq beerials (5) - 4 freq burials (5) - 1 freq socials (5) - 3 freq cereals (5) - 2 freq serius (5) - 1 freq surmise (5) - 3 freq perils (5) - 2 freq borealis (5) - 2 freq raelise (5) - 4 freq seillie (5) - 2 freq fertilise (5) - 3 freq sairlie (5) - 6 freq series (5) - 86 freq |
SoundEx code - S642 skirls - 16 freq square-lookin - 1 freq sherlock - 7 freq squirrels - 19 freq scrolls - 6 freq scurrilous - 2 freq soar-lik - 1 freq soorlike - 1 freq 'squirrels - 1 freq swirls - 7 freq surrealism - 2 freq sairless - 1 freq square-lickly - 1 freq scurls - 1 freq soor-lukkan - 1 freq skerls - 3 freq serialise - 1 freq surrealist - 1 freq sweir-like - 1 freq skirls'll - 1 freq skroils - 1 freq surreywallcreep - 1 freq |
MetaPhone code - SRLS sairless - 1 freq cereals - 2 freq serialise - 1 freq yzrls - 1 freq |
SERIALISE |
| Time to execute Levenshtein function - 0.244221 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.418221 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.033569 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.042338 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.000809 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. |