| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bullfrog (0) - 8 freq bulldog (2) - 3 freq bullers (3) - 2 freq bullion (3) - 1 freq bullying (3) - 4 freq bulldug (3) - 2 freq burrog (3) - 1 freq bulldeug (3) - 1 freq bullert (3) - 2 freq bullerin (3) - 1 freq ballarat (4) - 1 freq bulfie (4) - 1 freq butterig (4) - 1 freq bellpou (4) - 1 freq guller't (4) - 2 freq fullo (4) - 1 freq buldered (4) - 1 freq pullar (4) - 5 freq dullion (4) - 1 freq billy-o (4) - 1 freq bulder (4) - 4 freq pull-oot (4) - 1 freq pulling (4) - 11 freq bull-man (4) - 1 freq guelfo (4) - 1 freq |
bullfrog (0) - 8 freq bulldog (4) - 3 freq bulldeug (5) - 1 freq bulldug (5) - 2 freq bullert (5) - 2 freq bullerin (5) - 1 freq bullers (5) - 2 freq bullying (5) - 4 freq ballroom (6) - 5 freq bellyfou (6) - 1 freq bueller (6) - 1 freq burrog (6) - 1 freq belfry (6) - 1 freq bullion (6) - 1 freq bellabeg (6) - 1 freq ballarat (6) - 1 freq bollard (6) - 3 freq culling (7) - 2 freq duller (7) - 2 freq bulker (7) - 1 freq cullers (7) - 1 freq ballot (7) - 10 freq bulking (7) - 1 freq bulders (7) - 1 freq puller (7) - 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 - BLFRK bullfrog - 8 freq |
BULLFROG |
| Time to execute Levenshtein function - 0.298267 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.456872 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.061987 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.037490 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.000799 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. |