| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| zumbas (0) - 1 freq zumba (1) - 2 freq stumbas (2) - 2 freq rumba (2) - 1 freq jumbos (2) - 3 freq dumb's (2) - 1 freq furbas (2) - 1 freq dumba (2) - 1 freq lumbs (2) - 1 freq vmas (3) - 1 freq lumps (3) - 21 freq pampas (3) - 1 freq kums (3) - 5 freq tums (3) - 1 freq sumday (3) - 1 freq mums (3) - 11 freq hubbys (3) - 1 freq mommas (3) - 1 freq pumps (3) - 12 freq humbugs (3) - 1 freq cymbals (3) - 3 freq cums (3) - 111 freq jubes (3) - 3 freq sumwan (3) - 8 freq dumbin (3) - 2 freq |
zumbas (0) - 1 freq zumba (2) - 2 freq lumbs (3) - 1 freq jumbos (3) - 3 freq zombies (3) - 6 freq jambos (4) - 3 freq nimbus (4) - 1 freq dumbies (4) - 1 freq limbs (4) - 37 freq mbs (4) - 2 freq bumbees (4) - 1 freq erumbs (4) - 2 freq zomb (4) - 1 freq mbes (4) - 1 freq jambs (4) - 1 freq combs (4) - 6 freq zombie (4) - 11 freq lambs (4) - 56 freq bombs (4) - 25 freq tombs (4) - 9 freq cambus (4) - 3 freq rumba (4) - 1 freq furbas (4) - 1 freq dumba (4) - 1 freq stumbas (4) - 2 freq |
SoundEx code - Z512 zombies - 6 freq zumbas - 1 freq zinpxmrpoe - 1 freq zmvgtiiuor - 1 freq zwimbg - 1 freq zhmvfuzrh - 1 freq |
MetaPhone code - SMS siem's - 1 freq seems - 517 freq seams - 6 freq smaas - 1 freq sums - 43 freq same's - 4 freq symes - 2 freq syme's - 1 freq seamus - 3 freq zombies - 6 freq seamaws - 2 freq seem's - 3 freq sea-maws - 4 freq sammie's - 1 freq sammy's - 4 freq seemes - 1 freq sooms - 3 freq sam's - 2 freq zumbas - 1 freq soums - 3 freq semi's - 1 freq semes - 2 freq smoosie - 2 freq sea-maws' - 1 freq siems - 2 freq sum's - 1 freq some's - 1 freq seumas - 17 freq cims - 1 freq 'syme's - 1 freq sie-mews - 1 freq smaws - 1 freq xmas - 48 freq sommies - 3 freq saems - 1 freq xmos - 1 freq semis - 4 freq sambies - 1 freq xxxmissy - 1 freq sma's - 1 freq |
ZUMBAS |
| Time to execute Levenshtein function - 0.194988 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.359100 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.027899 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.038462 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.000787 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. |