similar to: Proposal for Integration of Bi-gram in Xapian Architecture

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

Hi all, Some days ago I attempted to submitt Syslinux as a mentoring organization for Google Summer of Code 2012, but Google rejected it. As kernel.org has been accepted as a mentoring organization, and also listed Syslinux as one of the things they intend to develop, we can work with them under their umbrella. As I'm currently the only mentor of kernel.org (for Syslinux, specifically),

Hi - any person interested in building a binding between Smalltalk and R, please contact myself or Hernan. This could be done as the Google Summer of Code (GSoC). http://www.google-melange.com/gsoc/homepage/google/gsoc2012 http://gsoc2012.esug.org/projects/r-statistics For those who don't know Smalltalk it is an Object Oriented language that was created back in the '80s in the Xerox

The deadline for student applications is 19:00 UTC on Friday 6th April: http://www.google-melange.com/gsoc/events/google/gsoc2012 That's just over 36 hours away as I write this. The deadline is sharply enforced by the melange software, and you won't get an extension, so don't leave it until the last few seconds, as you might have an unexpected internet outage. There's also no

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

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

We are equally excited about working with you over summer. I think you missed reply by Olly on IRC, you can find it in logs here: https://botbot.me/freenode/xapian/2018-04-24/?msg=99336093&page=1 - olly icebyte[m]: i think that probably needs to go through SFC ( https://sfconservancy.org/) as the "legal entity" - 2:05 am

Hello Everyone, I am a second year graduate student at IIIT-Bangalore and my interest is in the field of Information Retrieval. I have successfully compiled Xapian from source and have implemented some examples. While going through the project list Weighting Schemes project is the one I was looking to contribute to. So i went through the xapian-core/weight where most of the schemes are already

Hi Tejas, Thank you for your interest in Letor project in Xapian. We would definitely like to consider Letor for this year's GSoC project. What I would suggest you is, start playing with the code and get acquainted with it. The latest code can be obtained from http://trac.xapian.org/wiki/ GSoC2012/LTR Regards, Parth. On Wed, Jan 22, 2014 at 10:14 PM, Tejas Nikumbh <tejasnikumbh at

Hello, I have submitted my proposal for "Weighting Schemes" . if you get some time to read my proposal, I will appreciate your suggestions about it. Proposal link: http://www.google-melange.com/gsoc/proposal/review/google/gsoc2012/azeembt10cse/1 Thank you with Regards, Mohd Azeem NIT Uttarakhand -------------- next part -------------- An HTML attachment was scrubbed... URL:

Hello, I have updated my proposal for "project weighting schemes", If you get some time to read my proposal, I will appreciate your suggestions about it. proposal link: http://www.google-melange.com/gsoc/proposal/review/google/gsoc2012/azeembt10cse/1 Thank you with regards, Mohd Azeem NIT Uttarakhand -------------- next part -------------- An HTML attachment was scrubbed... URL:

Hi, I plan to propose 'Math Aware search' project. After the literature review on the topic, I found Tangent or MIaS system would be a good start. With that, I studied both of the systems well. I plan to pick Tangent because it performs better. Also, it has a good literature(thesis report and few papers available) and reference code available. I keep the summary of both the system, I

HI, Parth: Thanks for your reply. There's xapian-letor folder in current master trunk, is this code merged in 2011? the letor code of 2012 is not merged to the trunk? Regards 2013/9/23 Parth Gupta <pargup8 at gmail.com> > Dear Jiangwen Jiang, > > The current state of the project can be reached from the repo: > http://trac.xapian.org/wiki/GSoC2012/LTR > > I would

Hi All, I created a work product page for GSoC evaluation. I plan to add a couple of sections soon (bit more detail on summary, challenges, Test suite speed up work details). Also, Project plan page is not completed yet. Link: https://trac.xapian.org/wiki/GSoC2018/Maths/Work%20Product Please let me know if you have any suggestion regarding this. Regards, Guruprasad -------------- next part

I tried the suggested changes, but still haven't been able to compile the branch. Here's the log: http://pastebin.com/HR17USXR Thanks, Satwant Rana On Sun, Mar 30, 2014 at 2:37 PM, Gaurav Arora <gauravarora.daiict at gmail.com>wrote: > Hello Satwant, > > This seems to be problem with doxygen installation in the bootstrap > script. Source seems to be broken and not

I was able to successfully make the master branch of xapian, but I can't do the same for svn/clustering branch. The bootstrap fails with this log: http://pastebin.com/D1hbLp7k Can someone who has successfully installed the clustering branch tell me what am I doing wrong here? Thanks Satwant Rana -------------- next part -------------- An HTML attachment was scrubbed... URL:

Thanks, as per my knowledge, after downloading the source code, and making changes and then making sure it works properly , recompiling it and then patch it and finally submit a pull request. But what all changes should I/can I make? Please provide me some insight into this. Thanks&Regards, Hemant Kumar Singh On Apr 10 2019, at 10:56 am, Gaurav Arora <gauravarora.daiict at gmail.com>

Okay thanks, how do I make a patch and submit one? Do you have a link for the same? Thanks&Regards, Hemant Kumar Singh On Apr 10 2019, at 4:13 am, Olly Betts <olly at survex.com> wrote: > On Tue, Apr 09, 2019 at 04:07:58PM +0530, Hemant Kumar Singh wrote: > > The GSoC guide section recommends reading of the hacking. > > > I don't actually see a reference to

Hi: Does R have a function as gsorth is SAS, that perform a the Gram-Schmidt orthonormal factorization of the m ?n matrix A, where m is greater than or equal to n? That is, the GSORTH subroutine in SAS computes the column-orthonormal m ?n matrix P and the upper triangular n ?n matrix T such that A = P*T. or any other version of Gram-Schmidt orthonormal factorization? I search the help, but I