| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jacob (0) - 41 freq jacob' (1) - 1 freq jakob (1) - 1 freq jacobs (1) - 1 freq jacky (2) - 1 freq acos (2) - 2 freq bacon (2) - 61 freq jacob's (2) - 9 freq taco (2) - 1 freq jabot (2) - 1 freq jawb (2) - 2 freq paco (2) - 19 freq job (2) - 519 freq jason (2) - 24 freq javvb (2) - 1 freq jack (2) - 224 freq jamb (2) - 2 freq jacks (2) - 10 freq jcb (2) - 2 freq nabob (2) - 1 freq joco (2) - 37 freq jac (2) - 3 freq jab (2) - 20 freq sackt (3) - 1 freq jade (3) - 14 freq |
jacob (0) - 41 freq jcb (2) - 2 freq jacobs (2) - 1 freq jacob' (2) - 1 freq jakob (2) - 1 freq jamb (3) - 2 freq job (3) - 519 freq jawb (3) - 2 freq jac (3) - 3 freq jacky (3) - 1 freq jab (3) - 20 freq jack (3) - 224 freq joco (3) - 37 freq jc (4) - 10 freq vcb (4) - 1 freq jrb (4) - 3 freq jojoba (4) - 1 freq xcb (4) - 1 freq joab (4) - 111 freq cab (4) - 15 freq scab (4) - 12 freq jycin (4) - 1 freq ijzcb (4) - 1 freq jacobite (4) - 24 freq jb (4) - 2 freq |
SoundEx code - J210 jacob - 41 freq joseph - 64 freq jacob' - 1 freq joogfu - 1 freq jakob - 1 freq josep - 1 freq jhehaoqcob - 1 freq jojoba - 1 freq 'joseph - 1 freq jojv - 1 freq joecobbe - 2 freq |
MetaPhone code - JKB jacob - 41 freq jcb - 2 freq jacob' - 1 freq jakob - 1 freq jjkb - 1 freq joecobbe - 2 freq hyjqhb - 1 freq |
JACOB |
| Time to execute Levenshtein function - 0.207619 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.407923 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.028430 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.039207 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.000879 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. |