| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yaisable (0) - 1 freq visable (2) - 1 freq yaisage (2) - 4 freq faisible (2) - 3 freq disable (2) - 1 freq paesable (2) - 1 freq veisible (3) - 1 freq realisable (3) - 1 freq parable (3) - 54 freq affable (3) - 1 freq disabled (3) - 7 freq advisable (3) - 4 freq aisle (3) - 27 freq palpable (3) - 3 freq maistile (3) - 1 freq amicable (3) - 2 freq liable (3) - 4 freq suitable (3) - 13 freq yable (3) - 7 freq available (3) - 128 freq warkable (3) - 1 freq payable (3) - 1 freq capable (3) - 25 freq arable (3) - 8 freq gangable (3) - 1 freq |
yaisable (0) - 1 freq paesable (3) - 1 freq disable (3) - 1 freq sable (3) - 2 freq faisible (3) - 3 freq visable (3) - 1 freq isabel (4) - 40 freq risible (4) - 1 freq yibble (4) - 3 freq seeable (4) - 1 freq sitable (4) - 2 freq amiable (4) - 1 freq taible (4) - 2 freq yaisual (4) - 1 freq viable (4) - 11 freq yaisually (4) - 3 freq ansible (4) - 2 freq yaishly (4) - 1 freq arable (4) - 8 freq aible (4) - 2 freq saveable (4) - 1 freq visible (4) - 25 freq yabble (4) - 1 freq yable (4) - 7 freq liable (4) - 4 freq |
SoundEx code - Y214 ys-bloo - 1 freq yaisable - 1 freq yeusfil - 2 freq |
MetaPhone code - YSBL yaisable - 1 freq |
YAISABLE |
| Time to execute Levenshtein function - 0.185854 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.348302 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.027318 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.037231 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.000927 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. |