similar to: Change column/row-name

Hi all, I have two questions 1 - I have the version 1.4.1 of R, and it doesn't have the 'agrep' function in the base library. Is there a way to make this funcion avaliable in R 1.4.1? I mean, how to 'copy' it from R 1.8.1 and 'paste' it in R 1.4.1? 2 - The AGREP function doesn't give me the Levenshtein distance (edit distance). Is there a function in R that does

Hello all, I''m in my third month of Ruby on Rails. I think it''s coming along fairly well. My current issue is this. I''m do a search based on string data some of which is very long. So I''m doing a similar match using "amatch" gem. When I have a 50% or greater match I store the id to an array. How can I do a find looping thru the array then send the

This may be offtopic to Rails, but what are people doing to find records based on fuzzy string matches? For example, if you wanted to find a Person with name "David Heinemeier Hansson" but searched using the string "Dave Hansson". Currently I am find_by_sql that calls the PostgreSQL function "levenshtein(string1, string2)" which returns results with a score

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

Hello, guys! How's it going? I would like to offer you myself again to implement one of the ideas during the GSoC 2012. I want to take care of the "Learning To Rank" project, but I would also be glad to pick the "QueryParser reimplementation", "Dynamic Snippets", "Gmane Search improvements" or even "Replace socket code with ZeroMQ" project (I

Hi, A piece of my code that uses readBin() to read a certain file type is behaving strangely with R 2.7.0. This seems to be because of a failure to match() strings after using rawToChar() when the original was terminated with a "\0" character. Direct equality testing with == still works as expected. I can reproduce this as follows: > x <- "foo" > y <-

Hello Doug, *putting llvmdev in copy since they are concerned too* I've finally got around to finish a working implementation of the typical Levenshtein Distance with the diagonal optimization. I've tested it against the original llvm implementation and checked it on a set of ~18k by randomly generating a variation of each word and checking that both implementations would return the

Hi, I am trying to build and install LLVM onto a current Debian Linux system using gcc4 frontend binaries for Red Hat Enterprise Linux4/x86 . Using the commands below the Build finishes, ignoring an error that comes up again when I try to make install. See the messages below. I have no good feeling about the "-i -k" options. Is it OK? Thank you in advance for any advice and best

Windows make any "Levenshtein distance" into domains and fix them??? ummm.... ----- Mensaje original ----- De: "Ing. Luis Felipe Domínguez Vega" <luis.dominguez at mtz.desoft.cu> Para: "Sonic" <sonicsmith at gmail.com> CC: "samba" <samba at lists.samba.org> Enviados: Lunes, 20 de Febrero 2017 15:08:59 Asunto: Re: [Samba] strange auth

Hi, ?rawToChar 'rawToChar' converts raw bytes either to a single character string or a character vector of single bytes. (Note that a single character string could contain embedded nuls.) Allowing embedded nuls in a string might be an interesting experiment but it seems to cause some troubles to most of the string manipulation functions. A string with an embedded 0:

On Mon, 12 Feb 2007, Carsten Reuter wrote: > I am trying to build and install LLVM onto a current Debian Linux system > using gcc4 frontend binaries for Red Hat Enterprise Linux4/x86 . > Using the commands below the Build finishes, ignoring an error that > comes up again when I try to make install. > See the messages below. I have no good feeling about the "-i -k" options.

Estimados R-users: Estoy intentando usar la función 'agrep' para hacer búsquedas en cadenas de texto. El parámetro max.distance permite controlar la medida de aproximación de búsqueda de la función de Levenshtein. No obstante, cuando hago búsquedas específicas no obtengo siempre el resultado deseado y no se si es un bug o que no entiendo bien el algoritmo de búsqueda. Por

Hi, I have to match names where names can be recorded with errors or additions. Now I am searching for a string search function which returns always the "closest" match. E.g. searching for "Washington" it should return only Washington but not Washington, D.C. But it also could be that the list contains only "Hamburg" but the record I am searching for is

On Jan 15, 2011, at 8:31 AM, Matthieu Monrocq wrote: > Hello Doug, > > *putting llvmdev in copy since they are concerned too* > > I've finally got around to finish a working implementation of the typical Levenshtein Distance with the diagonal optimization. > > I've tested it against the original llvm implementation and checked it on a set of ~18k by randomly

An updated version of the Miscellaneous Psychometrics package has been updated to CRAN. The following updates are included in the package: 1) An implementation of the Stocking-Lord procedure for linking test scales. 2) An implementation of the Levenshtein algorithm for comparing character strings 3) stringProbs, a function for computing the probability of a given Levenshtein Distance 4) Three

Hi, right now we have (on R v2.7.0 patched (2008-04-23 r45466)) that: > rawToChar(raw(0)) [1] "" > rawToChar(raw(0), multiple=TRUE) character(0) Is this intended or should both return character(0)? Personally, I would prefer that an empty input vector returns an empty output vector. Same should then apply to charToRaw(), but right now we get: > x <- character(0) >

Hi, I'm running into more issues when reading data from a gzfile connection. If I read the data sequentially with successive calls to readBin(), the data I get looks ok. But if I call seek() between the successive calls to readBin(), I get corrupted data. Here is a (hopefully) reproducible example. See my sessionInfo() at the end (I'm not on Windows, where, according to the man page,

Remove the unused but set variable vq in vhost_transport_send_pkt() to fix the following GCC warning when building with 'W=1': drivers/vhost/vsock.c:198:26: warning: variable ?vq? set but not used Signed-off-by: Tobias Klauser <tklauser at distanz.ch> --- drivers/vhost/vsock.c | 3 --- 1 file changed, 3 deletions(-) diff --git a/drivers/vhost/vsock.c b/drivers/vhost/vsock.c

Remove the unused but set variable vq in vhost_transport_send_pkt() to fix the following GCC warning when building with 'W=1': drivers/vhost/vsock.c:198:26: warning: variable ?vq? set but not used Signed-off-by: Tobias Klauser <tklauser at distanz.ch> --- drivers/vhost/vsock.c | 3 --- 1 file changed, 3 deletions(-) diff --git a/drivers/vhost/vsock.c b/drivers/vhost/vsock.c

Hi, I am a new user of R using R 2.8.1 in windows 2003. I have a csv file with single column which contain the 30,000 students names. There were typo errors while entering this student names. The actual list of names is < 1000. However we dont have that list for keyword search. I am interested in grouping/cluster these names as those which are similar letter to letter. Are there any