| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| thummart (0) - 2 freq hammart (2) - 1 freq thulmard (2) - 2 freq €˜thummart (2) - 1 freq thrumman (3) - 1 freq hemmert (3) - 4 freq tummelt (3) - 17 freq thuma (3) - 1 freq hammert (3) - 4 freq trumpat (3) - 1 freq hummelt (3) - 2 freq hummlt (3) - 3 freq summat (3) - 1 freq timmert (3) - 1 freq thrawart (3) - 4 freq tummlt (3) - 8 freq trummlet (3) - 1 freq thum-aw (3) - 1 freq fumart (3) - 1 freq summary (3) - 3 freq thum-an (3) - 2 freq tummilt (3) - 8 freq thrummelt (3) - 1 freq tummlet (3) - 3 freq thumbit (3) - 1 freq |
thummart (0) - 2 freq hammart (3) - 1 freq hammert (4) - 4 freq timmert (4) - 1 freq hemmert (4) - 4 freq thulmard (4) - 2 freq €˜thummart (4) - 1 freq thundert (5) - 1 freq thumper (5) - 1 freq thumpit (5) - 2 freq whummilt (5) - 2 freq thumbit (5) - 1 freq hummit (5) - 1 freq trummelt (5) - 1 freq whummelt (5) - 5 freq hummer (5) - 2 freq haimmert (5) - 1 freq thwart (5) - 1 freq tummlet (5) - 3 freq nummert (5) - 4 freq whummlet (5) - 1 freq thunnert (5) - 2 freq hameart (5) - 3 freq hummelt (5) - 2 freq trummlet (5) - 1 freq |
SoundEx code - T563 thunnert - 2 freq temerity - 1 freq thunnered - 4 freq timmert - 1 freq timurd - 1 freq thunner-rider - 1 freq thummart - 2 freq €˜thummart - 1 freq timmered - 1 freq temerat - 1 freq tounward - 1 freq tenortuesday - 1 freq tionurtj - 1 freq timmorton - 1 freq |
MetaPhone code - 0MRT thummart - 2 freq €˜thummart - 1 freq |
THUMMART |
| Time to execute Levenshtein function - 0.254010 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.434444 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.032973 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.038946 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.000895 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. |