| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bemeanit (0) - 1 freq bemeanin (1) - 2 freq bemeanan (2) - 1 freq bemeaning (2) - 1 freq demeanin (2) - 3 freq smeakit (3) - 1 freq beheidit (3) - 6 freq beenie (3) - 5 freq benefit (3) - 73 freq revealit (3) - 2 freq meanin (3) - 201 freq repeatit (3) - 52 freq bekeit (3) - 1 freq begeckit (3) - 1 freq remnant (3) - 7 freq emerant (3) - 9 freq remeidit (3) - 1 freq dementit (3) - 22 freq bemoaning (3) - 1 freq bemoan (3) - 1 freq meinit (3) - 28 freq defeatit (3) - 5 freq belevit (3) - 1 freq demean (3) - 1 freq meenit (3) - 529 freq |
bemeanit (0) - 1 freq bemeanin (2) - 2 freq beaminit (3) - 1 freq bemeanan (3) - 1 freq bemeaning (4) - 1 freq remeent (4) - 2 freq meinit (4) - 28 freq remainit (4) - 1 freq meenit (4) - 529 freq meant (4) - 461 freq remant (4) - 1 freq cement (4) - 27 freq menit (4) - 2 freq bemoan (4) - 1 freq bejant (4) - 4 freq demeanin (4) - 3 freq ment (5) - 18 freq brent (5) - 17 freq blent (5) - 6 freq laminit (5) - 1 freq belmont (5) - 6 freq foment (5) - 2 freq briant (5) - 1 freq damnit (5) - 5 freq meenite (5) - 1 freq |
SoundEx code - B553 beaminit - 1 freq ben-end - 3 freq bannantyne's - 1 freq bemeanit - 1 freq bi-monthly - 1 freq beaumont-hamel - 3 freq benandonner - 3 freq bananadaquiri - 1 freq |
MetaPhone code - BMNT beaminit - 1 freq bemeanit - 1 freq |
BEMEANIT |
| Time to execute Levenshtein function - 0.206788 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.413189 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.031620 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.042114 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.001081 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. |