| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reconvened (0) - 1 freq convened (2) - 3 freq re-convenes (2) - 1 freq recovered (2) - 11 freq recommend (3) - 25 freq contened (3) - 1 freq recomended (3) - 1 freq convenes (3) - 1 freq recogneesed (3) - 1 freq reinvented (3) - 1 freq recogneezed (3) - 1 freq conveyed (3) - 2 freq reco'ered (3) - 1 freq convener (3) - 18 freq recommended (3) - 5 freq re-opened (3) - 1 freq reconised (3) - 1 freq convene (3) - 3 freq recompensed (3) - 1 freq unconvinced (4) - 1 freq convenor (4) - 3 freq recovery (4) - 13 freq reedened (4) - 4 freq recovers (4) - 1 freq reddened (4) - 1 freq |
reconvened (0) - 1 freq convened (3) - 3 freq recovered (4) - 11 freq re-convenes (4) - 1 freq conveyed (5) - 2 freq reconised (5) - 1 freq convene (5) - 3 freq reinvented (5) - 1 freq convener (5) - 18 freq recommend (5) - 25 freq convenes (5) - 1 freq contened (5) - 1 freq reconin (6) - 1 freq scrivened (6) - 1 freq recleeved (6) - 1 freq reinvent (6) - 3 freq conteined (6) - 2 freq condoned (6) - 1 freq conteened (6) - 3 freq contined (6) - 4 freq convoyed (6) - 2 freq received (6) - 53 freq renoved (6) - 1 freq contend (6) - 4 freq renowned (6) - 4 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 - RKNFNT reconvened - 1 freq |
RECONVENED |
| Time to execute Levenshtein function - 0.578243 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 - 1.116142 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.091134 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.098003 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.000910 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. |