| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| habits (0) - 23 freq habit (1) - 50 freq habit's (1) - 1 freq habitus (1) - 1 freq aits (2) - 21 freq cubits (2) - 2 freq hains (2) - 5 freq haitd (2) - 1 freq abies (2) - 3 freq haets (2) - 2 freq sabies (2) - 13 freq habitat (2) - 3 freq haunts (2) - 13 freq oobits (2) - 5 freq haims (2) - 4 freq habités (2) - 1 freq wabit (2) - 1 freq baits (2) - 3 freq taits (2) - 1 freq harit (2) - 1 freq fabius (2) - 2 freq rabbits (2) - 29 freq haitts (2) - 1 freq hits (2) - 150 freq wabiti (2) - 1 freq |
habits (0) - 23 freq habitus (1) - 1 freq habit's (2) - 1 freq habit (2) - 50 freq haitts (3) - 1 freq hits (3) - 150 freq hairts (3) - 62 freq halts (3) - 1 freq hauts (3) - 1 freq haerts (3) - 19 freq hants (3) - 1 freq hats (3) - 46 freq habitats (3) - 4 freq bits (3) - 322 freq baits (3) - 3 freq habitat (3) - 3 freq orbits (3) - 1 freq haets (3) - 2 freq cubits (3) - 2 freq haunts (3) - 13 freq oobits (3) - 5 freq heysts (4) - 1 freq hub's (4) - 1 freq hurts (4) - 17 freq hearts (4) - 32 freq |
SoundEx code - H132 hauf-a-dizzen - 6 freq haufa-dizzen - 1 freq habits - 23 freq haffets - 6 freq hauf-wits - 1 freq haufdecent - 1 freq hauf-dizzen - 1 freq habit's - 1 freq hauf-decent - 1 freq hefts - 39 freq hypothecat - 1 freq hypothecated - 1 freq hauf-thoosand - 1 freq habités - 1 freq hypothesis - 1 freq haufwits - 2 freq haufwey-daicent - 1 freq habitus - 1 freq hpetycdbhp - 1 freq hbdxuh - 1 freq happydays - 6 freq |
MetaPhone code - HBTS habits - 23 freq habit's - 1 freq habités - 1 freq habitus - 1 freq |
HABITS |
| Time to execute Levenshtein function - 0.268970 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.373004 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.027248 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.037774 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.000912 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. |