| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| inherit (0) - 7 freq inheritin (2) - 2 freq inheritit (2) - 3 freq interin (2) - 1 freq inveit (2) - 5 freq inert (2) - 3 freq inhibit (2) - 2 freq indewit (2) - 1 freq enterit (2) - 2 freq inherited (2) - 8 freq inhabit (2) - 3 freq insert (2) - 3 freq insertit (2) - 2 freq invertit (2) - 3 freq inherent (2) - 7 freq intert (2) - 1 freq sinderit (2) - 1 freq inkervit (2) - 1 freq sinnerie (3) - 1 freq integrity (3) - 13 freq neri (3) - 3 freq sincerity (3) - 3 freq inner (3) - 44 freq kin-hertit (3) - 1 freq ithergait (3) - 1 freq |
inherit (0) - 7 freq inhabit (3) - 3 freq inherited (3) - 8 freq insert (3) - 3 freq intert (3) - 1 freq unhurt (3) - 1 freq enterit (3) - 2 freq inherent (3) - 7 freq inheritit (3) - 3 freq inheritin (3) - 2 freq inert (3) - 3 freq inhibit (3) - 2 freq cheerit (4) - 1 freq angert (4) - 16 freq inwart (4) - 1 freq unheedit (4) - 1 freq harit (4) - 1 freq angeret (4) - 1 freq unrit (4) - 1 freq injuret (4) - 3 freq entert (4) - 7 freq hert (4) - 762 freq inherieted (4) - 1 freq ushert (4) - 3 freq nithert (4) - 2 freq |
SoundEx code - I563 innerdaeks - 1 freq innarts - 1 freq immortal - 19 freq inherited - 8 freq immortals - 2 freq inheritit - 3 freq inheritance - 11 freq inheritin - 2 freq inheritaunce - 1 freq inherit - 7 freq innards - 4 freq immortality - 5 freq inward - 7 freq inwardly - 1 freq inheritors - 1 freq inherieted - 1 freq i'north - 1 freq inheritence - 2 freq inwards - 7 freq immortalitie - 1 freq inroads - 4 freq immortalised - 1 freq inarticulate - 1 freq inwairds - 1 freq inert - 3 freq inordinate - 1 freq inwartly - 1 freq inwart - 1 freq inertia - 1 freq iainheard - 1 freq iainrwhite - 1 freq |
MetaPhone code - INHRT inherit - 7 freq iainheard - 1 freq |
INHERIT |
| Time to execute Levenshtein function - 0.200468 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.363842 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.027759 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.038051 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.000873 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. |