| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jotunhiemen (0) - 1 freq countriemen (4) - 1 freq rothiemay (5) - 1 freq jondeen (5) - 3 freq countrymen (5) - 1 freq dounhauden (5) - 3 freq bottlemen (5) - 1 freq foundiment (5) - 1 freq stuneen (5) - 1 freq stuntmen (5) - 1 freq notheen (5) - 41 freq rothiemoon (5) - 3 freq moniement (5) - 1 freq jaundice (6) - 3 freq bothied (6) - 2 freq scythemen (6) - 2 freq bountifae (6) - 1 freq judgement (6) - 20 freq moth-etten (6) - 1 freq onhin (6) - 2 freq lounerin (6) - 1 freq notnixon (6) - 2 freq mathieson (6) - 18 freq tuimin (6) - 2 freq oonbidden (6) - 1 freq |
jotunhiemen (0) - 1 freq rothiemoon (7) - 3 freq stuntmen (7) - 1 freq stane-men (8) - 1 freq jondeen (8) - 3 freq jotham (8) - 4 freq dutchmen (8) - 1 freq watchmen (8) - 1 freq notheen (8) - 41 freq countriemen (8) - 1 freq rothiemay (8) - 1 freq bottlemen (8) - 1 freq dounhauden (8) - 3 freq journeyman (8) - 2 freq stuneen (8) - 1 freq journeysman (8) - 1 freq johannine (9) - 1 freq watchman (9) - 1 freq witnessmen (9) - 1 freq stonehaven (9) - 11 freq steenhaven (9) - 1 freq tunkin (9) - 1 freq nothin (9) - 194 freq southern (9) - 16 freq juntherin (9) - 3 freq |
SoundEx code - J355 jotunhiemen - 1 freq |
MetaPhone code - JTNHMN jotunhiemen - 1 freq |
JOTUNHIEMEN |
| Time to execute Levenshtein function - 0.218789 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.409796 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.028232 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.038528 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.000930 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. |