search for: lazybc

...ely sounds like this is worth following up. Based on a little bit of playing around, it's quite clear that I don't understand what's going on. The examples show things like agrep("lasy","lazy",max=list(sub=0)) which makes sense, but agrep("lasy","lazybc",max=1) agrep("lasy","lazybc",max=0.001) agrep("lasy","layt",max=list(all=1)) and agrep("x",c("x","xy","xyz","xyza"),max=list(insertions=2)) agrep("x",c("x","xy","xyz&...

The documentation for agrep says it uses the Levenshtein edit distance, but it seems to get this wrong in certain cases when there is a combination of deletions and substitutions. For example: > agrep("abcd", "abcxyz", max.distance=1) [1] 1 That should've been a no-match. The edit distance between those strings is 3 (1 substitution, 2 deletions), but agrep matches