| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| honourable (0) - 8 freq honorarie (3) - 1 freq incurable (3) - 1 freq favourable (3) - 1 freq dishonourable (3) - 1 freq honorary (4) - 2 freq memorable (4) - 10 freq honourin (4) - 2 freq honorarily (4) - 1 freq 'notable (4) - 1 freq unmutable (4) - 1 freq adorable (4) - 8 freq honours (4) - 11 freq favourably (4) - 1 freq honorre (4) - 1 freq resounable (4) - 1 freq honorar (4) - 1 freq honour (4) - 95 freq venerable (4) - 1 freq honoured (4) - 6 freq honour's (4) - 2 freq hospitable (4) - 1 freq notable (4) - 5 freq horrible (4) - 59 freq meisurable (4) - 2 freq |
honourable (0) - 8 freq hoarrible (5) - 1 freq venerable (5) - 1 freq horrible (5) - 59 freq honorarily (5) - 1 freq incurable (5) - 1 freq honorarie (5) - 1 freq favourable (5) - 1 freq dishonourable (5) - 1 freq honour's (6) - 2 freq honoured (6) - 6 freq hourle (6) - 1 freq hornble (6) - 1 freq meisurable (6) - 2 freq horribly (6) - 2 freq honour (6) - 95 freq tolerable (6) - 1 freq notable (6) - 5 freq honourin (6) - 2 freq 'notable (6) - 1 freq honorar (6) - 1 freq memorable (6) - 10 freq honorary (6) - 2 freq honours (6) - 11 freq adorable (6) - 8 freq |
SoundEx code - H561 honourable - 8 freq hunner-pund-a-time - 1 freq hunnerfaul - 1 freq hammarby - 1 freq |
MetaPhone code - HNRBL honourable - 8 freq |
HONOURABLE |
| Time to execute Levenshtein function - 0.225568 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.368456 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.027640 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.037253 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.000926 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. |