| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| resembles (0) - 8 freq resembled (1) - 6 freq resemble (1) - 3 freq resemmle (2) - 2 freq resemblin (2) - 6 freq assembles (2) - 1 freq reserves (3) - 4 freq rumbles (3) - 3 freq peebles (3) - 8 freq ensemble (3) - 4 freq assemblet (3) - 1 freq assemble (3) - 3 freq reassemblet (3) - 1 freq reevles (3) - 1 freq trembles (3) - 2 freq resembling (3) - 1 freq remember (3) - 191 freq remembers (3) - 10 freq assembled (3) - 15 freq resemblence (3) - 1 freq reassembled (3) - 1 freq resemblances (3) - 2 freq renewables (3) - 3 freq resiles (3) - 1 freq exemples (3) - 7 freq |
resembles (0) - 8 freq resemble (2) - 3 freq resembled (2) - 6 freq resemblin (3) - 6 freq assembles (3) - 1 freq rumbles (4) - 3 freq resemmle (4) - 2 freq reassembled (5) - 1 freq resemblence (5) - 1 freq resemblances (5) - 2 freq assembled (5) - 15 freq renewables (5) - 3 freq remembers (5) - 10 freq resiles (5) - 1 freq seembols (5) - 3 freq reassemble (5) - 1 freq assemble (5) - 3 freq ensemble (5) - 4 freq reassemblet (5) - 1 freq assemblet (5) - 1 freq resembling (5) - 1 freq trembles (5) - 2 freq simples (6) - 10 freq sibbles (6) - 1 freq smiles (6) - 110 freq |
SoundEx code - R251 resumption - 1 freq reassembled - 1 freq resembles - 8 freq rognvald - 6 freq rosin-fite - 1 freq reasonable - 21 freq resembled - 6 freq resemble - 3 freq resemblin - 6 freq resemblance - 6 freq resemblence - 1 freq reasonably - 5 freq raisonable - 1 freq resembling - 1 freq raesonable-sized - 1 freq recompense - 3 freq resemblances - 2 freq raisonablie - 1 freq resounable - 1 freq raesonable - 1 freq recumbent - 2 freq re-convenes - 1 freq reconvened - 1 freq reassemblet - 1 freq reassemble - 1 freq reasonablie - 1 freq recompance - 2 freq recompence - 2 freq €˜recompance - 1 freq €˜recompence - 1 freq recompensed - 1 freq rzmpm - 1 freq rossmable - 1 freq rogjnfx - 1 freq |
MetaPhone code - RSMLS resembles - 8 freq |
RESEMBLES |
| Time to execute Levenshtein function - 0.242978 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.402862 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.027548 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.037628 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.000993 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. |