| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jawbox (0) - 5 freq jaw-box (1) - 3 freq €˜jawbox (2) - 1 freq jawb (2) - 2 freq jambos (2) - 3 freq awmox (2) - 1 freq jabot (2) - 1 freq jambo (2) - 5 freq jaw's (3) - 1 freq jaw- (3) - 1 freq asbo (3) - 1 freq jabs (3) - 2 freq gearbox (3) - 5 freq abbot (3) - 5 freq jumbo (3) - 13 freq awbdy (3) - 8 freq jabba (3) - 1 freq bamboo (3) - 9 freq labor (3) - 1 freq jallop (3) - 1 freq jabbit (3) - 3 freq jawin (3) - 2 freq abon (3) - 1 freq inbox (3) - 4 freq awol (3) - 9 freq |
jawbox (0) - 5 freq jaw-box (2) - 3 freq jawb (3) - 2 freq jambo (4) - 5 freq jabot (4) - 1 freq jukebox (4) - 1 freq awmox (4) - 1 freq jambos (4) - 3 freq €˜jawbox (4) - 1 freq awb (5) - 6 freq jambs (5) - 1 freq jaws (5) - 48 freq jukeboax (5) - 1 freq jawed (5) - 4 freq cowboy (5) - 16 freq jewson (5) - 1 freq lawbour (5) - 5 freq jumbos (5) - 3 freq in-box (5) - 1 freq bawbag (5) - 13 freq jabble (5) - 2 freq xbox (5) - 2 freq jimbo (5) - 1 freq facebox (5) - 2 freq jaw (5) - 57 freq |
SoundEx code - J120 jobs - 78 freq joabs - 33 freq japes - 1 freq job's - 4 freq jabs - 2 freq jubous - 1 freq jaups - 3 freq jobbie's - 2 freq jawbox - 5 freq jeeves - 3 freq jps - 3 freq jeebies - 2 freq japs - 12 freq jaw-box - 3 freq jubes - 3 freq jubish - 2 freq jobbies - 3 freq javig - 1 freq joves - 2 freq jaips - 1 freq jehovey's - 1 freq jfk - 1 freq €˜jawbox - 1 freq jibes - 2 freq jcgibwsxsx - 1 freq jvqj - 1 freq jpzj - 1 freq joefc - 1 freq jaffa's - 1 freq jbqz - 1 freq jeff's - 1 freq jfqo - 1 freq jxcvzo - 1 freq jeffco - 1 freq jssjsyvsa - 1 freq jbuaq - 1 freq |
MetaPhone code - JBKS jawbox - 5 freq jaw-box - 3 freq €˜jawbox - 1 freq jbqz - 1 freq |
JAWBOX |
| Time to execute Levenshtein function - 0.224863 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.417399 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.030944 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.042233 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.001008 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. |