| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| end-up (0) - 5 freq endup (1) - 1 freq endue (2) - 1 freq redd-up (2) - 7 freq wind-up (2) - 2 freq fed-up (2) - 6 freq lead-up (2) - 1 freq held-up (2) - 1 freq eye-up (2) - 1 freq heldup (3) - 1 freq windup (3) - 1 freq undeun (3) - 1 freq endy (3) - 8 freq nup (3) - 12 freq end-all (3) - 1 freq made-up (3) - 6 freq endure (3) - 17 freq jyned-up (3) - 1 freq lendrum (3) - 1 freq endear (3) - 1 freq enou (3) - 1 freq wak-up (3) - 1 freq edu (3) - 3 freq eneuf (3) - 1 freq dup (3) - 5 freq |
end-up (0) - 5 freq endup (2) - 1 freq lead-up (3) - 1 freq wind-up (3) - 2 freq fed-up (3) - 6 freq made-up (4) - 6 freq bound-up (4) - 1 freq jyned-up (4) - 1 freq and-aa (4) - 1 freq peyed-up (4) - 1 freq round-up (4) - 1 freq lined-up (4) - 1 freq endue (4) - 1 freq held-up (4) - 1 freq redd-up (4) - 7 freq eye-up (4) - 1 freq ended (5) - 72 freq endish (5) - 1 freq let-up (5) - 1 freq endyte (5) - 2 freq end' (5) - 1 freq endins (5) - 13 freq redup (5) - 1 freq endet (5) - 42 freq enders (5) - 2 freq |
SoundEx code - E531 endeavour - 11 freq endeavours - 2 freq endeavour's - 1 freq endeavoured - 2 freq end-up - 5 freq endup - 1 freq entablatures - 1 freq emotive - 3 freq endeavouring - 1 freq endeavourt - 1 freq emotifinally - 1 freq endeavor - 1 freq eneedtibreakswet - 1 freq |
MetaPhone code - ENTP end-up - 5 freq endup - 1 freq |
END-UP |
| Time to execute Levenshtein function - 0.467212 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.828212 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.090486 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.097012 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.000922 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. |