Vwr is an R package to assist in computations often needed in visual word recognition research.
As the package is listed on CRAN, it can be installed like any other official package from within R. The manual for the package can be found here.
Vwr includes functions to:
- Compute levenshtein distances between strings
- Compute hamming distances (overlap distance) between strings
- Compute neighbors based on the levenshtein and hamming distance
- Compute Coltheart’s N and average levenshtein distances (e.g., Yarkoni et al’s OLD20 measure). These functions run in parallel on multiple cores and offer a major speed advantage when computing these values for large lists of words.
The package also includes the ldknn algorithm, a method that we recently proposed to examine how balanced a lexical decision task is (i.e., how easy it is to discriminate the words from the nonwords in an experiment given no other information than the stimuli in the experiment). A preliminary version of that paper can be found here.