| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bentley (0) - 4 freq beetles (2) - 2 freq sentle (2) - 1 freq tetley (2) - 1 freq mentler (2) - 1 freq cantley (2) - 1 freq bentset (2) - 1 freq gentle (2) - 81 freq benosey (2) - 1 freq gently (2) - 83 freq gentler (2) - 4 freq beetle (2) - 4 freq fently (2) - 1 freq jentle (2) - 2 freq ently (2) - 2 freq begley (2) - 3 freq henley (2) - 1 freq beatles (2) - 1 freq tentles (2) - 2 freq dently (2) - 1 freq leftley (2) - 3 freq gentles (2) - 1 freq beliey (3) - 2 freq tentie (3) - 38 freq ettlet (3) - 8 freq |
bentley (0) - 4 freq beetle (3) - 4 freq gently (3) - 83 freq fently (3) - 1 freq jentle (3) - 2 freq dently (3) - 1 freq gentle (3) - 81 freq ently (3) - 2 freq cantley (3) - 1 freq sentle (3) - 1 freq pyntle (4) - 1 freq bustle (4) - 6 freq genteel (4) - 12 freq bastle (4) - 1 freq bunter (4) - 8 freq gentily (4) - 4 freq boatle (4) - 12 freq bottle (4) - 381 freq beltel (4) - 4 freq bienly (4) - 7 freq entel (4) - 3 freq huntly (4) - 29 freq pintle (4) - 2 freq beinly (4) - 1 freq banty (4) - 5 freq |
SoundEx code - B534 bundle - 18 freq bentley - 4 freq bundlet - 2 freq bundles - 4 freq bunnet-lairds - 1 freq bundlie - 1 freq bundelt - 1 freq boundless - 1 freq bundled - 1 freq bundling - 1 freq bentleysteed - 1 freq bindelj - 1 freq |
MetaPhone code - BNTL bundle - 18 freq bentley - 4 freq bundlie - 1 freq |
BENTLEY |
| Time to execute Levenshtein function - 0.377796 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.604505 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.035465 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.049323 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.001264 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. |