| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| idsell (0) - 11 freq idsel (1) - 3 freq itsell (1) - 16 freq itself (2) - 23 freq liddell (2) - 4 freq masell (2) - 67 freq itsel (2) - 476 freq idyll (2) - 1 freq isella (2) - 1 freq mysell (2) - 2 freq iell (2) - 2 freq irsels (2) - 1 freq sell (2) - 168 freq id'll (2) - 8 freq eesell (2) - 1 freq hirsell (2) - 13 freq issel (2) - 1 freq hidsel (2) - 7 freq idsev (2) - 1 freq 'sell (2) - 1 freq indwell (2) - 1 freq dwell (2) - 11 freq hisell (2) - 2 freq idheal (2) - 1 freq itsel' (2) - 3 freq |
idsell (0) - 11 freq idsel (2) - 3 freq itsell (2) - 16 freq 'sell (3) - 1 freq eesell (3) - 1 freq hisell (3) - 2 freq id'll (3) - 8 freq mesell (3) - 2 freq yirsell (3) - 1 freq sell (3) - 168 freq dell (3) - 8 freq dwell (3) - 11 freq idyll (3) - 1 freq masell (3) - 67 freq mysell (3) - 2 freq isella (3) - 1 freq du'll (4) - 37 freq dis'll (4) - 1 freq ideally (4) - 2 freq dysel (4) - 13 freq droll (4) - 13 freq de'll (4) - 2 freq desel (4) - 4 freq dall (4) - 8 freq sall (4) - 97 freq |
SoundEx code - I324 itsel - 476 freq itsell - 16 freq itself - 23 freq itssel - 15 freq itsel' - 3 freq itsilkaday - 1 freq itsael - 1 freq idsell - 11 freq idsel - 3 freq itsself - 1 freq itsjuliahardy - 10 freq |
MetaPhone code - ITSL itsel - 476 freq itsell - 16 freq itssel - 15 freq itsel' - 3 freq itsael - 1 freq idsell - 11 freq idsel - 3 freq |
IDSELL |
| Time to execute Levenshtein function - 0.252921 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.382458 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.028797 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.039448 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.001011 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. |