| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ivirything (0) - 6 freq ivrything (1) - 4 freq ivvrything (1) - 1 freq ivirythin (1) - 2 freq iverything (1) - 1 freq ivirithin (2) - 1 freq ivvrythin (2) - 1 freq everything (2) - 96 freq iverthing (2) - 1 freq iverythin (2) - 14 freq ivrythin (2) - 3 freq everythin (3) - 113 freq iverythin's (3) - 2 freq everyhing (3) - 14 freq everythins (3) - 3 freq ivverythin (3) - 3 freq erything (3) - 1 freq vrythin (3) - 1 freq everythin' (3) - 1 freq evryhing (3) - 1 freq ivrythin's (3) - 1 freq inviting (4) - 3 freq iverthin's (4) - 1 freq birthin (4) - 6 freq €œeverything (4) - 2 freq |
ivirything (0) - 6 freq ivrything (1) - 4 freq iverything (1) - 1 freq everything (2) - 96 freq ivirythin (2) - 2 freq iverthing (2) - 1 freq ivvrything (2) - 1 freq iverythin (3) - 14 freq ivrythin (3) - 3 freq ivirithin (3) - 1 freq vrythin (4) - 1 freq erything (4) - 1 freq everythin' (4) - 1 freq evryhing (4) - 1 freq ivvrythin (4) - 1 freq everythins (4) - 3 freq everythin (4) - 113 freq everyhing (4) - 14 freq everthings (5) - 1 freq everthin (5) - 2 freq ivrytheen (5) - 1 freq iveriethin (5) - 13 freq ivriethin (5) - 3 freq ivverythin (5) - 3 freq iverythin's (5) - 2 freq |
SoundEx code - I163 ivverythin - 3 freq ivrything - 4 freq ivrythin - 3 freq iveriethin - 13 freq ivryday - 5 freq ivver--decreasin - 1 freq ivertyme - 1 freq iverythin - 14 freq iverthin's - 1 freq iverythin's - 2 freq iveriethin's - 1 freq ivirything - 6 freq ivveriethin - 1 freq ivrytheen - 1 freq iveryday - 4 freq ivirythin - 2 freq i'broad - 1 freq ivriethin - 3 freq ivver-ready - 1 freq ivvrythin - 1 freq ivvrything - 1 freq iverdey - 1 freq ivirithin - 1 freq ivrythin's - 1 freq iverthing - 1 freq ivveryithin - 1 freq iverything - 1 freq ivered - 4 freq iovayrdxz - 1 freq |
MetaPhone code - IFR0NK ivrything - 4 freq ivirything - 6 freq ivvrything - 1 freq iverthing - 1 freq iverything - 1 freq |
IVIRYTHING |
| Time to execute Levenshtein function - 0.226765 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.441005 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.040489 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.041594 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.000938 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. |