| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tummelt (0) - 17 freq fummelt (1) - 1 freq trummelt (1) - 1 freq tummilt (1) - 8 freq pummelt (1) - 1 freq tummel (1) - 5 freq bummelt (1) - 1 freq hummelt (1) - 2 freq mummelt (1) - 13 freq tummlt (1) - 8 freq rummelt (1) - 7 freq stummelt (1) - 2 freq tommel (2) - 1 freq tummelin (2) - 1 freq tumilt (2) - 1 freq hummlt (2) - 3 freq tumblt (2) - 2 freq rummilt (2) - 4 freq tumult (2) - 2 freq gemmelt (2) - 1 freq whummelt (2) - 5 freq rummlt (2) - 1 freq cummel (2) - 1 freq nummet (2) - 1 freq nummert (2) - 4 freq |
tummelt (0) - 17 freq tummlt (1) - 8 freq tummilt (1) - 8 freq mummelt (2) - 13 freq tummlet (2) - 3 freq stummelt (2) - 2 freq hummelt (2) - 2 freq rummelt (2) - 7 freq trummelt (2) - 1 freq pummelt (2) - 1 freq fummelt (2) - 1 freq tummel (2) - 5 freq bummelt (2) - 1 freq timmert (3) - 1 freq rummult (3) - 1 freq mummilt (3) - 1 freq tummle (3) - 19 freq fummlt (3) - 1 freq tummile (3) - 1 freq tremmelt (3) - 1 freq rammelt (3) - 1 freq tumml't (3) - 2 freq tumblt (3) - 2 freq tumilt (3) - 1 freq tummelin (3) - 1 freq |
SoundEx code - T543 tummlet - 3 freq tummilt - 8 freq tummlt - 8 freq tummelt - 17 freq tumults - 1 freq tummled - 4 freq tumult - 2 freq tunnelled - 1 freq tumilt - 1 freq tummelled - 2 freq tömald - 1 freq tumml't - 2 freq |
MetaPhone code - TMLT tumbl't - 1 freq tummlet - 3 freq tummilt - 8 freq tummlt - 8 freq tummelt - 17 freq tumbled - 9 freq tumblt - 2 freq tummled - 4 freq tumult - 2 freq tumilt - 1 freq tummelled - 2 freq tömald - 1 freq tumml't - 2 freq |
TUMMELT |
| Time to execute Levenshtein function - 0.232768 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.369177 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.036145 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.039794 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.001203 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. |