| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jaw-bane (0) - 1 freq jaw-hole (3) - 3 freq backbane (3) - 2 freq hat-band (3) - 1 freq abane (3) - 28 freq rig-bane (3) - 2 freq jawline (3) - 2 freq ae-lane (3) - 2 freq jamstane (3) - 1 freq baw-bee (3) - 1 freq jaw-box (3) - 3 freq faw-back (3) - 2 freq hambane (3) - 1 freq capstane (4) - 1 freq strabane (4) - 3 freq jabble (4) - 2 freq jacobite (4) - 24 freq lamban (4) - 2 freq abene (4) - 1 freq spailbane (4) - 1 freq brisbane (4) - 1 freq aw-no (4) - 1 freq whane (4) - 3 freq gawkan (4) - 1 freq jane (4) - 50 freq |
jaw-bane (0) - 1 freq jaw-box (4) - 3 freq baw-bee (5) - 1 freq rig-bane (5) - 2 freq jawline (5) - 2 freq jaw-hole (5) - 3 freq aw-no (6) - 1 freq jawin (6) - 2 freq jacobean (6) - 2 freq jabbin (6) - 8 freq waw-en (6) - 1 freq jawbox (6) - 5 freq jail-bait (6) - 1 freq far-ben (6) - 1 freq jaw- (6) - 1 freq jamstane (6) - 1 freq ae-lane (6) - 2 freq abane (6) - 28 freq faw-back (6) - 2 freq hat-band (6) - 1 freq jawb (6) - 2 freq hambane (6) - 1 freq backbane (6) - 2 freq alban (7) - 3 freq up-abune (7) - 3 freq |
SoundEx code - J150 japan - 10 freq jabbin - 8 freq jaupin - 1 freq jobnny - 1 freq jeavin - 1 freq jowpin - 1 freq jovian - 3 freq juppen - 4 freq japanee - 7 freq javan - 4 freq jaw-bane - 1 freq jappin - 1 freq jpm - 1 freq jvooeom - 1 freq |
MetaPhone code - JBN jabbin - 8 freq gibbon - 10 freq jobnny - 1 freq giban - 1 freq jaw-bane - 1 freq |
JAW-BANE |
| Time to execute Levenshtein function - 0.237459 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.379189 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.027709 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.037791 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.001076 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. |