| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| possels (0) - 8 freq tossels (1) - 1 freq possess (1) - 10 freq posies (2) - 6 freq posse (2) - 4 freq posers (2) - 5 freq dossers (2) - 3 freq mosses (2) - 6 freq 'possels' (2) - 1 freq losses (2) - 15 freq morsels (2) - 4 freq pusses (2) - 6 freq tossils (2) - 1 freq tossers (2) - 7 freq tossel (2) - 1 freq hostels (2) - 1 freq tosses (2) - 3 freq gospels (2) - 9 freq prossess (2) - 1 freq possesst (2) - 1 freq poses (2) - 2 freq passes (2) - 68 freq dosses (2) - 2 freq oorsels (2) - 140 freq fossils (2) - 9 freq |
possels (0) - 8 freq possess (2) - 10 freq tossels (2) - 1 freq passes (3) - 68 freq tossils (3) - 1 freq pisses (3) - 4 freq pusses (3) - 6 freq mussels (3) - 5 freq vessels (3) - 6 freq fossils (3) - 9 freq dosses (4) - 2 freq oorsels (4) - 140 freq possters (4) - 1 freq corsels (4) - 1 freq missals (4) - 1 freq vassals (4) - 2 freq pussy's (4) - 1 freq possibles (4) - 1 freq pistils (4) - 4 freq pistols (4) - 18 freq posters (4) - 28 freq bosses (4) - 9 freq posse (4) - 4 freq 'possels' (4) - 1 freq losses (4) - 15 freq |
SoundEx code - P242 puggie-like - 1 freq possels - 8 freq 'possels' - 1 freq pixels - 2 freq paisley's - 2 freq puzzles-ah - 1 freq puzzles - 3 freq puckles - 14 freq pschological - 1 freq pauciloquent - 1 freq pucklies - 4 freq pawkie-lik - 1 freq physiologic - 2 freq pickles - 2 freq physiology - 1 freq |
MetaPhone code - PSLS possels - 8 freq 'possels' - 1 freq paisley's - 2 freq puzzles-ah - 1 freq puzzles - 3 freq |
POSSELS |
| Time to execute Levenshtein function - 0.254453 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.449640 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.028064 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.040193 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.000807 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. |