| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jeeves (0) - 3 freq reeves (1) - 5 freq deeves (1) - 1 freq meeves (1) - 1 freq leeves (1) - 19 freq jeeve (1) - 1 freq beleves (2) - 1 freq laeves (2) - 16 freq teevee (2) - 1 freq greves (2) - 1 freq jeeled (2) - 4 freq reeved (2) - 2 freq jeames (2) - 32 freq jeests (2) - 7 freq reever (2) - 2 freq leeve (2) - 81 freq jeems (2) - 91 freq reeve (2) - 1 freq steves (2) - 2 freq seevens (2) - 9 freq veeve (2) - 5 freq keevee (2) - 1 freq reevles (2) - 1 freq eaves (2) - 2 freq meeved (2) - 22 freq |
jeeves (0) - 3 freq joves (2) - 2 freq leeves (2) - 19 freq jeeve (2) - 1 freq meeves (2) - 1 freq deeves (2) - 1 freq reeves (2) - 5 freq heaves (3) - 2 freq deives (3) - 1 freq jeyes (3) - 1 freq reives (3) - 2 freq nieves (3) - 15 freq jeelies (3) - 4 freq elves (3) - 10 freq jeels (3) - 3 freq leives (3) - 3 freq leaves (3) - 208 freq jeers (3) - 1 freq eevees (3) - 1 freq weaves (3) - 9 freq jeesus (3) - 2 freq neives (3) - 10 freq jees (3) - 3 freq jeebies (3) - 2 freq jeegs (3) - 1 freq |
SoundEx code - J120 jobs - 80 freq joabs - 35 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 - JFS gives - 20 freq jeeves - 3 freq joves - 2 freq jaffa's - 1 freq jeff's - 1 freq |
JEEVES |
| Time to execute Levenshtein function - 0.195086 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.392154 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.032605 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.037928 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.001053 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. |