| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uppance (0) - 1 freq tuppence (2) - 14 freq prance (2) - 5 freq pane (3) - 18 freq sclance (3) - 1 freq place (3) - 1701 freq upoan (3) - 7 freq suppan (3) - 1 freq scance (3) - 31 freq piace (3) - 2 freq suppone (3) - 12 freq uppin (3) - 1 freq upland (3) - 5 freq quitance (3) - 1 freq balance (3) - 53 freq apace (3) - 1 freq plaice (3) - 13 freq uplans (3) - 2 freq pranced (3) - 5 freq 'paece (3) - 1 freq enhance (3) - 15 freq plane (3) - 68 freq newance (3) - 4 freq upraise (3) - 1 freq unce (3) - 7 freq |
uppance (0) - 1 freq tuppence (3) - 14 freq prance (3) - 5 freq appense (4) - 1 freq prence (4) - 1 freq ponce (4) - 1 freq pence (4) - 64 freq pounce (4) - 9 freq uppin (4) - 1 freq penance (4) - 2 freq poonce (4) - 1 freq tippence (4) - 1 freq appunct (4) - 1 freq prince (4) - 346 freq spence (4) - 35 freq happence (4) - 1 freq apperance (4) - 2 freq pace (5) - 77 freq ance (5) - 72 freq audiance (5) - 1 freq expanse (5) - 8 freq princie (5) - 4 freq space (5) - 290 freq peace (5) - 269 freq ordance (5) - 1 freq |
SoundEx code - U152 upmak - 6 freq upmakkin - 1 freq upmakkit - 3 freq upmaist - 1 freq up-an-comers - 1 freq uppance - 1 freq ufonyz - 1 freq uvms - 1 freq uwbamx - 1 freq uafneucpjo - 1 freq |
MetaPhone code - UPNS uppance - 1 freq |
UPPANCE |
| Time to execute Levenshtein function - 0.326964 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.605384 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.063807 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.039568 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.050034 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. |