| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reappear (0) - 6 freq reappeart (1) - 4 freq re-appear (1) - 1 freq appear (2) - 98 freq rapper (2) - 4 freq reaper (2) - 20 freq reappeared (2) - 1 freq tapper (3) - 1 freq coapper (3) - 1 freq knapper (3) - 2 freq dizappear (3) - 1 freq re-appen (3) - 1 freq appeart (3) - 80 freq pepper (3) - 83 freq chapper (3) - 2 freq reapir (3) - 1 freq rapped (3) - 4 freq wrapper (3) - 22 freq reader (3) - 89 freq capper (3) - 2 freq drapper (3) - 1 freq crapper (3) - 1 freq rasper (3) - 1 freq lapper (3) - 1 freq appar (3) - 2 freq |
reappear (0) - 6 freq rapper (2) - 4 freq re-appear (2) - 1 freq reappeart (2) - 4 freq reappeared (3) - 1 freq ripper (3) - 10 freq reepepr (3) - 1 freq appear (3) - 98 freq reaper (3) - 20 freq papper (4) - 1 freq appar (4) - 2 freq crapper (4) - 1 freq lapper (4) - 1 freq wapper (4) - 2 freq dapper (4) - 4 freq appeir (4) - 1 freq drapper (4) - 1 freq napper (4) - 36 freq rapier (4) - 2 freq rasper (4) - 1 freq reapir (4) - 1 freq pepper (4) - 83 freq capper (4) - 2 freq rapped (4) - 4 freq coapper (4) - 1 freq |
SoundEx code - R160 river - 270 freq reappear - 6 freq rubber - 54 freq riper - 4 freq reverie - 2 freq referee - 15 freq 'rubber - 1 freq repair - 15 freq rapier - 2 freq rover - 12 freq reiver - 22 freq refer - 37 freq revoir - 5 freq raver - 4 freq rapper - 4 freq raverie - 1 freq ripper - 10 freq reaper - 20 freq riever - 2 freq robbery - 8 freq reviewer - 2 freq rubbery - 7 freq rïver - 5 freq robber - 3 freq ryver - 1 freq reveiry - 1 freq reapir - 1 freq reever - 2 freq re-fere - 1 freq rubbir - 1 freq rpr - 2 freq revere - 1 freq re-appear - 1 freq riviera - 1 freq robfray - 1 freq |
MetaPhone code - RPR reappear - 6 freq riper - 4 freq wrapper - 22 freq repair - 15 freq rapier - 2 freq rapper - 4 freq ripper - 10 freq reaper - 20 freq reapir - 1 freq rpr - 2 freq re-appear - 1 freq |
REAPPEAR |
| Time to execute Levenshtein function - 0.216748 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.381397 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.031467 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.041994 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.000854 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. |