| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| balfour (0) - 50 freq balmour (1) - 1 freq balfour's (2) - 1 freq befour (2) - 2 freq barbour (2) - 17 freq bbcfour (2) - 2 freq valour (2) - 1 freq afoar (3) - 15 freq labour (3) - 276 freq afaur (3) - 4 freq glour (3) - 1 freq bordour (3) - 1 freq balefu (3) - 2 freq lalor (3) - 8 freq four (3) - 176 freq battur (3) - 1 freq amour (3) - 1 freq blout (3) - 1 freq gallous (3) - 1 freq kildour (3) - 2 freq bayou (3) - 1 freq fallout (3) - 1 freq cawdour (3) - 1 freq baitur (3) - 4 freq ballo (3) - 1 freq |
balfour (0) - 50 freq balmour (2) - 1 freq befour (3) - 2 freq balr (4) - 1 freq befor (4) - 1 freq balder (4) - 1 freq blur (4) - 12 freq belfry (4) - 1 freq balf (4) - 1 freq balmer (4) - 2 freq befoir (4) - 2 freq baleful (4) - 2 freq baler (4) - 4 freq belabour (4) - 1 freq bbcfour (4) - 2 freq valour (4) - 1 freq barbour (4) - 17 freq balefu (4) - 2 freq balfour's (4) - 1 freq balboa (5) - 1 freq bloun (5) - 1 freq laubour (5) - 2 freq blurr (5) - 1 freq €˜four (5) - 2 freq baloos (5) - 1 freq |
SoundEx code - B416 blaffert - 1 freq belabour - 1 freq blubbert - 1 freq balfour - 50 freq boulevards - 2 freq blueprint - 3 freq blabberin - 2 freq believer - 4 freq billboards - 1 freq blubber - 9 freq blueberry - 13 freq 'blueberry - 1 freq billboard - 1 freq blueprints - 1 freq bullfrog - 8 freq bluebird - 2 freq balfour's - 1 freq bluffert - 1 freq bluey-purple - 1 freq blaeberries - 3 freq blaeberry - 2 freq bolivars - 1 freq bullbairn - 1 freq believers - 1 freq belfry - 1 freq bolivarists - 1 freq boulievard - 1 freq boulevard - 2 freq bloopers - 1 freq bluborder - 3 freq bluebreeks - 1 freq billwyper - 1 freq blooper - 1 freq balfronhigh - 1 freq balfronprimary - 1 freq bluebir - 2 freq |
MetaPhone code - BLFR balfour - 50 freq believer - 4 freq belfry - 1 freq |
BALFOUR |
| Time to execute Levenshtein function - 0.186535 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.337408 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.027194 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.037685 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.000830 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. |