| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tummelled (0) - 2 freq cummelled (1) - 2 freq rummelled (1) - 3 freq kummelled (1) - 1 freq pummelled (1) - 1 freq tummled (2) - 4 freq rummeled (2) - 2 freq tunnelled (2) - 1 freq summerled (2) - 1 freq bummeled (2) - 1 freq rummled (3) - 3 freq hummered (3) - 1 freq hummled (3) - 1 freq tusseled (3) - 1 freq fuelled (3) - 7 freq timmered (3) - 1 freq travelled (3) - 16 freq compelled (3) - 3 freq rummiled (3) - 1 freq tummelt (3) - 17 freq trimmeled (3) - 1 freq tummel (3) - 5 freq smelled (3) - 11 freq tummile (3) - 1 freq tumbled (3) - 9 freq |
tummelled (0) - 2 freq pummelled (2) - 1 freq kummelled (2) - 1 freq cummelled (2) - 2 freq rummelled (2) - 3 freq tummled (3) - 4 freq bummeled (4) - 1 freq summerled (4) - 1 freq tunnelled (4) - 1 freq rummeled (4) - 2 freq stummled (5) - 2 freq mummled (5) - 11 freq tummler (5) - 3 freq melled (5) - 34 freq tummles (5) - 2 freq tummle (5) - 19 freq tummelin (5) - 1 freq pummellin (5) - 1 freq trevelled (5) - 6 freq cummled (5) - 2 freq fummled (5) - 3 freq wummled (5) - 3 freq impelled (5) - 2 freq tummlet (5) - 3 freq jummled (5) - 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 |
TUMMELLED |
| Time to execute Levenshtein function - 0.246589 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.676626 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.035290 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.075781 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.001112 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. |