Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
everything (0) - 96 freq iverything (1) - 1 freq everythin' (1) - 1 freq everyhing (1) - 14 freq everythins (1) - 3 freq everythin (1) - 113 freq everything's (2) - 3 freq evryhing (2) - 1 freq ivvrything (2) - 1 freq ivirything (2) - 6 freq €™everything (2) - 1 freq iverthing (2) - 1 freq every'hin' (2) - 1 freq everthin (2) - 2 freq €œeverything (2) - 2 freq iverythin (2) - 14 freq erything (2) - 1 freq everthings (2) - 1 freq everythin's (2) - 3 freq ivrything (2) - 4 freq everyhin (2) - 30 freq vrythin (3) - 1 freq ivirythin (3) - 2 freq everything'll (3) - 1 freq evryhin (3) - 2 freq |
everything (0) - 96 freq iverything (1) - 1 freq ivrything (2) - 4 freq iverthing (2) - 1 freq everythin (2) - 113 freq ivirything (2) - 6 freq everythin' (2) - 1 freq everythins (2) - 3 freq everyhing (2) - 14 freq everthin (3) - 2 freq everthings (3) - 1 freq ivvrything (3) - 1 freq evryhing (3) - 1 freq erything (3) - 1 freq iverythin (3) - 14 freq everyhin (4) - 30 freq ivirythin (4) - 2 freq ivrythin (4) - 3 freq vrythin (4) - 1 freq €œeverything (4) - 2 freq everythin's (4) - 3 freq €™everything (4) - 1 freq every'hin' (4) - 1 freq everything's (4) - 3 freq ivvrythin (5) - 1 freq |
SoundEx code - E163 everything - 96 freq efforts - 50 freq everythin - 113 freq everythin's - 3 freq everytime - 10 freq effort - 99 freq everywhaut - 1 freq everyday - 32 freq everything's - 3 freq everday - 2 freq eupboards - 1 freq effert - 1 freq effirt - 3 freq everything'll - 1 freq effart - 1 freq everyday' - 1 freq ever-decreasing - 1 freq €œeveryday - 2 freq effortlessly - 4 freq everthin - 2 freq €œeverything - 2 freq everythin' - 1 freq €™everything - 1 freq eberdeen - 3 freq evertype - 2 freq everthings - 1 freq efforts' - 1 freq everythins - 3 freq everton - 3 freq everydaysaschoolday - 1 freq |
MetaPhone code - EFR0NK everything - 96 freq €œeverything - 2 freq €™everything - 1 freq |
EVERYTHING |
Time to execute Levenshtein function - 0.217775 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.347754 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.028942 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.037624 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.000829 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. |