| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cenotaph (0) - 2 freq bentaps (3) - 1 freq menorah (3) - 1 freq centaur (3) - 1 freq epitaph (3) - 3 freq cellotape (3) - 1 freq ental (4) - 1 freq coap (4) - 2 freq entada (4) - 1 freq center (4) - 9 freq tenth (4) - 14 freq certane (4) - 2 freq noth (4) - 5 freq cantar (4) - 1 freq notysh (4) - 4 freq notare (4) - 1 freq mentae (4) - 1 freq cloth (4) - 16 freq genoa (4) - 2 freq dentals (4) - 1 freq contack (4) - 37 freq jehovah (4) - 1 freq denotit (4) - 1 freq minotaur (4) - 20 freq centrin (4) - 1 freq |
cenotaph (0) - 2 freq centaur (5) - 1 freq epitaph (5) - 3 freq bentaps (5) - 1 freq zenith (6) - 2 freq centauri (6) - 5 freq centre (6) - 275 freq clytach (6) - 1 freq clomph (6) - 1 freq centile (6) - 1 freq notch (6) - 6 freq crotch (6) - 1 freq canopy (6) - 10 freq centre' (6) - 1 freq lenth (6) - 83 freq center' (6) - 1 freq cotch (6) - 8 freq cootch (6) - 3 freq zeneth (6) - 1 freq cloath (6) - 1 freq cantata (6) - 1 freq contain (6) - 15 freq central (6) - 130 freq contact (6) - 91 freq beneath (6) - 35 freq |
SoundEx code - C531 cuntybaws - 1 freq cantabile - 1 freq candyfloss - 3 freq coontback - 1 freq contibution - 1 freq centipede - 2 freq cenotaph - 2 freq cantbuythechampionsleague - 1 freq cantfeelmytongue - 1 freq |
MetaPhone code - SNTF send-aff - 1 freq sound-aff - 1 freq scientive - 1 freq cenotaph - 2 freq |
CENOTAPH |
| Time to execute Levenshtein function - 0.219416 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.412980 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.027730 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.040190 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.000928 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. |