similar to: choosing between probabilistic and boolean prefixes for terms

I have an application for synonyms for tags in in notmuch, which means synonym expansion for a particular boolean prefix. I have a vague memory of Olly telling me this doesn't work, but I'm not sure about the details. My higher level goal is to support a kind of indirection with tags, where query tag:foo can really generate tag:bar or tag:fub, depending on some kind of configuration.

Hello, I'm using the XS Perl bindings packaged with Debian stable and am interested in implementing my a custom ValueRangeProcessor (using DateTimeX::Easy for human-friendly date parsing) Unfortunately, I'm not sure if it's possible with the add_valuerangeprocessor API via Perl. Reading the XS/*ValueRangeProcessor.xs source files, I'm seeing "process_value_range"

Olly Betts <olly at survex.com> writes: > A better option for this is probably a FieldProcessor - you set one for > a prefix and the it gets passed the value and returns a Query object > for it. E.g. in lua (where you can just pass an anon function for the > FieldProcessor - we ought to support C++11 lambdas for such things): By the way, is there an online version of the

On Sun, Dec 27, 2015 at 11:24:36PM -0400, David Bremner wrote: > I have an application for synonyms for tags in in notmuch, which means > synonym expansion for a particular boolean prefix. I have a vague memory > of Olly telling me this doesn't work, but I'm not sure about the > details. Yes, synonym expansion isn't done for boolean terms (only "probabilistic

Olly Betts <olly at survex.com> writes: > A better option for this is probably a FieldProcessor - you set one for > a prefix and the it gets passed the value and returns a Query object > for it. E.g. in lua (where you can just pass an anon function for the > FieldProcessor - we ought to support C++11 lambdas for such things): [snip] > To achieve this with synonyms in a

Hi guys I'm trying to figure out how I can use probabilistic searching on a given field within a document; I've written to the list about this before, but haven't quite figured out what's required and, following a little research, I think I understand what I need to do but I'd like a clarification on this. o We have a database of a number of documents, with fields: title,

I've got a small test database setup with one record. $ delve -r 1 -V /tmp/1/ Values for record #1: 0:DD4F2162FFFF0E43741A4A1C2B8EC0E7 1:./Text_page_scan_2.jpg 2:jpg 3:.jpg Term List for record #1: E:.jpg P:./Text_page_scan_2.jpg Q:DD4F2162FFFF0E43741A4A1C2B8EC0E7 T:jpg The terms were added with lines like this: doc.add_term(string("P:") + path); Problem is, I can't seem to

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! Alls ???? i have read code of xapian more than one month,i leant a lot from your code both form design of search engine and code details. ???? however, something make me in a puzzle. ? ?? Take? RefCntBase as an example, it seems that it is a "kernel" of xapian, as many classes inherit from it. But,what is it funtion? why is it so important? ???? Another confusion is about

Hi! Alls ???? i have read code of xapian more than one month,i leant a lot from your code both form design of search engine and code details. ???? however, something make me in a puzzle. ? ?? Take? RefCntBase as an example, it seems that it is a "kernel" of xapian, as many classes inherit from it. But,what is it funtion? why is it so important? ???? Another confusion is about

On Tue, Jan 05, 2016 at 08:43:13AM -0400, David Bremner wrote: > Olly Betts <olly at survex.com> writes: > > > To achieve this with synonyms in a configurable way you'd need to > > rewrite the synonyms in the database to match the current configuration, > > so it's not as dynamic as the above. > > Well, the configuration needs to be somewhere. Would

Hello, include <iostream>#include <string>#include <xapian.h>struct document{ std::string title; std::string content; std::string url;}; void indexData(document d) { try { Xapian::WritableDatabase db("/Users/ramesh/Desktop/xapian", Xapian::DB_CREATE_OR_OPEN); Xapian::TermGenerator indexer; Xapian::Stem

Hello, include <iostream>#include <string>#include <xapian.h>struct document{ std::string title; std::string content; std::string url;}; void indexData(document d) { try { Xapian::WritableDatabase db("/Users/ramesh/Desktop/xapian", Xapian::DB_CREATE_OR_OPEN); Xapian::TermGenerator indexer; Xapian::Stem

olly wrote: > SVN root: svn://svn.xapian.org/xapian > Changes by: olly > Revision: 9476 > Date: 2007-10-19 03:47:11 +0100 (Fri, 19 Oct 2007) > > Log message (14 lines): > include/xapian/queryparser.h,queryparser/queryparser.cc, > queryparser/queryparser.lemony,queryparser/queryparser_internal.h, > tests/queryparsertest.cc: Since calling

On Sun, Sep 30, 2018 at 09:05:25AM -0300, David Bremner wrote: > if (str.find (' ') != std::string::npos) > query_str = '"' + str + '"'; > else > query_str = str; > > return parser.parse_query (query_str, NOTMUCH_QUERY_PARSER_FLAGS, term_prefix); I wouldn't recommend trying to generate strings to feed to

I think we want to apply the following patch to make the NumberValueRangeProcessor documentation (a) make sense, and (b) accurate: ---------------------------------------------------------------------- --- include/xapian/queryparser.h (revision 9993) +++ include/xapian/queryparser.h (working copy) @@ -213,7 +213,7 @@ * * For example, if str_ is "$" and prefix_

Hi, I'm working on a classification problem and one of the methods I'd like to use are neural networks. I've been using nnet to build a classification network. However I would like to have the probabilities associated with the prediction. Are there any implementations of probabilistic neural networks available in R? thanks,

Dear R Community, I first apoligize to ask statistical questions of general domain, probably beyond the mere use of R. I want to analyze the following type of data with R . Total annual fisheries landings have been reported during 1950-2007 from a given fishery area. I am dealing with annual fisheries landings proportions (LP) estimated for trophic level (TL) classes of 0.1increment, i.e. each

Hello, I'm a new user to R and need some help coding a mathmatically simple aggregation of normal distributions. I have three normal distributions: A ~ N(8.51, 4.24^2) B ~ N(7.57, 3.62^2) C ~ N(10.84, 6.59^2) with correlation coefficients of: rho(AB) = 0.710 rho(AC) = 0.263 rho(BC) = 0.503 and I want to simulate Z = A + B + C, showing the results on a plot and fitting a distribution to the

Hello, I want to let user specify by drop down list to what fields his query will be searched. For example "Full-text" or "Title+Author", then user enters search query as usual (without using prefixes). But how to modify query so it cover two fields in a right way? For a starter how I think about modifying query to limit it just to single globally selected field: 1. after