| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| victim (0) - 29 freq veictim (1) - 1 freq victims (1) - 10 freq pictir (2) - 19 freq dictum (2) - 1 freq vicki (2) - 23 freq veectim (2) - 3 freq picti (2) - 3 freq yintim (2) - 1 freq vici (2) - 1 freq victor (2) - 34 freq evictit (2) - 1 freq vickie (2) - 1 freq bicaim (2) - 4 freq victrie (2) - 1 freq siccin (3) - 2 freq tiltin (3) - 6 freq hintin (3) - 4 freq bizzim (3) - 1 freq becaim (3) - 2 freq vit (3) - 3 freq sistem (3) - 1 freq sintit (3) - 3 freq wintin (3) - 52 freq victoria (3) - 27 freq |
victim (0) - 29 freq veictim (1) - 1 freq victims (2) - 10 freq veectim (2) - 3 freq victor (3) - 34 freq dictum (3) - 1 freq victrie (3) - 1 freq evictit (3) - 1 freq evict (4) - 2 freq victory (4) - 44 freq eviction (4) - 2 freq vacuum (4) - 5 freq evicted (4) - 2 freq veectims (4) - 2 freq victual (4) - 1 freq victoria (4) - 27 freq vaccum (4) - 1 freq victorie (4) - 9 freq vcm (4) - 1 freq bicaim (4) - 4 freq yintim (4) - 1 freq vici (4) - 1 freq vickie (4) - 1 freq vicki (4) - 23 freq picti (4) - 3 freq |
SoundEx code - V235 veesitin - 31 freq vexation - 5 freq veisitin - 4 freq victimised - 1 freq victim - 29 freq victims - 10 freq 'visitin - 1 freq veectim - 3 freq vestments - 1 freq veeseeten - 1 freq vacation - 2 freq vocation - 2 freq visitin - 22 freq visiting - 15 freq vestenfraa - 1 freq vastness - 1 freq veectims - 2 freq veictim - 1 freq €”veesitin - 1 freq vkdmxomjbp - 1 freq visitn - 1 freq |
MetaPhone code - FKTM victim - 29 freq veectim - 3 freq veictim - 1 freq |
VICTIM |
| Time to execute Levenshtein function - 0.295491 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.565807 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.037643 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.069322 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.000814 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. |