| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vincent (0) - 4 freq diacent (2) - 1 freq vincust (2) - 1 freq invent (2) - 11 freq intent (2) - 37 freq incest (2) - 3 freq violent (2) - 18 freq vixen (3) - 1 freq cancelt (3) - 3 freq rinnen (3) - 4 freq vines (3) - 6 freq pincht (3) - 3 freq minen (3) - 1 freq ailment (3) - 2 freq fient (3) - 6 freq pinpint (3) - 1 freq dacent (3) - 14 freq aipent (3) - 1 freq concernt (3) - 15 freq intend (3) - 10 freq wincin (3) - 1 freq unkent (3) - 51 freq discernt (3) - 1 freq winces (3) - 3 freq wince (3) - 5 freq |
vincent (0) - 4 freq vincust (3) - 1 freq vacant (4) - 8 freq innocent (4) - 37 freq eenocent (4) - 2 freq viscount (4) - 2 freq auncient (4) - 74 freq ancient (4) - 109 freq intent (4) - 37 freq incest (4) - 3 freq invent (4) - 11 freq violent (4) - 18 freq diacent (4) - 1 freq convent (5) - 3 freq liniment (5) - 1 freq oonkent (5) - 2 freq vinland (5) - 2 freq tennent (5) - 2 freq inyect (5) - 1 freq raecent (5) - 3 freq reinvent (5) - 3 freq pinnet (5) - 1 freq vance (5) - 6 freq vincher (5) - 1 freq daicent (5) - 60 freq |
SoundEx code - V525 vincent - 4 freq vainishin - 4 freq vengeance - 11 freq vanishin - 5 freq vengaunce - 1 freq vengin - 1 freq vengeaunce - 3 freq venison - 2 freq vanishing - 1 freq vanishan - 1 freq vnknawin - 1 freq vonnsand - 1 freq |
MetaPhone code - FNSNT vincent - 4 freq vonnsand - 1 freq |
VINCENT |
| Time to execute Levenshtein function - 0.213970 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.372975 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.027858 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.037924 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.000895 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. |