| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| superb (0) - 16 freq super (1) - 36 freq suburb (2) - 4 freq sperm (2) - 5 freq surer' (2) - 1 freq sumer (2) - 1 freq suppers (2) - 22 freq suger (2) - 1 freq sper (2) - 1 freq suner (2) - 3 freq supper (2) - 171 freq sugery (2) - 1 freq rupert (2) - 17 freq superbly (2) - 1 freq sperk (2) - 3 freq supersub (2) - 1 freq snpers (2) - 2 freq surest (3) - 1 freq speert (3) - 27 freq suffre (3) - 1 freq buyers (3) - 5 freq ruders (3) - 1 freq curers (3) - 1 freq sipper (3) - 6 freq sure's (3) - 3 freq |
superb (0) - 16 freq super (2) - 36 freq supersub (3) - 1 freq sper (3) - 1 freq superbly (3) - 1 freq sperk (3) - 3 freq suburb (3) - 4 freq sperm (3) - 5 freq spirl (4) - 4 freq spurn (4) - 2 freq seperat (4) - 1 freq speir (4) - 212 freq sprp (4) - 1 freq speerd (4) - 7 freq spurs (4) - 17 freq spar (4) - 14 freq asper- (4) - 1 freq spire (4) - 5 freq spark (4) - 35 freq speris (4) - 1 freq supreme (4) - 15 freq sapr (4) - 1 freq sport (4) - 153 freq sporf (4) - 1 freq sperse (4) - 1 freq |
SoundEx code - S161 spraff - 3 freq soporific - 2 freq suburban - 5 freq spray-painted - 2 freq sperfilt - 3 freq superpooers - 1 freq suburbs - 7 freq supervisor - 3 freq supervise - 3 freq superviser - 1 freq super-bricht - 2 freq supervitamin - 2 freq spray-pintit - 1 freq superfluous - 1 freq superb - 16 freq superficial - 3 freq soporiferissniss - 1 freq sparrabaldy - 1 freq spray-pent - 1 freq supervisin - 1 freq supervises - 1 freq super-bitch - 1 freq superfoam - 1 freq superfeeciality - 1 freq superfeecial - 1 freq spraffin - 6 freq spraffed - 2 freq superbly - 1 freq superabundance - 1 freq superpowers - 1 freq suburb - 4 freq sprp - 1 freq shoveyerbingo - 1 freq supervet - 1 freq superpower - 1 freq supervised - 1 freq sporf - 1 freq superbly-named - 1 freq |
MetaPhone code - SPRB superb - 16 freq |
SUPERB |
| Time to execute Levenshtein function - 0.360627 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.360404 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.027302 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.036848 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.000888 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. |