| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bearer (0) - 7 freq dearer (1) - 8 freq beamer (1) - 12 freq bearers (1) - 4 freq beaker (1) - 6 freq beaver (1) - 3 freq beirer (1) - 1 freq beater (1) - 11 freq hearer (1) - 1 freq nearer (1) - 72 freq teaker (2) - 1 freq dealer (2) - 15 freq beter (2) - 1 freq brer (2) - 2 freq beyler (2) - 1 freq beaded (2) - 1 freq baker (2) - 26 freq barr (2) - 15 freq faarer (2) - 6 freq beaten (2) - 20 freq braer (2) - 1 freq baer (2) - 2 freq boaren (2) - 1 freq bear's (2) - 2 freq bears (2) - 32 freq |
bearer (0) - 7 freq beirer (1) - 1 freq nearer (2) - 72 freq braer (2) - 1 freq brer (2) - 2 freq berr (2) - 2 freq barr (2) - 15 freq hearer (2) - 1 freq beater (2) - 11 freq bearers (2) - 4 freq beaker (2) - 6 freq dearer (2) - 8 freq beaver (2) - 3 freq beamer (2) - 12 freq bauer (3) - 1 freq beart (3) - 1 freq beard (3) - 54 freq barter (3) - 3 freq beer (3) - 140 freq beware (3) - 5 freq beemer (3) - 2 freq neurer (3) - 1 freq bared (3) - 6 freq brawer (3) - 9 freq beeger (3) - 6 freq |
SoundEx code - B660 beirer - 1 freq brawer - 9 freq brur - 23 freq breer - 11 freq brier - 5 freq bearer - 7 freq barrier - 13 freq brer - 2 freq brewery - 6 freq brawery - 1 freq bruar - 5 freq braar - 1 freq brewer - 1 freq briar - 1 freq €œbriar - 1 freq brurr - 1 freq braer - 1 freq brora - 15 freq |
MetaPhone code - BRR beirer - 1 freq brur - 23 freq breer - 11 freq brier - 5 freq bearer - 7 freq barrier - 13 freq brer - 2 freq bruar - 5 freq braar - 1 freq briar - 1 freq €œbriar - 1 freq brurr - 1 freq braer - 1 freq brora - 15 freq |
BEARER |
| Time to execute Levenshtein function - 0.206989 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.357070 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.027479 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.038664 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. |