| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bakgrun (0) - 1 freq backgrun (1) - 16 freq beckgrun (2) - 1 freq backgrund (2) - 32 freq backgruns (2) - 2 freq baegun (2) - 6 freq backgrunn (2) - 1 freq agrun (2) - 1 freq bangan (3) - 1 freq bawdrin (3) - 2 freq bargin (3) - 2 freq bakeen (3) - 2 freq baron (3) - 4 freq agun (3) - 1 freq bakin (3) - 24 freq barren (3) - 16 freq baggin (3) - 2 freq barrin (3) - 7 freq bayern (3) - 9 freq bakery (3) - 16 freq wa-gaun (3) - 1 freq baun (3) - 18 freq baegin (3) - 2 freq bakan (3) - 1 freq agrund (3) - 3 freq |
bakgrun (0) - 1 freq backgrun (2) - 16 freq baakgroon (3) - 1 freq beckgrun (3) - 1 freq agrun (4) - 1 freq bikerin (4) - 1 freq backgroon (4) - 1 freq baegun (4) - 6 freq backgrunn (4) - 1 freq backgruns (4) - 2 freq backgrund (4) - 32 freq background (5) - 14 freq bak-en (5) - 1 freq barn (5) - 68 freq baarn (5) - 1 freq by-gaun (5) - 1 freq baken (5) - 2 freq baudran (5) - 2 freq bargyin (5) - 1 freq bayren (5) - 1 freq bygaun (5) - 7 freq bargain (5) - 33 freq playgrun (5) - 17 freq busrun (5) - 1 freq begun (5) - 79 freq |
SoundEx code - B265 bickerin - 7 freq backgrun - 16 freq boxroom - 4 freq bigger'n - 1 freq backgrund - 32 freq backruim - 2 freq bjorn - 3 freq baakgroon - 1 freq bukkrem - 1 freq bukrem - 1 freq background - 14 freq buikworm - 1 freq buggerin - 3 freq backroom - 4 freq bighorn - 1 freq bizarn - 1 freq back-room - 1 freq bookworm - 1 freq beckgrun - 1 freq backgruns - 2 freq backgrunds - 3 freq backgroonds - 1 freq busrun - 1 freq bakgrun - 1 freq buik-room - 1 freq backgroon - 1 freq €˜baikery-on-the-go - 1 freq bikerin - 1 freq boaxroom - 1 freq backgrunn - 1 freq buggerin' - 3 freq backrooms - 1 freq backgroond - 1 freq baqrmee - 1 freq biggernpolitics - 1 freq bikramyogaessex - 1 freq bikerneil - 4 freq bqwrnwmvbx - 1 freq |
MetaPhone code - BKKRN backgrun - 16 freq baakgroon - 1 freq beckgrun - 1 freq bakgrun - 1 freq backgroon - 1 freq backgrunn - 1 freq |
BAKGRUN |
| Time to execute Levenshtein function - 0.316966 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.526122 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.064935 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.074845 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.001144 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. |