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
Hi listers
If you don't know what is the Edit Distance beetwen two strings, I will
try to explain, in fact it is very simple to understund but not to
calculate througth a program. It is simplilly the minimum number of
operations you must perform to transform string A on string B, by
operations I m
, agrep -1, agrep -2, etc. and then
assign each line the number at which it first appears.
---
Date: Wed, 11 Feb 2004 14:53:33 -0300
From: Marcos Sanches <[EMAIL PROTECTED]>
[ Add to Address Book | Block Address | Report as Spam ]
To: R Help <[EMAIL PROTECTED]>
Subject: [R]
On Wed, 11 Feb 2004 14:53:33 -0300, you wrote:
>
> 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'
>i
"Marcos Sanches" <[EMAIL PROTECTED]> writes:
>Hi listers
>
>If you don't know what is the Edit Distance beetwen two strings, I will
>try to explain, in fact it is very simple to understund but not to
>calculate througth a program. It is simplilly the minimum number of
>operations you must perform
str(a,i-1,i-1)!=substr(b,j-1,j-1)) )
# Returns the distance
m[an,bn]-1
}
---
Date: Thu, 12 Feb 2004 11:01:19 -0300
From: Rodrigo Abt <[EMAIL PROTECTED]>
To: 'Lista de Correo de R' <[EMAIL PROTECTED]>
Subject: Re: [R] AGREP
"Marcos Sanches" <[EMAIL PRO
Thanks very much, this function is just what I am looking for!!!
Marcos
-Mensagem original-
De: Gabor Grothendieck [mailto:[EMAIL PROTECTED]
Enviada em: quinta-feira, 12 de fevereiro de 2004 12:07
Para: [EMAIL PROTECTED]; [EMAIL PROTECTED]
Cc: [EMAIL PROTECTED]
Assunto: Re: [R] AGREP
> -Original Message-
> From: [EMAIL PROTECTED]
> [mailto:[EMAIL PROTECTED] On Behalf Of Gabor
> Grothendieck
> Sent: den 12 februari 2004 16:07
> To: [EMAIL PROTECTED]; [EMAIL PROTECTED]
> Subject: Re: [R] AGREP
>
> One could shorten it slightly wi
o: RE: [R] AGREP
> -Original Message-
> From: [EMAIL PROTECTED]
> [mailto:[EMAIL PROTECTED] On Behalf Of Gabor
> Grothendieck
> Sent: den 12 februari 2004 16:07
> To: [EMAIL PROTECTED]; [EMAIL PROTECTED]
> Subject: Re: [R] AGREP
>
> One could shorten it sl
The problem of calculating levenshtein distances between strings reminds
me of what I faced
years ago when writing an APL system to control interactive memory
experiments, where subjects
typed words they could remember from a given list.
To handle typos, I used the generalized outer product ope
"Marcos Sanches" <[EMAIL PROTECTED]> wrote:
Ls1<-length(s1)
Ls2<-length(s2)
for ( p in 1:ls1){
for (q in 1:ls2){
t1<-levenshteinFast(s1[p],s2[q])
...
Ls1=42000
Ls2=7
I think I will wait for months untill this pro
On Fri, 13 Feb 2004 14:45:33 +1300 (NZDT), you wrote:
>"Marcos Sanches" <[EMAIL PROTECTED]> wrote:
> Ls1<-length(s1)
> Ls2<-length(s2)
> for ( p in 1:ls1){
> for (q in 1:ls2){
>t1<-levenshteinFast(s1[p],s2[q])
>...
>
> Ls1=42000
> Ls2=7
>
12 matches
Mail list logo
