| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vreetins (0) - 1 freq vreetin (1) - 2 freq vreetin' (1) - 1 freq greetins (1) - 7 freq oreegins (2) - 2 freq greeting (2) - 13 freq greetings (2) - 2 freq greetin (2) - 366 freq breetin (2) - 1 freq greetin' (2) - 9 freq greetin's (2) - 1 freq oreetin (2) - 1 freq breeties (2) - 1 freq meetins (2) - 16 freq creetics (2) - 5 freq vreitin (2) - 1 freq seeins (3) - 2 freq 'greetin' (3) - 1 freq feerins (3) - 1 freq vreet (3) - 1 freq greets (3) - 25 freq breeding (3) - 1 freq greein (3) - 3 freq reekin (3) - 45 freq feelins (3) - 76 freq |
vreetins (0) - 1 freq vreetin' (2) - 1 freq greetins (2) - 7 freq vreetin (2) - 2 freq vreitin (3) - 1 freq vreiten (4) - 1 freq retains (4) - 4 freq bretons (4) - 4 freq pretens (4) - 1 freq vreits (4) - 1 freq variations (4) - 16 freq retinas (4) - 1 freq creations (4) - 3 freq treatens (4) - 1 freq gratins (4) - 1 freq varieties (4) - 43 freq mertins (4) - 2 freq writins (4) - 9 freq greetin's (4) - 1 freq greeting (4) - 13 freq oreetin (4) - 1 freq greetings (4) - 2 freq greetin' (4) - 9 freq breetin (4) - 1 freq greetin (4) - 366 freq |
SoundEx code - V635 variations - 16 freq variation - 18 freq verdean - 3 freq verdant - 7 freq vreetin' - 1 freq vreetin - 2 freq vritten - 3 freq variautiouns - 1 freq vvreitin - 1 freq vreitin - 1 freq vreiten - 1 freq vrutten - 5 freq vrythin - 1 freq vreetins - 1 freq virtanen - 1 freq |
MetaPhone code - FRTNS feartiness - 1 freq fortun's - 1 freq fortunes - 7 freq fartin's - 1 freq vreetins - 1 freq fardins - 1 freq |
VREETINS |
| Time to execute Levenshtein function - 0.352209 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.398179 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.028392 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.037628 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.001004 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. |