| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jason (0) - 24 freq mason (1) - 11 freq jasonm (1) - 1 freq jasons (1) - 1 freq jasus (2) - 1 freq son (2) - 513 freq baton (2) - 3 freq leason (2) - 1 freq teason (2) - 2 freq aaron (2) - 5 freq salon (2) - 10 freq jaan (2) - 1 freq abon (2) - 1 freq fasson (2) - 6 freq easin (2) - 11 freq alon (2) - 2 freq rayson (2) - 1 freq jan (2) - 25 freq fauson (2) - 1 freq rasin (2) - 1 freq damson (2) - 1 freq avon (2) - 3 freq bacon (2) - 61 freq jargon (2) - 3 freq apon (2) - 90 freq |
jason (0) - 24 freq jasonm (2) - 1 freq jasons (2) - 1 freq mason (2) - 11 freq hasn (3) - 3 freq 'son (3) - 2 freq season (3) - 118 freq taison (3) - 1 freq yasin (3) - 15 freq reason (3) - 315 freq esson (3) - 1 freq jain (3) - 1 freq wasn (3) - 3 freq bison (3) - 2 freq asn (3) - 1 freq javan (3) - 4 freq boson (3) - 1 freq alson (3) - 1 freq casin (3) - 3 freq jakin (3) - 1 freq jawin (3) - 2 freq jast (3) - 3 freq jameson (3) - 2 freq jon (3) - 4 freq basan (3) - 1 freq |
SoundEx code - J250 joukin - 25 freq jiggin - 37 freq jookin - 7 freq jaggin - 9 freq jokin - 46 freq joggin - 9 freq jackson - 37 freq jizzen - 4 freq jason - 24 freq jeconiah - 4 freq jockina - 20 freq juicin - 2 freq jukin - 1 freq joggan - 1 freq jeckson - 1 freq jessie-annie - 1 freq jakin - 1 freq joukan - 1 freq jycin - 1 freq jui-shiuan - 2 freq jwiszsm - 1 freq jewson - 1 freq jockin - 1 freq jojum - 1 freq jasonm - 1 freq jackieme - 2 freq jojom - 1 freq jecm - 1 freq |
MetaPhone code - JSN gizzen - 5 freq jizzen - 4 freq gicin - 1 freq gecin - 1 freq jason - 24 freq juicin - 2 freq jessie-annie - 1 freq jycin - 1 freq jewson - 1 freq |
JASON |
| Time to execute Levenshtein function - 0.182628 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.379288 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.028383 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.037842 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.000854 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. |