| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pistol (0) - 28 freq pistols (1) - 18 freq pistoll (1) - 1 freq piston (1) - 2 freq pistil (1) - 3 freq peston (2) - 2 freq epistola (2) - 1 freq distil (2) - 1 freq pistons (2) - 2 freq eistok (2) - 1 freq pesto (2) - 1 freq pastor (2) - 1 freq pistils (2) - 4 freq distal (2) - 2 freq pist (2) - 3 freq pistoia (2) - 1 freq pastel (2) - 2 freq vistor (2) - 1 freq histor (2) - 6 freq bristol (2) - 4 freq bisto (2) - 1 freq pilton (2) - 1 freq postal (2) - 3 freq pits (3) - 201 freq pystle (3) - 2 freq |
pistol (0) - 28 freq pistil (1) - 3 freq epistola (2) - 1 freq postal (2) - 3 freq pistoll (2) - 1 freq pastel (2) - 2 freq piston (2) - 2 freq pistols (2) - 18 freq pistoia (3) - 1 freq pystle (3) - 2 freq distal (3) - 2 freq epistle (3) - 5 freq pist (3) - 3 freq peston (3) - 2 freq pistils (3) - 4 freq pesto (3) - 1 freq pastor (3) - 1 freq distil (3) - 1 freq pastry (4) - 9 freq post (4) - 228 freq postie (4) - 24 freq posty (4) - 1 freq posstal (4) - 1 freq pst (4) - 1 freq pasty (4) - 1 freq |
SoundEx code - P234 pystle - 2 freq post-lockdoon - 1 freq pistols - 18 freq pistol - 28 freq pestilence - 6 freq pastel-coloured - 1 freq picket-lines - 1 freq pauchtily - 1 freq pigtails - 13 freq pigtail - 3 freq pistoll-shot - 1 freq pickit-lookin - 1 freq piccadilly - 2 freq pecadillos - 1 freq pastel - 2 freq pistil - 3 freq pecht-lik - 1 freq pistils - 4 freq posstal - 1 freq postalveolar - 3 freq postaladdress - 10 freq postal - 3 freq pistoll - 1 freq pechtland - 2 freq pastless - 1 freq pastilles - 1 freq pkdhl - 1 freq postalworkersday - 1 freq |
MetaPhone code - PSTL pystle - 2 freq pistol - 28 freq pastel - 2 freq pistil - 3 freq posstal - 1 freq postal - 3 freq pistoll - 1 freq |
PISTOL |
| Time to execute Levenshtein function - 0.211604 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.344638 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.027329 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.037751 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.000924 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. |