| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| valenbisi (0) - 1 freq vaelensi (3) - 2 freq vaclensi (3) - 1 freq valencia (3) - 8 freq valencian (3) - 6 freq valentino (3) - 1 freq valentine (3) - 23 freq valencià (3) - 1 freq alibis (4) - 2 freq valantine (4) - 1 freq vainist (4) - 1 freq valais (4) - 1 freq valencia's (4) - 2 freq valencians (4) - 1 freq varnish (4) - 6 freq maleness (4) - 1 freq talents (4) - 15 freq vainish (4) - 9 freq vales (4) - 4 freq haleness (4) - 1 freq talent's (4) - 1 freq valentines (4) - 8 freq plenish (4) - 6 freq lenish (4) - 1 freq parentis (4) - 6 freq |
valenbisi (0) - 1 freq vaelensi (4) - 2 freq valentino (5) - 1 freq valencian (5) - 6 freq valentine (5) - 23 freq valencia (5) - 8 freq vaclensi (5) - 1 freq vales (6) - 4 freq talents (6) - 15 freq haleness (6) - 1 freq valentines (6) - 8 freq valencians (6) - 1 freq valence's (6) - 1 freq maleness (6) - 1 freq valantine (6) - 1 freq alibis (6) - 2 freq valais (6) - 1 freq valencia's (6) - 2 freq valencià (6) - 1 freq wileness (7) - 1 freq slebs (7) - 1 freq relents (7) - 3 freq sylinsis (7) - 1 freq walings (7) - 2 freq venus (7) - 32 freq |
SoundEx code - V451 volumptuous - 1 freq valenbisi - 1 freq |
MetaPhone code - FLNBS valenbisi - 1 freq |
VALENBISI |
| Time to execute Levenshtein function - 0.213416 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.395887 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.027704 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.037787 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.000909 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. |