Displaying 8 results from an estimated 8 matches for "wqf".
Did you mean:
wq
2013 Mar 11
1
Implementation of the PL2 weighting scheme of the DFR Framework
...n of the Binomial as the probabilistic
model (P), the Laplace law of succession to calculate the after effect of
sampling or the risk gain (L) and within document frequency normalization
H2(2) (as proposed by Amati in his PHD thesis).
The formula for w(t,d) in this scheme is given by::-
w(t,d) = wqf * L * P
where
wqf = within query frequency
L = Laplace law of after effect sampling =1 / (wdfn + 1)
P = wdfn * log (wdfn / lamda) + (lamda - wdfn) log(e) + 0.5 * log
(2 * pi * wdfn)
wdfn = wdf * (1+c * log(average length of document in database /
length of docume...
2009 Jun 21
2
CPU high usage
...rt by docid DESC during my Bool weight query
Ok, my question is, after this setup, most(90%) of my queries are 0.3-0.7
CPU per request now(using PHP binding)..
But once a while, for some term, I am still having a 6% CPU in a very simple
query (using PHP binding)...
e.g.Xapian::Query(movie:(pos=1,wqf=12))
in a 10M docs db only indexed little terms (8.6G size)
Matches Estimated 421,057 Time: 0.1850
This one uses 6.3% CPU
I wonder, what is the cause of this usage of the CPU? is it the ranker?
I already did all I can to minimize costs, what else can I do to prevent /
load balance the situtation?...
2006 Dec 16
1
Changing weights per field
I'm not entirely sure if the following is possible with xapian (didn't see
much in the way of the documentation that says it is).
I have four fields which reference a PK in our DB that I'd like to index (in
most weighted to least weighed order): full name, e-mail, title and
location. I see I how I can use add_document() to add a concatenated string
of the 4 fields, but how would I
2011 Mar 07
1
Set Term Frequency for a Query
...ncy" with the classical constructor
Xapian::Query<http://xapian.org/docs/apidoc/html/classXapian_1_1Query.html#f396e213df0d8bcffa473a75ebf228d6>(const
std::string &tname_,
Xapian::termcount<http://xapian.org/docs/apidoc/html/namespaceXapian.html#72b5a76dd8cfb7b251fe7986e86390cb>wqf_=1,
Xapian::termpos<http://xapian.org/docs/apidoc/html/namespaceXapian.html#e5a16f073d0c8ed54085a9de07248d45>pos_=0)
:
Xapian::Query query_test(Xapian::Query::OP_OR, Xapian::Query("Bonjour",
10), Xapian::Query("Hello", 5));
Xapian::TermIterator qt = query_test.get...
2018 Jan 22
2
How to get the serialise score returned in Xapian::KeyMaker->operator().
>A possible workaround (and perhaps a better approach) would be to
>set BoolWeight as the weighting scheme, then feed in your score as
>a weight using a PostingSource. Then it's available via get_weight()
>on the MSetIterator object:
>
>https://getting-started-with-xapian.readthedocs.io/en/latest/advanced/postingsource.html
>
>You may find that's faster because
2017 Feb 17
2
GSOC 2017 Project: Improving Xapian's PHP Bindings
Hello,
My name is Nihal. I am a 4th year, CSE undergraduate student at National
Institute of Technology Surathkal (NITK). I am proficient in C/C++/Java/PHP
languages.
Looking through GSOC organizations and projects. I came across Xapian. I
have looked through the project list for GSOC'17. Improving Xapian's PHP
Bindings project looked right for me. I have been reading up on the
resources
2006 Feb 07
1
Omega
Are there any options to forming queries with Omega? For instance can
you specify a proximity search like "file near 5 manager"? If so, where
might I find this documented? I don't see it in the docs directory.
Thanks
Jim.
2017 Jul 31
2
Segmentation fault in matcher/queryoptimiser
...===============
In a core dump we see that calling the `open_nearby_postlist` function
on the `hint` variable [2] falls of a cliff, resulting in a segfault:
(gdb) bt 2
#0 0x000000000001eaa1 in ?? ()
#1 0x00007fa19d09231f in LocalSubMatch::open_post_list
(this=0x13527d0, term=..., wqf=1, factor=1,
need_positions=<optimized out>, in_synonym=<optimized out>,
qopt=0x7ffe66370940, lazy_weight=false)
at matcher/localsubmatch.cc:289
the line at localsubmatch.cc:289 is
pl = hint->open_nearby_postlist(term);
Unfortunately, the compiler had o...