| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ivrywan (0) - 7 freq evrywan (1) - 1 freq iverywan (1) - 1 freq evriwan (2) - 2 freq ivryday (2) - 5 freq everywan (2) - 13 freq ivan (3) - 6 freq evryhin (3) - 2 freq anywan (3) - 22 freq ryaan (3) - 8 freq juryman (3) - 1 freq rypan (3) - 1 freq cryan (3) - 1 freq iverywye (3) - 1 freq onywan (3) - 19 freq ivryone (3) - 2 freq iran (3) - 2 freq tywan (3) - 1 freq zarkwan (3) - 4 freq ivrythin (3) - 3 freq dryan (3) - 2 freq ingrowan (3) - 1 freq irtan (3) - 1 freq divaynan (3) - 1 freq growan (3) - 24 freq |
ivrywan (0) - 7 freq iverywan (1) - 1 freq evrywan (1) - 1 freq everywan (2) - 13 freq evriwan (2) - 2 freq everwan (3) - 2 freq iviry-ean (4) - 1 freq ivryone (4) - 2 freq growan (4) - 24 freq everywhan (4) - 1 freq everywans (4) - 1 freq erowan (4) - 1 freq evriman (4) - 1 freq rowan (4) - 18 freq varyan (4) - 1 freq evryhin (4) - 2 freq iverywye (4) - 1 freq drywyn (4) - 1 freq ivryday (4) - 5 freq prawn (5) - 3 freq erowen (5) - 1 freq grawin (5) - 13 freq brown (5) - 81 freq drown (5) - 2 freq growin (5) - 237 freq |
SoundEx code - I165 ivrywan - 7 freq iverywan - 1 freq ivryone - 2 freq iver-hantin - 1 freq iver-wuntherin - 1 freq ivermair - 3 freq iviry-ean - 1 freq i'poorin - 2 freq i'firemannie - 1 freq i'fermer's - 1 freq i'bairns - 1 freq i'front - 1 freq |
MetaPhone code - IFRWN ivrywan - 7 freq iverywan - 1 freq |
IVRYWAN |
| Time to execute Levenshtein function - 0.176985 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.344500 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.031338 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.037961 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.000807 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. |