| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| endeavour (0) - 11 freq endeavours (1) - 2 freq endeavourt (1) - 1 freq endeavor (1) - 1 freq endeavour's (2) - 1 freq endeavoured (2) - 2 freq endeavouring (3) - 1 freq devour (3) - 7 freq rendezvous (3) - 3 freq endear (3) - 1 freq nzlabour (4) - 1 freq endanger (4) - 1 freq devoir (4) - 1 freq neibour (4) - 28 freq endager (4) - 1 freq pleasour (4) - 1 freq devour' (4) - 1 freq demeanour (4) - 5 freq nevur (4) - 1 freq endearin (4) - 2 freq undeimous (4) - 8 freq favour (4) - 69 freq detour (4) - 7 freq undemous (4) - 6 freq enamourt (4) - 1 freq |
endeavour (0) - 11 freq endeavor (1) - 1 freq endeavourt (2) - 1 freq endeavours (2) - 2 freq endeavoured (3) - 2 freq endear (4) - 1 freq devour (4) - 7 freq endeavour's (4) - 1 freq endager (5) - 1 freq nevur (5) - 1 freq devoir (5) - 1 freq unsavoury (5) - 1 freq dyvour (5) - 2 freq endeavouring (5) - 1 freq endure (6) - 17 freq nevir (6) - 8 freq savour (6) - 18 freq nivur (6) - 2 freq naver (6) - 3 freq behavour (6) - 1 freq faavour (6) - 1 freq cadaver (6) - 1 freq nevar (6) - 1 freq never (6) - 1661 freq ndgear (6) - 1 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 - ENTFR endeavour - 11 freq endeavor - 1 freq |
ENDEAVOUR |
| Time to execute Levenshtein function - 0.182701 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.338733 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.027465 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.037049 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. |