| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jacqueline (0) - 6 freq jacquline (1) - 1 freq jacquie (3) - 1 freq faceline (3) - 2 freq jacquel (3) - 3 freq masculine (4) - 3 freq adeline (4) - 2 freq acquiring (4) - 1 freq esquiline (4) - 1 freq javelin (4) - 1 freq jawline (4) - 2 freq jacques (4) - 2 freq pauline (4) - 36 freq hacquenee (4) - 1 freq madeline (4) - 1 freq acquirin (4) - 3 freq andreline (4) - 1 freq angeline (4) - 7 freq fanquine (4) - 1 freq jacqui (4) - 1 freq acquent (4) - 15 freq baseline (4) - 2 freq acquaint (4) - 3 freq javelins (4) - 4 freq acquire (4) - 3 freq |
jacqueline (0) - 6 freq jacquline (1) - 1 freq jacquel (4) - 3 freq faceline (5) - 2 freq jacquie (5) - 1 freq hacquenee (6) - 1 freq acquirin (6) - 3 freq jacqui (6) - 1 freq jawline (6) - 2 freq jacques (6) - 2 freq javelin (6) - 1 freq esquiline (6) - 1 freq jchelle (7) - 1 freq squealin (7) - 6 freq schuilin (7) - 6 freq neckline (7) - 1 freq ejaculate (7) - 1 freq celin (7) - 1 freq curlin (7) - 17 freq cacklin (7) - 2 freq scuilin (7) - 1 freq michelin (7) - 4 freq wachlin (7) - 2 freq cuilin (7) - 1 freq cline (7) - 4 freq |
SoundEx code - J245 jooglin - 10 freq jigglin - 5 freq jacqueline - 6 freq jacquline - 1 freq jugglan - 1 freq jeeglin - 1 freq |
MetaPhone code - JKKLN jacqueline - 6 freq jacquline - 1 freq |
JACQUELINE |
| Time to execute Levenshtein function - 0.228304 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.404318 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.031456 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.039668 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.000911 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. |