| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| veeseeten (0) - 1 freq veesited (3) - 7 freq veesitin (3) - 31 freq eeleeven (3) - 1 freq veesiter (3) - 1 freq reeseeved (3) - 1 freq seeventeen (4) - 7 freq meercetin (4) - 6 freq serten (4) - 4 freq owersetten (4) - 7 freq meenester (4) - 8 freq 'seeven (4) - 2 freq besseen (4) - 1 freq needlemen (4) - 1 freq veesion (4) - 25 freq feeleen (4) - 3 freq deseen (4) - 1 freq pesteren (4) - 1 freq besotten (4) - 1 freq beseekin (4) - 2 freq veesible (4) - 4 freq festen (4) - 1 freq deester (4) - 2 freq densemen (4) - 1 freq leemeets (4) - 1 freq |
veeseeten (0) - 1 freq veesitin (3) - 31 freq veisitin (4) - 4 freq veesiter (4) - 1 freq veesited (4) - 7 freq vested (5) - 2 freq veesit (5) - 93 freq festen (5) - 1 freq visitin (5) - 22 freq veisited (5) - 3 freq jeestin (5) - 1 freq reestin (5) - 1 freq visitn (5) - 1 freq vreiten (5) - 1 freq veesitit (5) - 8 freq leisten (5) - 3 freq veesitor (5) - 21 freq vreetin (5) - 2 freq veesion (5) - 25 freq neisten (5) - 1 freq veesitur (5) - 1 freq veesits (5) - 15 freq vestit (6) - 1 freq resettin (6) - 1 freq veesitation (6) - 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 - FSTN veesitin - 31 freq face-doon - 2 freq veisitin - 4 freq face-doun - 3 freq feastin - 17 freq fastin - 14 freq 'visitin - 1 freq veeseeten - 1 freq fasten - 2 freq visitin - 22 freq fisten - 1 freq festen - 1 freq faestin - 2 freq faisten - 1 freq €”veesitin - 1 freq visitn - 1 freq fistin - 1 freq |
VEESEETEN |
| Time to execute Levenshtein function - 0.203252 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.350522 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.027203 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.038217 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.000917 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. |