| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| itself (0) - 23 freq itsel (1) - 476 freq itsell (1) - 16 freq itsself (1) - 1 freq itsel' (1) - 3 freq hitsel (2) - 13 freq issel (2) - 1 freq hpself (2) - 1 freq himself (2) - 99 freq yeself (2) - 1 freq imsel (2) - 29 freq maself (2) - 21 freq hizself (2) - 1 freq meself (2) - 2 freq itssel (2) - 15 freq self (2) - 93 freq irsels (2) - 1 freq irsel (2) - 2 freq hisself (2) - 3 freq itvel (2) - 1 freq idsel (2) - 3 freq yirself (2) - 5 freq idsell (2) - 11 freq itsael (2) - 1 freq myself (2) - 47 freq |
itself (0) - 23 freq itsel' (2) - 3 freq itsself (2) - 1 freq itsel (2) - 476 freq itsell (2) - 16 freq meself (3) - 2 freq myself (3) - 47 freq yirself (3) - 5 freq maself (3) - 21 freq itsael (3) - 1 freq self (3) - 93 freq yeself (3) - 1 freq yerself (4) - 17 freq idsel (4) - 3 freq oneself (4) - 1 freq thyself (4) - 1 freq itvel (4) - 1 freq yurself (4) - 3 freq tsl (4) - 2 freq idsell (4) - 11 freq himself (4) - 99 freq hizself (4) - 1 freq issel (4) - 1 freq imsel (4) - 29 freq hitsel (4) - 13 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 - ITSLF itself - 23 freq itsself - 1 freq |
ITSELF itsel - 476 freq itself - 23 freq itsell - 16 freq hitsel - 13 freq |
| Time to execute Levenshtein function - 0.207456 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.373583 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.030336 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.038509 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.001024 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. |