| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bedivvils (0) - 1 freq trivvils (3) - 1 freq divvels (3) - 2 freq divvies (3) - 1 freq divvil (3) - 3 freq deivils (3) - 1 freq bevvin (4) - 1 freq divil' (4) - 1 freq bovrils (4) - 1 freq traivils (4) - 1 freq bevvied (4) - 4 freq beirins (4) - 1 freq weevils (4) - 1 freq leevils (4) - 1 freq bevvie (4) - 2 freq revivals (4) - 1 freq beddis (4) - 1 freq beirials (4) - 1 freq divil's (4) - 1 freq divil (4) - 17 freq levils (4) - 1 freq believin (4) - 13 freq deivil's (4) - 1 freq bidie-ins (4) - 1 freq divvel's (4) - 1 freq |
bedivvils (0) - 1 freq divvels (4) - 2 freq deivils (5) - 1 freq divvil (5) - 3 freq trivvils (5) - 1 freq divvies (5) - 1 freq bevels (6) - 1 freq divvel's (6) - 1 freq devils (6) - 1 freq revivals (6) - 1 freq deevils (6) - 11 freq trivvels (6) - 1 freq bovrils (6) - 1 freq divvel (6) - 4 freq divvle (6) - 1 freq beddies (7) - 2 freq distils (7) - 2 freq believes (7) - 18 freq divvied (7) - 2 freq divvin (7) - 1 freq ainvils (7) - 1 freq bedlaes (7) - 1 freq bedclaes (7) - 12 freq bed-claes (7) - 4 freq budgells (7) - 1 freq |
SoundEx code - B314 beautiful - 132 freq beautifully - 4 freq byoo-ootiful - 4 freq beauti-ful - 3 freq biddable - 7 freq beau-ootiful - 7 freq bedevilled - 1 freq body-builder - 1 freq 'beautiful - 2 freq bedivvils - 1 freq bootpolish - 1 freq beautifulmumsie - 1 freq bottybolingoli - 1 freq |
MetaPhone code - BTFLS bedivvils - 1 freq |
BEDIVVILS |
| Time to execute Levenshtein function - 0.244855 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.430435 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.027778 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.037772 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.000915 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. |