| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| endtimes (0) - 2 freq nytimes (2) - 1 freq enemies (3) - 37 freq endures (3) - 3 freq gentiles (3) - 6 freq eddies (3) - 1 freq naimes (3) - 5 freq twatimes (3) - 1 freq enticed (3) - 2 freq awtimes (3) - 1 freq undies (3) - 3 freq denties (3) - 2 freq engines (3) - 13 freq pastimes (3) - 2 freq anytime (3) - 29 freq menties (3) - 1 freq goodtimes (3) - 1 freq €˜times (3) - 1 freq onytime (3) - 11 freq entries (3) - 35 freq thetimes (3) - 6 freq endoits (3) - 1 freq noties (3) - 2 freq meantimes (3) - 1 freq €œtimes (3) - 1 freq |
endtimes (0) - 2 freq nytimes (3) - 1 freq endoits (4) - 1 freq goodtimes (4) - 1 freq eventimes (5) - 1 freq betimes (5) - 16 freq entombs (5) - 1 freq endliss (5) - 1 freq entities (5) - 15 freq notices (5) - 16 freq bedtime (5) - 17 freq bytimes (5) - 5 freq times (5) - 934 freq afentimes (5) - 1 freq endiess (5) - 2 freq €™times (5) - 1 freq mealtimes (5) - 2 freq undeimous (5) - 8 freq endonyms (5) - 1 freq nooatimes (5) - 1 freq natives (5) - 13 freq somtimes (5) - 1 freq aftimes (5) - 11 freq aatimes (5) - 1 freq afttimes (5) - 2 freq |
SoundEx code - E535 endin - 43 freq e'endoun - 2 freq emittin - 1 freq ending - 17 freq entwined - 3 freq entombed - 3 freq emotion - 19 freq emotionally - 5 freq entombs - 1 freq emotions - 32 freq endtimes - 2 freq enatween - 1 freq emotional - 38 freq ent'n - 1 freq endanger - 1 freq endins - 13 freq 'emotional - 1 freq endangered - 6 freq eyntments - 1 freq enythin - 1 freq entangled - 3 freq endan - 2 freq endangered' - 1 freq endeens - 4 freq endeen - 3 freq eontentit - 1 freq eendounlike - 1 freq eendoun - 2 freq endowment - 1 freq endin' - 1 freq endangerit - 1 freq entent - 1 freq eyntment - 2 freq endemic - 3 freq emotionless - 1 freq endonyms - 1 freq endonym - 2 freq |
MetaPhone code - ENTTMS endtimes - 2 freq |
ENDTIMES |
| Time to execute Levenshtein function - 0.264433 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.454448 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.029483 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.042877 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.000938 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. |