Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ivrything (0) - 4 freq iverything (1) - 1 freq ivrythin (1) - 3 freq ivvrything (1) - 1 freq ivirything (1) - 6 freq evryhing (2) - 1 freq iverthing (2) - 1 freq ivrythin's (2) - 1 freq vrythin (2) - 1 freq ivirythin (2) - 2 freq erything (2) - 1 freq ivvrythin (2) - 1 freq iverythin (2) - 14 freq everything (2) - 96 freq onything (3) - 212 freq oanything (3) - 1 freq evryhin (3) - 2 freq everythin (3) - 113 freq everythin' (3) - 1 freq ivriethin (3) - 3 freq ivirithin (3) - 1 freq i'thing (3) - 4 freq plaything (3) - 1 freq ivverythin (3) - 3 freq anything (3) - 137 freq |
ivrything (0) - 4 freq ivirything (1) - 6 freq iverything (1) - 1 freq iverthing (2) - 1 freq ivrythin (2) - 3 freq everything (2) - 96 freq ivvrything (2) - 1 freq iverythin (3) - 14 freq erything (3) - 1 freq vrythin (3) - 1 freq ivirythin (3) - 2 freq evryhing (3) - 1 freq ivriethin (4) - 3 freq ivirithin (4) - 1 freq everythins (4) - 3 freq everyhing (4) - 14 freq everythin' (4) - 1 freq ivrytheen (4) - 1 freq everythin (4) - 113 freq ivrythin's (4) - 1 freq ivvrythin (4) - 1 freq everthin (5) - 2 freq iveriethin (5) - 13 freq everthings (5) - 1 freq breathing (5) - 15 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 |
IVRYTHING |
Time to execute Levenshtein function - 0.241685 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.409112 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.028345 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.036785 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.000784 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. |