| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| iverywye (0) - 1 freq everywye (1) - 2 freq iverywan (2) - 1 freq ivryone (3) - 2 freq iveree (3) - 7 freq iverdey (3) - 1 freq iverywhar (3) - 2 freq itherwye (3) - 1 freq everyone (3) - 96 freq iverywhere (3) - 1 freq ivertyme (3) - 1 freq iverrie (3) - 1 freq iverie (3) - 73 freq everywan (3) - 22 freq ivrywan (3) - 7 freq iveryday (3) - 4 freq ivery (3) - 188 freq everyane (3) - 1 freq iverywhur (3) - 1 freq verde (4) - 2 freq verse (4) - 134 freq evrywan (4) - 1 freq very (4) - 698 freq everday (4) - 2 freq overty (4) - 1 freq |
iverywye (0) - 1 freq everywye (1) - 2 freq iverywan (3) - 1 freq iverie (4) - 73 freq iverrie (4) - 1 freq everywan (4) - 22 freq everyane (4) - 1 freq overaw (4) - 3 freq ivery (4) - 188 freq iveryday (4) - 4 freq ivrywan (4) - 7 freq iveree (4) - 7 freq iverdey (4) - 1 freq ivryone (4) - 2 freq everyone (4) - 96 freq vertie (5) - 1 freq overuse (5) - 1 freq verve (5) - 2 freq aiverie (5) - 3 freq verie (5) - 23 freq ivryday (5) - 5 freq veritie (5) - 3 freq verity (5) - 2 freq ivrey (5) - 1 freq average (5) - 29 freq |
SoundEx code - I160 ivver - 276 freq iver - 312 freq ivvery - 74 freq ivry - 124 freq ivvry - 20 freq ivery - 188 freq iviry - 56 freq ivir - 33 freq iverie - 73 freq ivrie - 5 freq ivory - 8 freq iveree - 7 freq ivverie - 25 freq iper - 7 freq i'very - 1 freq iv'ry - 1 freq iwver - 1 freq ivverrie - 1 freq ivor - 19 freq i'beer - 1 freq i'bear - 1 freq i'braw - 1 freq ivur - 2 freq ivvri - 9 freq iverywye - 1 freq iberia - 1 freq iverrie - 1 freq ivvir - 6 freq €œivery - 1 freq iffer - 1 freq iffery - 1 freq ivree - 1 freq ivr - 1 freq ivrey - 1 freq |
MetaPhone code - IFRY iverywye - 1 freq |
IVERYWYE |
| Time to execute Levenshtein function - 0.326613 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.571301 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.041015 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.059852 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.000909 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. |