| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vanguard (0) - 5 freq vangaird (2) - 1 freq guard (3) - 38 freq januar (3) - 34 freq haggard (3) - 1 freq languid (3) - 2 freq landward (3) - 6 freq vineyard (3) - 7 freq tankard (3) - 1 freq jaguar (3) - 2 freq languag (3) - 1 freq gangand (3) - 1 freq hansard (3) - 3 freq angular (3) - 1 freq language (3) - 1414 freq safeguard (3) - 1 freq ianuare (3) - 1 freq lanyard (3) - 1 freq january (3) - 66 freq oanward (3) - 1 freq sangam (4) - 1 freq vonnsand (4) - 1 freq dangers (4) - 11 freq gangotri (4) - 1 freq ainward (4) - 4 freq |
vanguard (0) - 5 freq vangaird (2) - 1 freq vineyard (4) - 7 freq vineyaird (5) - 9 freq safeguard (5) - 1 freq angered (5) - 2 freq oanward (5) - 1 freq vinegary (5) - 1 freq vinegar (5) - 18 freq ventured (5) - 9 freq fingerd (5) - 1 freq hansard (5) - 3 freq lanyard (5) - 1 freq vinyaird (5) - 3 freq tankard (5) - 1 freq gangand (5) - 1 freq haggard (5) - 1 freq languid (5) - 2 freq guard (5) - 38 freq bangers (6) - 3 freq angert (6) - 16 freq wangled (6) - 1 freq fingered (6) - 1 freq unheard (6) - 7 freq venturt (6) - 8 freq |
SoundEx code - V526 vinegar - 18 freq vanguard - 5 freq vincher - 1 freq vennacher - 2 freq veenegar - 1 freq veinegar - 1 freq vncorrupte - 1 freq venacher - 1 freq vpnzrppnsb - 1 freq vangaird - 1 freq vinegary - 1 freq |
MetaPhone code - FNKRT vanguard - 5 freq vangaird - 1 freq |
VANGUARD |
| Time to execute Levenshtein function - 0.206986 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.347006 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.027248 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.037093 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.000845 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. |