similar to: Project: QueryParser Reimplementation, to Olly Betts and Dan Colish

Hello, My name is Sean Mikalson. I am a second year Software Engineering student with a combined degree in Philosophy. I am interested in participating with Xapian in GSOC this year and a couple of projects have initially caught my eye: - Dynamic Snippets - QueryParser Reimplementation I have good working knowledge in C/C++, Java and SQL (specifically Transact-SQL). In order to determine

hello everyone, I am Maheshwar, a prefinal year Computer Science undergraduate student at BITS-Pilani, India. When i was going through the GSOC ideas , i felt interested in Quesry parser project. Till now i have implemented a couple of LL(1) parsers as a part of my assignment in Compiler construction course, so i would love to join and contribute to this project. So can any one tell me how to go

Hello, I am Sehaj Singh Kalra, an Indian student. I am an undergraduation student in Indian Institute of Technology-Delhi (IIT-Delhi) pursuing Computer Science and Engineering. I want to work on the idea "QueryParser Reimplementation ". With the background I have in this field, I am fully comfortable with this project. I have went through the specification and through Query Parser

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

Olly Betts, Has anyone tested the new Edit Distance(SQLServer) algorithm compared to the current one? If you need any inditional information or code, please let us know. Thank you.

Hi all, I wrote a program that implement the variable length encoding and fixed length encoding, and compares their index size and speed of search doc length. You can see the comparison result from the attachment snapshot. 1. The posting list is in all memory; 2. The search strategy of fixed length encoding is skipping with exponential step (1, 2, 4, 8, ...). Once exceeds the desired doc id, back

I don't know whether this is a BUG or for special purpose... According to the definition of "xapian/queryparser.h", FLAG_AUTO_MULTIWORD_SYNONYMS contains bit of FLAG_AUTO_SYNONYMS . Therefore, long as I set the parse flag with FLAG_AUTO_SYNONYMS, the query parser will automatically activate the function of FLAG_AUTO_MULTIWORD_SYNONYMS. See the below source code part from

Dear R team, The following piece of code (to use the lsa package) works fine on my mac os x, but when I run the same code on Windows XP, it doesn't work any more. ### code: library("lsa") matrix1 = textmatrix("C:\\Documents and Settings\\tine stalmans.TINE. 000\\LSA\\cuentos\\", stemming=TRUE, language="spanish", minWordLength=2, minDocFreq=1,

Hi, I''ve implemented synonym searching in my rails application but have an idea I''d like to implement but can''t figure out how to do. The idea is that I''d like to give the end user the choice on whether to search for the synonym of a word or not. Preferably by extending the query language to parse a construct similar to ''%word1'' and

Xapian is a very excellent open source search engine library, but there is no native support for Chinese word segmentation in queryparser and termgenerator. Therefore, I modified small amount of source codes, integrated into the SCWS tokenizer, that is the same open-source and developped by myself. Anyone can obtain the patch from below URL. After patching, Xapian::QueryParser::parse_query and

Hi Xapianers: My name is Weixian Zhou, Computer Science student of University at Buffalo, State University of New York. I am interested in the project of posting list encoding improvements and weighting schemes. I have some questions toward them. 1) After read the comments in brass_postlist.cc, I am still not very clear about the detailed structure of postings list. If you can provide some simple

Hello. There are several problems I couldn't find a solution. 1. QueryParser does not perform stemming I am working with PHP5 and use the xapian wrapper written by Daniel M?nard I build a query using parseQuery. Output of the parsed query shows that terms are not stemmed, although a stemmer is set ( see code snippet) # create a XapianDatabase object to search in $db = new

Hello, I've been working on the KMeans clustering algorithm recently and since the past week, I have been stuck on a problem which I'm not able to find a solution to. Since we are representing documents as Tf-idf vectors, they are really sparse vectors (a usual corpus can have around 5000 terms). So it gets really difficult to represent these sparse vectors in a way that would be

Hi to all, First, I would like to say a big thank you for the work which was done on my 'wish bug' to allow mapping one field to multiple prefixes (http://www.xapian.org/cgi-bin/bugzilla/show_bug.cgi?id=93). That's great! I have upgraded to 1.0.4 and I am revisiting my code, replacing the php query parser I wrote with Xapian's one. Everything works well, but I have some

Hi there, My name is Julia Wilson and I'm a grad student in Computational Linguistics at Brandeis University. As a GSoC project I'm interested in improving Japanese language support, and I had a couple of questions for the application I'm putting together. I know Japanese - I'm not a native speaker by any means, but I'm pretty good - and I'm really interested in the

--- search-xapian/XS/QueryParser.xs | 6 ++++++ search-xapian/Xapian/QueryParser.pm | 7 +++++++ xapian-core/include/xapian/queryparser.h | 3 +++ xapian-core/queryparser/queryparser.cc | 6 ++++++ xapian-core/queryparser/queryparser.lemony | 9 +++++++++ xapian-core/queryparser/queryparser_internal.h | 4 +++- 6 files changed, 34

Hello, First I wanted to say thanks for a great piece of software, thanks Olly and others who've contributed! I know that Xapian supports right-truncating, if that's the proper name for wildcard support, as in a search for "xapia*". I don't believe Xapian supports wildcards on both sides of a term, correct? Is this something that is technically unfeasable, unpalatable

Hi, I'm using xapian to build my search engine, but met with a problem. The code snippet is like: ----------------------Code begin------------------------------------------------------------- Xapian::QueryParser qp; qp.add_prefix("Singer", "S"); Xapian::Query query = qp.parse_query("Singer:s.h.e",

Hi all, Thanks to the authors for the amazing work on Ferret! I have a question about setting up the standard operators on a QueryParser. I would like my parser to default to AND queries rather than the default OR. In Java I would simply do: QueryParser parser = new QueryParser("contents", new StandardAnalyzer()); parser.setDefaultOperator(QueryParser.Operator.AND); But I

I cooked up a little script to show what I mean. This doesn''t look right to me, but maybe I just completely misunderstand QueryParser. Same output on mswin32, unix, ferret 0.9 and 0.10 Cheers, Sam require ''rubygems'' require ''ferret'' p Ferret::VERSION # 0.10.6 index = Ferret::Index::Index.new() index << {:title => "Programming