| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nrhlhnwoys (0) - 1 freq ahlways (5) - 1 freq nigreenways (6) - 1 freq arbuthnots (6) - 1 freq thelonious (6) - 8 freq newlands (6) - 2 freq nando's (6) - 1 freq ckhhyys (6) - 1 freq nedknwmy (6) - 1 freq hernhogs (6) - 1 freq haufweys (6) - 1 freq nintendos (6) - 1 freq righteous (6) - 8 freq gryphons (6) - 1 freq trolleys (6) - 4 freq schloss (6) - 3 freq runwey (6) - 1 freq wrangweys (6) - 1 freq alweys (6) - 44 freq railways (6) - 7 freq crannogs (6) - 1 freq religions (6) - 2 freq ither-weys (6) - 1 freq rhino (6) - 3 freq ireland's (6) - 4 freq |
nrhlhnwoys (0) - 1 freq ahlways (9) - 1 freq norlins (9) - 1 freq norlans (9) - 1 freq nahshon (10) - 7 freq nylons (10) - 1 freq relations (10) - 14 freq freshness (10) - 7 freq rahness (10) - 1 freq nearlins (10) - 6 freq unrichtous (10) - 1 freq ruchness (10) - 1 freq rhones (10) - 1 freq richness (10) - 6 freq irelan's (10) - 1 freq gihlhaus (10) - 1 freq krishnas (10) - 5 freq rhonis (10) - 1 freq rehns (10) - 1 freq rochness (10) - 2 freq neilsons (10) - 1 freq hollyhnews (10) - 1 freq nephews (10) - 6 freq nailhorns (10) - 1 freq erlines (10) - 2 freq |
SoundEx code - N645 nearlins - 6 freq norlan - 21 freq norlauns - 5 freq norlaun - 1 freq norlans - 1 freq norlin - 171 freq norln - 1 freq norland - 9 freq norlins - 1 freq neurolinguistic - 1 freq nrhlhnwoys - 1 freq |
MetaPhone code - NRLNWS nrhlhnwoys - 1 freq |
NRHLHNWOYS |
| Time to execute Levenshtein function - 0.246674 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.398095 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.028652 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.037420 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.000890 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. |