leven: Find Levenshtein distance between many strings

Description Usage Arguments Value Author(s) References

View source: R/leven.R

Description

Find Levenshtein distance between many strings

Usage

1
2
3
leven(strings1, strings2 = NULL, oneToOne = FALSE, homoLimit = 0,
  vocal = 0, prepend = NULL, append = NULL, substring1 = FALSE,
  substring2 = FALSE, nThreads = 1)

Arguments

strings1

vector of strings to compare to strings2 (or as strings1 x strings1 if strings2==NULL)

strings2

vector of strings to compare to strings1 or NULL (either strings1 or strings2 should be 1 or should have equal lengths)

oneToOne

compare strings1[1] to strings2[1], strings1[2] to strings2[2],... (both vectors must be same length)

homoLimit

deletions or insertions in homopolymers > homoLimit cost 0

vocal

Integer to display a status message every vocal iterations

prepend

1 or 2 for ends-free on front of string 1 or 2

append

1 or 2 for ends-free on back of string 1 or 2

substring1

ends-free for strings1

substring2

ends-free for strings2

nThreads

Run using threads?

Value

Levenshtein distance matrix

Author(s)

Scott Sherrill-Mix [email protected]

References

http://en.wikipedia.org/wiki/Levenshtein_distance


sherrillmix/levenR documentation built on May 26, 2017, 8:08 a.m.