| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| beheided (0) - 7 freq beheidit (2) - 6 freq beheid (2) - 3 freq heided (2) - 35 freq beheidan (2) - 1 freq beheidin (2) - 3 freq behauder (3) - 2 freq leided (3) - 1 freq beleved (3) - 2 freq behaved (3) - 9 freq seeded (3) - 3 freq dreided (3) - 4 freq bended (3) - 4 freq needed (3) - 143 freq heeded (3) - 14 freq unheeded (3) - 1 freq behuives (3) - 1 freq behatted (3) - 1 freq heidet (3) - 1 freq bevvied (3) - 4 freq relaided (3) - 1 freq reteired (3) - 3 freq behind (3) - 246 freq heiled (3) - 1 freq ae-sided (3) - 2 freq |
beheided (0) - 7 freq beheidan (3) - 1 freq heided (3) - 35 freq beheidin (3) - 3 freq beheid (3) - 3 freq beheidit (3) - 6 freq braided (4) - 2 freq chided (4) - 3 freq behudden (4) - 1 freq headed (4) - 38 freq behind (4) - 246 freq behynde (4) - 1 freq baeheid (4) - 1 freq bedded (4) - 8 freq bided (4) - 30 freq beaded (4) - 1 freq bielded (4) - 3 freq bearded (4) - 7 freq behaved (4) - 9 freq beheld (4) - 4 freq bended (4) - 4 freq heeded (4) - 14 freq unheeded (4) - 1 freq behauder (4) - 2 freq behiynd (4) - 1 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 |
BEHEIDED |
| Time to execute Levenshtein function - 0.173615 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.342512 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.027476 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.037170 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.000809 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. |