fuzzyMatch: Function to perform approximate string matching in...

In jeroenclaes/tweetCorp: tweetCorp: A package to work with Twitter corpora

Description

This function will compare two character vectors. For each combination, it will calculate the Levenhstein distance between the needle string and the haystack string. If the distance is lower than the maximum allowed distance, the search will be discontinued and the haystack string will be returned. Therefore, it is necessary to set a reasonable threshold, as the function will return the first string with a distance below the maximum distance.

Usage

fuzzyMatch(needles, haystack, maxDistance, nthreads = 1L,
  displayProgress = TRUE)

Arguments

needles	character vector to match the database haystack vector against
haystack	character vector of possible matches
maxDistance	maximum Levenhstein distance to allow for matching
nthreads	number of threads to use to speed up the computation. Defaults to the number of CPU cores available on your machine.
displayProgress	display a progress bar (if TRUE)

Value

character vector of matches, which has the same length as the input vector. Input vector items for which no matching strings could be found return an empty string.

jeroenclaes/tweetCorp documentation built on May 27, 2019, 4:50 a.m.