| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| a-beggin (0) - 2 freq beggin (2) - 33 freq a-tearin (3) - 1 freq up-biggin (3) - 1 freq steggin (3) - 1 freq biggin (3) - 208 freq rebiggin (3) - 4 freq begin (3) - 104 freq baggin (3) - 2 freq boggin (3) - 60 freq aegin (3) - 1 freq 'biggin (3) - 6 freq anoggin (3) - 1 freq 'boggin (3) - 3 freq abettin (3) - 2 freq a-pechin (3) - 1 freq upbiggin (3) - 14 freq avengin (3) - 1 freq a-goin (3) - 1 freq a-birlin (3) - 1 freq a-seekin (3) - 1 freq beggin' (3) - 1 freq eggin (3) - 5 freq fleggin (3) - 6 freq assessin (4) - 4 freq |
a-beggin (0) - 2 freq beggin (3) - 33 freq baggin (4) - 2 freq 'biggin (4) - 6 freq upbiggin (4) - 14 freq boggin (4) - 60 freq biggin (4) - 208 freq rebiggin (4) - 4 freq up-biggin (4) - 1 freq 'boggin (4) - 3 freq a-goin (5) - 1 freq a-birlin (5) - 1 freq biggan (5) - 7 freq baggan (5) - 2 freq eggin (5) - 5 freq beggin' (5) - 1 freq fleggin (5) - 6 freq anoggin (5) - 1 freq begin (5) - 104 freq steggin (5) - 1 freq beginin (6) - 15 freq air-biggit (6) - 1 freq friggin (6) - 6 freq doggin (6) - 10 freq jaggin (6) - 9 freq |
SoundEx code - A125 absence - 20 freq affcome - 44 freq absent-mindit - 1 freq aff-chance - 1 freq abusin - 4 freq absenters - 1 freq absent - 12 freq absentin - 1 freq ayafuckinbasturt - 1 freq a-pechin - 1 freq afghanistan - 4 freq absconded - 1 freq aficionado - 1 freq a-fuckin-head - 1 freq affcums - 2 freq affcum - 3 freq aveisement - 4 freq avysins - 1 freq affgang - 1 freq avizandum - 1 freq aipsan - 1 freq affgaun - 1 freq affcomes - 3 freq aff-centre - 1 freq afghan - 1 freq absentee - 1 freq affgaeng - 1 freq a-beggin - 2 freq abusing - 1 freq absently-mindedly - 1 freq abscondit - 1 freq €œabsence - 1 freq aficionados - 1 freq afchymnsheet - 1 freq ahfqim - 1 freq afcmaybury - 2 freq afcminers - 3 freq afcsandys - 2 freq absense - 1 freq absenses - 1 freq |
MetaPhone code - ABKN a-beggin - 2 freq |
A-BEGGIN |
| Time to execute Levenshtein function - 0.226946 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.419417 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.027719 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.038906 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.000877 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. |