| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| quaver (0) - 2 freq quiver (1) - 6 freq quavers (1) - 2 freq quater (1) - 5 freq quavered (2) - 2 freq uvver (2) - 10 freq spaver (2) - 3 freq quaiet (2) - 4 freq quiver' (2) - 1 freq quake (2) - 7 freq shaver (2) - 2 freq aver (2) - 4 freq haver (2) - 6 freq beaver (2) - 5 freq wulver (2) - 1 freq braver (2) - 4 freq quivers (2) - 1 freq cuuver (2) - 1 freq quativer (2) - 4 freq quarter (2) - 68 freq graver (2) - 1 freq raver (2) - 4 freq swaver (2) - 1 freq slaver (2) - 6 freq quaert (2) - 1 freq |
quaver (0) - 2 freq quiver (1) - 6 freq quater (2) - 5 freq quavers (2) - 2 freq luver (3) - 8 freq cuiver (3) - 4 freq quair (3) - 15 freq quativer (3) - 4 freq waver (3) - 1 freq raver (3) - 4 freq haaver (3) - 4 freq quare (3) - 245 freq naver (3) - 3 freq quaeter (3) - 1 freq cuuver (3) - 1 freq quaiter (3) - 4 freq weaver (3) - 12 freq queer (3) - 146 freq aver (3) - 4 freq quiver' (3) - 1 freq uvver (3) - 10 freq quivers (3) - 1 freq beaver (3) - 5 freq haver (3) - 6 freq quavered (3) - 2 freq |
SoundEx code - Q160 quiver - 6 freq quaver - 2 freq quiver' - 1 freq qubare - 1 freq qxypr - 1 freq qgphr - 1 freq |
MetaPhone code - KFR cover - 147 freq quiver - 6 freq quaver - 2 freq gaffer - 35 freq kiver - 5 freq cuuver - 1 freq quiver' - 1 freq caviar - 11 freq cuiver - 4 freq 'cover - 1 freq kivver - 6 freq gfur - 1 freq caviaar - 1 freq gowfer - 1 freq caviare - 1 freq kivvver - 1 freq kaffir - 2 freq caiver - 1 freq cfar - 1 freq cuvver - 1 freq |
QUAVER |
| Time to execute Levenshtein function - 0.257784 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.405351 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.028269 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.038293 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.000904 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. |