| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| peetiable (0) - 2 freq reliable (3) - 5 freq seeable (3) - 1 freq paecable (3) - 1 freq meesrable (3) - 2 freq portable (3) - 9 freq vegetable (3) - 15 freq prestable (3) - 2 freq veesible (3) - 4 freq paeceable (3) - 4 freq deeable (3) - 1 freq peaceable (3) - 2 freq enviable (3) - 1 freq peetiful (3) - 1 freq peecial (3) - 1 freq peeble (3) - 1 freq paesable (3) - 1 freq permeable (3) - 1 freq peetie (3) - 24 freq peacably (4) - 1 freq petalled (4) - 1 freq peebles (4) - 8 freq vejitable (4) - 1 freq meeracle (4) - 5 freq teethache (4) - 2 freq |
peetiable (0) - 2 freq peetiful (4) - 1 freq paeceable (4) - 4 freq portable (4) - 9 freq peeble (4) - 1 freq paesable (4) - 1 freq peaceable (4) - 2 freq paecable (4) - 1 freq payable (5) - 1 freq playable (5) - 4 freq table (5) - 674 freq i'table (5) - 1 freq poetical (5) - 3 freq paeceably (5) - 2 freq peebly (5) - 2 freq stable (5) - 69 freq poasible (5) - 1 freq notable (5) - 5 freq repeatable (5) - 1 freq petal (5) - 10 freq pebble (5) - 9 freq sitable (5) - 2 freq teeble (5) - 6 freq reputable (5) - 3 freq suitable (5) - 13 freq |
SoundEx code - P314 paddy-field - 2 freq peetyfuul - 1 freq pitbull - 1 freq peetiable - 2 freq pot-bellied - 3 freq peetifully - 2 freq peetiful - 1 freq pitiful - 3 freq pitifully - 1 freq |
MetaPhone code - PXBL peetiable - 2 freq |
PEETIABLE |
| Time to execute Levenshtein function - 0.201803 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.369209 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.027501 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.040034 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.000845 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. |