similar to: [LLVMdev] Spell Correction Efficiency

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

Just a reminder that today is the last day for pre-release2 testing. Thanks, Tanya

On Oct 21, 2009, at 3:44 PM, Tanya Lattner wrote: > Just a reminder that today is the last day for pre-release2 testing. > Hi Tanya, Attached are the log files for Mac OS X 10.5.8 on PowerPC. There are these failures for clang: ******************** Failing Tests (20): /Volumes/SandBox/2.6/llvm-2.6/tools/clang/test/CodeGen/ always_inline.c

Hi all, I have jotted down a plan for how to handle or add Bi-gram in Query Object though QueryParser. PFA as a sequence diagram which depicts what i got to know about how parser works and query is build from tokens provided by the lexer.I have highlighted some area in blue where i think there is possibility of having bi-grams.While Integrating bi-gram in the Parser ,Query our aim is to generate

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi all, this is probably simple and I'm just doing something stupid, sorry about that :-) I'm trying to convert words (strings of letters) into a fairly small dimensional space (say 10, but anything between about 5 and 50 would be ok), which I will call a feature vector. The the distance between two words represents the similarity of the

On Mon, Apr 11, 2016 at 09:54:36AM +0200, Jean-Francois Dockes wrote: > This way, "to be or not to be" gets from 11 S to 0.6 S, and "to be of > the" gets from 12 S to 0.9 S. Which is of course brilliant ! > > I think that I can dump my plan of indexing compound terms for runs of > common words :) We had been experimenting with bigrams to accelerate phrases, and

Hi all, I 've got a question about the usage of loess in the modreg package. The documentation (loess.html) states that the smoothing window is either set by span or enp.target. If span is used, the details section of the docs state... <SNIP> DETAILS Fitting is done locally. That is, for the fit at point x, the fit is made using points in a neighbourhood of x, weighted by their

Hi all, I 've got a question about the usage of loess in the modreg package. The documentation (loess.html) states that the smoothing window is either set by span or enp.target. If span is used, the details section of the docs state... <SNIP> DETAILS Fitting is done locally. That is, for the fit at point x, the fit is made using points in a neighbourhood of x, weighted by their

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

Hi, I am very happy. My problems are solved without one little thing: (Iske <- matrix(c(1, 1, 1, 2, 2, 2, 1, 1, 1, 5, 1, 2, 2, 2, 1, 1, 1, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 2), ncol = 5)) #My Matrix Iske<- Iske+33 #I want see the letters (Iske.char<-apply(Iske, 1, function(x) rawToChar(as.raw(x)))) #Numbers to

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

Hi, I have made a proposal for changes to integrate bi-grams in Xapian Architecture on Wiki page. Bigram Integration Proposal: http://trac.xapian.org/wiki/GSoC2012/Bi-gram%20Language%20Modeling/Bi-gram%20Integration%20Proposal Since Bi-gram integration will make some difference in how data is accessed from the back-end so its better to get review from whole comunity.Moreover i also have some

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, 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

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

Hello Sir, I am a third-year student at the Department of mathematics at IIT Kharagpur. I have good experience in Information Retrieval and Machine Learning. I have read many chapters of the book Introduction to Information Retrieval. Recently I am doing a project on tagging a question on a Q&A Forum using ranking the tags and probabilistic inference. I also have software development

Hello, We would like to create Google or Firefox like "search hints". If someone types "abc", the search system should name some possible hints. I think, Firefox does it by indexing 3-characters of the domain name. If you enter parts, you get some hints. Thank you very much Marcus

On 2008-11-04, at 08:12, Sebastian Redl wrote: > Mike Stump wrote: >> On Nov 3, 2008, at 1:39 PM, Sebastian Redl wrote: >>>> svn help cl >>>> >>>> [ runs away, much the same way someone that throws a lighted match >>>> into a pool of gasoline ] Probably wise. >>> "cl": unknown command. >> >> From svn 1.5:

Hi All, We have populated info in the Clang Sema i.e class Sema (include/clang/Sema/Sema.h) and like to propagate the same to Clang Codegen . Currently we are propagating through ASTContext ,where we have duplicating fields info and operation in the Sema and ASTContext . Any better way of doing the same ? Thank you ~Umesh

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