| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| beethoven (0) - 1 freq beethoven's (2) - 1 freq brethren (3) - 1 freq beehive (3) - 1 freq benthorn (3) - 1 freq berthen (3) - 3 freq beeteen (3) - 1 freq betoken (3) - 1 freq behoves (3) - 1 freq belhaven (3) - 2 freq eeleeven (4) - 1 freq bestowe (4) - 1 freq beaton (4) - 35 freq ruthven (4) - 6 freq keetchen (4) - 9 freq blethereen (4) - 1 freq seethin (4) - 3 freq teethin (4) - 1 freq seethe (4) - 2 freq breton (4) - 5 freq blether (4) - 174 freq weether (4) - 1 freq bletherer (4) - 1 freq meeten (4) - 1 freq ceetizen (4) - 1 freq |
beethoven (0) - 1 freq beethoven's (4) - 1 freq belhaven (4) - 2 freq ruthven (5) - 6 freq behoves (5) - 1 freq bethan (5) - 1 freq bethern (5) - 1 freq behavin (5) - 4 freq benthorn (5) - 1 freq beehive (5) - 1 freq betoken (5) - 1 freq brethren (5) - 1 freq berthen (5) - 3 freq beeteen (5) - 1 freq bethenec (6) - 1 freq baetween (6) - 4 freq eletven (6) - 1 freq biether (6) - 1 freq behave (6) - 38 freq buckhaven (6) - 1 freq brethern (6) - 3 freq bethanie (6) - 2 freq bathin (6) - 11 freq seethan (6) - 1 freq burnhaven (6) - 1 freq |
SoundEx code - B315 beethoven's - 1 freq beethoven - 1 freq bed-happin - 1 freq bdfm - 17 freq |
MetaPhone code - B0FN beethoven - 1 freq |
BEETHOVEN |
| Time to execute Levenshtein function - 0.427754 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.631313 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.032391 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.044598 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.000902 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. |