| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| veectim (0) - 3 freq veictim (1) - 1 freq veectims (1) - 2 freq victim (2) - 29 freq veectrie (2) - 1 freq meetin (3) - 148 freq reestit (3) - 11 freq weestie (3) - 1 freq dejectit (3) - 1 freq teetit (3) - 5 freq seechin (3) - 1 freq weechil (3) - 2 freq electit (3) - 22 freq victims (3) - 10 freq weetin (3) - 2 freq verbatim (3) - 3 freq teetin (3) - 10 freq peetie (3) - 24 freq weetie (3) - 1 freq ventir (3) - 1 freq geetin (3) - 1 freq owertim (3) - 1 freq ceetie (3) - 3 freq feection (3) - 2 freq teechis (3) - 1 freq |
veectim (0) - 3 freq veictim (1) - 1 freq victim (2) - 29 freq veectims (2) - 2 freq veectrie (3) - 1 freq victims (4) - 10 freq asectin (5) - 1 freq ectin (5) - 1 freq veet (5) - 6 freq ejectit (5) - 1 freq victrie (5) - 1 freq veesitit (5) - 8 freq deictic (5) - 1 freq reactin (5) - 6 freq vcm (5) - 1 freq erectin (5) - 1 freq veesit (5) - 93 freq reactit (5) - 2 freq overtime (5) - 2 freq victor (5) - 39 freq evictit (5) - 1 freq dictum (5) - 1 freq vaccum (5) - 1 freq vacuum (5) - 5 freq hectic (5) - 1 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 |
VEECTIM |
| Time to execute Levenshtein function - 0.228143 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.358382 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.027431 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.037867 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.000973 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. |