| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| absense (0) - 1 freq absence (1) - 20 freq absenses (1) - 1 freq absentee (2) - 1 freq absent (2) - 12 freq nansense (2) - 1 freq sense (2) - 513 freq appense (2) - 1 freq insense (2) - 7 freq abene (2) - 1 freq beenie (3) - 5 freq acceese (3) - 2 freq license (3) - 12 freq incense (3) - 10 freq bene (3) - 106 freq brens (3) - 1 freq assessed (3) - 6 freq aisse (3) - 4 freq appease (3) - 8 freq ableize (3) - 1 freq abyne (3) - 2 freq abbeys (3) - 3 freq vosene (3) - 1 freq aksent (3) - 4 freq flense (3) - 1 freq |
absense (0) - 1 freq absenses (2) - 1 freq absence (2) - 20 freq busens (3) - 1 freq insense (3) - 7 freq sense (3) - 513 freq absent (3) - 12 freq absentee (3) - 1 freq aesins (4) - 1 freq blens (4) - 1 freq sinse (4) - 19 freq aisins (4) - 1 freq sonse (4) - 5 freq bosons (4) - 1 freq abuses (4) - 4 freq baens (4) - 3 freq bens (4) - 43 freq basins (4) - 1 freq abene (4) - 1 freq appense (4) - 1 freq nansense (4) - 1 freq abins (4) - 1 freq ibsen (4) - 2 freq brens (4) - 1 freq sens (4) - 6 freq |
SoundEx code - A125 absence - 20 freq affcome - 44 freq absent-mindit - 1 freq aff-chance - 1 freq abusin - 3 freq absenters - 1 freq absent - 12 freq absentin - 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 - ABSNS absence - 20 freq €œabsence - 1 freq absense - 1 freq |
ABSENSE |
| Time to execute Levenshtein function - 0.265531 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.380873 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.028998 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.048923 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.000850 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. |