Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
itssel (0) - 15 freq itsel (1) - 466 freq itsself (1) - 1 freq itsael (1) - 1 freq issel (1) - 1 freq russel (2) - 3 freq tassel (2) - 2 freq itsell (2) - 16 freq essel (2) - 1 freq itsel' (2) - 2 freq mussel (2) - 1 freq ir-sel (2) - 2 freq massel (2) - 40 freq vessel (2) - 7 freq hissel (2) - 371 freq irsel (2) - 2 freq hessel (2) - 9 freq wissel (2) - 1 freq itvel (2) - 1 freq hitsel (2) - 13 freq missel (2) - 1 freq idsel (2) - 3 freq itself (2) - 23 freq imsel (2) - 29 freq tossel (2) - 1 freq |
itssel (0) - 15 freq tassel (2) - 2 freq issel (2) - 1 freq tossel (2) - 1 freq itsael (2) - 1 freq itsself (2) - 1 freq itsel (2) - 466 freq hissel (3) - 371 freq wissel (3) - 1 freq tissil (3) - 1 freq vessel (3) - 7 freq missel (3) - 1 freq hessel (3) - 9 freq massel (3) - 40 freq essel (3) - 1 freq mussel (3) - 1 freq russel (3) - 3 freq itsell (3) - 16 freq tsl (4) - 2 freq tosses (4) - 3 freq o'issel (4) - 1 freq ssl (4) - 1 freq tosser (4) - 2 freq tss (4) - 2 freq tossels (4) - 1 freq |
SoundEx code - I324 itsel - 466 freq itsell - 16 freq itself - 23 freq itssel - 15 freq itsel' - 2 freq itsilkaday - 1 freq itsael - 1 freq idsell - 11 freq idsel - 3 freq itsself - 1 freq itsjuliahardy - 10 freq |
MetaPhone code - ITSL itsel - 466 freq itsell - 16 freq itssel - 15 freq itsel' - 2 freq itsael - 1 freq idsell - 11 freq idsel - 3 freq |
ITSSEL |
Time to execute Levenshtein function - 0.211326 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.357265 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.028537 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.039226 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.001122 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. |