| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bentham (0) - 1 freq beckham (2) - 2 freq beatha (2) - 5 freq letham (2) - 6 freq westham (2) - 3 freq leatham (2) - 9 freq bethan (2) - 1 freq botham (2) - 1 freq beath (3) - 3 freq lenthie (3) - 1 freq bentset (3) - 1 freq entac (3) - 1 freq central (3) - 130 freq gethim (3) - 1 freq burnham (3) - 4 freq jenth (3) - 1 freq beam (3) - 18 freq mentae (3) - 1 freq tenth (3) - 14 freq anthem (3) - 13 freq ental (3) - 1 freq benche (3) - 1 freq belther (3) - 1 freq bendan (3) - 1 freq bench (3) - 54 freq |
bentham (0) - 1 freq botham (3) - 1 freq bnitam (4) - 1 freq anthum (4) - 1 freq bethan (4) - 1 freq anthem (4) - 13 freq beckham (4) - 2 freq leatham (4) - 9 freq beatha (4) - 5 freq letham (4) - 6 freq westham (4) - 3 freq tham (5) - 43 freq beth (5) - 26 freq lenthy (5) - 1 freq jotham (5) - 4 freq benched (5) - 1 freq beith (5) - 5 freq entrim (5) - 4 freq bent (5) - 104 freq benches (5) - 13 freq beneath (5) - 33 freq bents (5) - 11 freq bonshaw (5) - 1 freq bentley (5) - 4 freq brecham (5) - 5 freq |
SoundEx code - B535 bendin - 14 freq bending - 2 freq bindin - 6 freq bunting - 8 freq bnitam - 1 freq boondin - 1 freq bondin - 1 freq bonnetmaker - 3 freq buntin - 4 freq binnatoon - 1 freq bonding - 1 freq bendan - 1 freq bunden - 1 freq bentham - 1 freq boundin - 7 freq bontemps - 6 freq bontemps' - 1 freq buntings - 1 freq bounding - 1 freq bayonetin - 1 freq bantams - 1 freq bntton - 1 freq bontine - 2 freq binding - 1 freq bindins - 1 freq buntinrobert - 1 freq bonnyton - 18 freq |
MetaPhone code - BN0M bentham - 1 freq |
BENTHAM |
| Time to execute Levenshtein function - 0.234151 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.417539 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.028352 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.036840 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.000829 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. |