| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| natashadevan (0) - 1 freq natasha (5) - 3 freq gatheran (6) - 2 freq catamaran (6) - 1 freq maesharan (6) - 1 freq waashan (6) - 1 freq stacheran (6) - 1 freq waash-han (6) - 1 freq nathan (6) - 4 freq hadean (6) - 3 freq fetishaisan (6) - 1 freq narhaan (6) - 1 freq waashen (6) - 1 freq nahddan (6) - 1 freq wanshappan (6) - 1 freq non-shaetlan (6) - 1 freq gateshead (6) - 1 freq naarhan (6) - 17 freq hassendean (6) - 1 freq lampshade (6) - 1 freq sarasheridan (6) - 11 freq waanderan (6) - 1 freq ayrshireman (6) - 2 freq amyjcanavan (7) - 1 freq athein (7) - 1 freq |
natashadevan (0) - 1 freq natasha (8) - 3 freq fetishaisan (9) - 1 freq nahddan (9) - 1 freq gateshead (9) - 1 freq nathan (9) - 4 freq notished (9) - 1 freq stashed (10) - 5 freq owershadowin (10) - 1 freq nethan (10) - 3 freq naraeshun (10) - 1 freq thraivan (10) - 2 freq thievin (10) - 16 freq watshod (10) - 2 freq shadin (10) - 1 freq irishdevil (10) - 1 freq nashed (10) - 4 freq fitzhaven (10) - 1 freq nashin (10) - 3 freq sheddan (10) - 1 freq shovan (10) - 1 freq nahshon (10) - 7 freq nathin (10) - 6 freq stashd (10) - 1 freq trishdevlin (10) - 1 freq |
SoundEx code - N323 neatest - 1 freq noticed - 227 freq notict - 1 freq nithsdale - 7 freq noddy-cuddie - 1 freq notyst - 2 freq nottesed - 1 freq noteyst - 2 freq noteys't - 1 freq notteyst - 1 freq nudgit - 2 freq neediest - 1 freq noteeced - 1 freq notice't - 8 freq nudged - 5 freq naewithstannin - 1 freq nidged - 1 freq noticet - 1 freq notished - 1 freq nudest - 1 freq noteesed - 2 freq notticed - 2 freq neducation - 4 freq nddusty - 1 freq needstisherpinup - 1 freq noticd - 1 freq natashadevan - 1 freq ntcztnv - 1 freq |
MetaPhone code - NTXTFN natashadevan - 1 freq |
NATASHADEVAN |
| Time to execute Levenshtein function - 0.385764 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.837071 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.088675 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.085069 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.000967 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. |