| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jerusalem (0) - 103 freq jerusalem' (1) - 1 freq €œjerusalem (2) - 1 freq kensalem (3) - 1 freq crusader (4) - 3 freq refusal (4) - 2 freq eequalee (4) - 1 freq euaazem (4) - 1 freq rustle (4) - 11 freq jetsam (4) - 1 freq jersey (4) - 22 freq thrustle (4) - 1 freq crusade (4) - 4 freq hersael (4) - 1 freq brustled (4) - 1 freq rustled (4) - 4 freq couslem (4) - 1 freq trummle (5) - 3 freq epistles (5) - 1 freq bernabeu (5) - 1 freq craalen (5) - 1 freq heretage (5) - 1 freq messages (5) - 147 freq februare (5) - 1 freq jerbs (5) - 1 freq |
jerusalem (0) - 103 freq jerusalem' (2) - 1 freq €œjerusalem (4) - 1 freq kensalem (5) - 1 freq hersael (6) - 1 freq jetsam (6) - 1 freq jersey (6) - 22 freq couslem (6) - 1 freq mausoleum (7) - 4 freq firsled (7) - 1 freq joram (7) - 2 freq jeremy (7) - 12 freq problem (7) - 258 freq crosley (7) - 1 freq dursley (7) - 48 freq psalm (7) - 39 freq ersel (7) - 36 freq girsle (7) - 2 freq hersell (7) - 12 freq aerosols (7) - 6 freq hirsle (7) - 3 freq worsley (7) - 1 freq uersel (7) - 1 freq eersel (7) - 28 freq herself (7) - 41 freq |
SoundEx code - J624 jerusalem - 103 freq jargle - 1 freq jerkily - 1 freq jerusalem' - 1 freq €œjerusalem - 1 freq |
MetaPhone code - JRSLM jerusalem - 103 freq jerusalem' - 1 freq €œjerusalem - 1 freq |
JERUSALEM |
| Time to execute Levenshtein function - 0.192622 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.364001 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.027494 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.036746 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.000764 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. |