| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| keyring (0) - 2 freq kerrying (2) - 2 freq eyeing (2) - 1 freq seering (2) - 1 freq peying (2) - 4 freq peering (2) - 1 freq tearing (2) - 1 freq keyin (2) - 1 freq keating (2) - 1 freq kenning (2) - 10 freq bearing (2) - 6 freq wearing (2) - 29 freq aeyhing (2) - 1 freq keeping (2) - 44 freq keeking (2) - 1 freq weering (2) - 2 freq herring (2) - 3 freq hearing (2) - 24 freq keing (2) - 140 freq peerin (3) - 34 freq storing (3) - 2 freq ecrin (3) - 1 freq kipling (3) - 3 freq keysies (3) - 1 freq seeing (3) - 60 freq |
keyring (0) - 2 freq keeping (3) - 44 freq wearing (3) - 29 freq weering (3) - 2 freq hearing (3) - 24 freq kerrying (3) - 2 freq keing (3) - 140 freq bearing (3) - 6 freq keeking (3) - 1 freq peering (3) - 1 freq tearing (3) - 1 freq seering (3) - 1 freq keating (3) - 1 freq ring (4) - 218 freq trying (4) - 106 freq greying (4) - 2 freq king (4) - 827 freq airing (4) - 1 freq pouring (4) - 2 freq keeng (4) - 77 freq pairing (4) - 2 freq reing (4) - 2 freq daring (4) - 1 freq frying (4) - 2 freq boring (4) - 14 freq |
SoundEx code - K652 karnak - 2 freq koreans - 1 freq karen's - 9 freq kirns - 2 freq kranky - 109 freq kranky's - 2 freq kronykil - 1 freq keyring - 2 freq kronik - 1 freq kermack - 4 freq kermack's - 1 freq karmic - 1 freq kerrying - 2 freq €œkronikill - 1 freq kieran's - 1 freq krankie - 2 freq krings - 1 freq karenisathome - 6 freq karnegie - 1 freq karencotter - 1 freq kieranjack - 1 freq karengdonald - 1 freq karenstasks - 1 freq |
MetaPhone code - KRNK greenock - 40 freq guernica - 1 freq crank - 7 freq crunk - 5 freq curing - 1 freq karnak - 2 freq kranky - 109 freq crang - 2 freq crannog - 2 freq keyring - 2 freq kronik - 1 freq caring - 5 freq krankie - 2 freq carnock - 1 freq cranky - 1 freq |
KEYRING |
| Time to execute Levenshtein function - 0.222882 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.404764 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.027929 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.039218 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.001070 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. |