| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bawheidit (0) - 1 freq bawheid (2) - 6 freq beheidit (2) - 6 freq baa-heidit (2) - 1 freq bawheids (2) - 3 freq hetheidit (3) - 1 freq baeheid (3) - 1 freq heidit (3) - 60 freq beheidin (3) - 3 freq ba-heid (3) - 1 freq bee-heidit (3) - 1 freq big-heidit (3) - 3 freq breidit (3) - 1 freq tow-heidit (3) - 1 freq langheidit (3) - 2 freq baw-heid (3) - 1 freq rid-heidit (4) - 2 freq sweitit (4) - 2 freq bardheid (4) - 1 freq avoidit (4) - 8 freq bathert (4) - 11 freq raidit (4) - 2 freq sweirit (4) - 1 freq bacheleir (4) - 1 freq heidin (4) - 58 freq |
bawheidit (0) - 1 freq baa-heidit (3) - 1 freq bawheids (3) - 3 freq beheidit (3) - 6 freq bawheid (3) - 6 freq bee-heidit (4) - 1 freq breidit (5) - 1 freq tow-heidit (5) - 1 freq baw-heid (5) - 1 freq bowhead (5) - 2 freq big-heidit (5) - 3 freq hetheidit (5) - 1 freq baeheid (5) - 1 freq heidit (5) - 60 freq beheidin (5) - 3 freq ba-heid (5) - 1 freq bawhair (6) - 1 freq weedit (6) - 1 freq bandit (6) - 7 freq bawdie (6) - 2 freq wheepit (6) - 2 freq braeheids (6) - 1 freq wheist (6) - 2 freq beildit (6) - 4 freq bathed (6) - 13 freq |
SoundEx code - B330 bidit - 30 freq beheidit - 6 freq bided - 30 freq bydit - 8 freq buttit - 4 freq bodied - 2 freq baa-heidit - 1 freq bee-heidit - 1 freq bathed - 13 freq beddit - 16 freq bedded - 8 freq beheided - 7 freq bedad - 1 freq butted - 5 freq booted - 6 freq buttet - 6 freq bdéat - 2 freq bdat - 1 freq betide - 4 freq buited - 1 freq batted - 1 freq bothied - 2 freq body'd - 1 freq bootit - 2 freq bowtit - 1 freq beaded - 1 freq beady-eyed - 2 freq baited - 1 freq bodit - 2 freq bawheidit - 1 freq behatted - 1 freq bidet - 1 freq beatit - 1 freq bothed - 1 freq |
MetaPhone code - BHTT beheidit - 6 freq baa-heidit - 1 freq bee-heidit - 1 freq beheided - 7 freq bawheidit - 1 freq behatted - 1 freq |
BAWHEIDIT |
| Time to execute Levenshtein function - 0.189246 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.367344 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.030554 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.036806 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.000831 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. |