Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
iseult (0) - 1 freq spult (2) - 1 freq sellt (2) - 31 freq skult (2) - 2 freq isella (2) - 1 freq selt (2) - 88 freq insult (2) - 27 freq risult (2) - 1 freq intult (2) - 1 freq sealt (2) - 2 freq assurt (3) - 1 freq 'telt (3) - 1 freq hoult (3) - 7 freq sels (3) - 7 freq sweelt (3) - 3 freq sutt (3) - 1 freq welt (3) - 2 freq stealt (3) - 4 freq sent (3) - 546 freq shut (3) - 451 freq intull (3) - 5 freq feelt (3) - 22 freq scoult (3) - 3 freq saut (3) - 122 freq speylt (3) - 3 freq |
iseult (0) - 1 freq sealt (2) - 2 freq selt (2) - 88 freq slut (3) - 5 freq silt (3) - 3 freq sailt (3) - 2 freq solt (3) - 7 freq saylt (3) - 1 freq saulit (3) - 1 freq saalt (3) - 5 freq salt (3) - 51 freq isella (3) - 1 freq skult (3) - 2 freq insult (3) - 27 freq sellt (3) - 31 freq risult (3) - 1 freq spult (3) - 1 freq beelt (4) - 1 freq sput (4) - 8 freq see't (4) - 20 freq swelt (4) - 4 freq sect (4) - 3 freq suet (4) - 9 freq haelt (4) - 3 freq gelt (4) - 1 freq |
SoundEx code - I243 isolate - 8 freq isolatit - 8 freq isolatin - 3 freq isolation - 20 freq isolde's - 2 freq isolde - 4 freq isolationist - 2 freq isolatioun - 1 freq isletas' - 1 freq i'shelter - 1 freq i'cloods - 1 freq i'clood - 1 freq i'hazleheid - 1 freq isolationists - 1 freq isolating - 1 freq isolated - 1 freq iseult - 1 freq |
MetaPhone code - ISLT isolate - 8 freq isolde - 4 freq iseult - 1 freq |
ISEULT |
Time to execute Levenshtein function - 0.211597 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.396746 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.029619 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.037975 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.000889 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. |