| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| a-pechin (0) - 1 freq a-poohin (2) - 1 freq pechin (2) - 86 freq flechin (3) - 1 freq keechin (3) - 5 freq seechin (3) - 1 freq expectin (3) - 66 freq hechin (3) - 3 freq sechin (3) - 2 freq peching (3) - 1 freq airchin (3) - 3 freq wheechin (3) - 40 freq spehin (3) - 1 freq expeckin (3) - 21 freq leechin (3) - 1 freq sprechin (3) - 1 freq appearin (3) - 23 freq apenin (3) - 10 freq pechit (3) - 1 freq appenin (3) - 3 freq appealin (3) - 6 freq screchin (3) - 1 freq skechin (3) - 1 freq peckin (3) - 16 freq baechin (3) - 1 freq |
a-pechin (0) - 1 freq pechin (3) - 86 freq a-poohin (3) - 1 freq pechan (4) - 2 freq archin (5) - 1 freq achin (5) - 14 freq keechin (5) - 5 freq stechin (5) - 7 freq peckin (5) - 16 freq baechin (5) - 1 freq poachin (5) - 5 freq brechin (5) - 14 freq peghin (5) - 1 freq flechin (5) - 1 freq fieechin (5) - 1 freq toopachin (5) - 1 freq impectin (5) - 1 freq pechit (5) - 1 freq skechin (5) - 1 freq airchin (5) - 3 freq wheechin (5) - 40 freq spehin (5) - 1 freq peching (5) - 1 freq sechin (5) - 2 freq seechin (5) - 1 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 - APXN a-pechin - 1 freq |
A-PECHIN |
| Time to execute Levenshtein function - 0.189636 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.390377 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.031286 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.046062 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.000887 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. |