: That's why I was wondering how Dismax breaks it all apart. It makes sense...I
: suppose what I'd like to have is a way to tell dismax which fields NOT to
: tokenize the input for. For these fields, it would pass the full q instead of
: each part of it. Does this make sense? would it be useful at all?
the *goal* makes sense, but the implementation would be ... problematic.
you have to remember the DisMax parser's whole way of working is to make
each "chunk" of input match against any qf field, and find the highest
scoring field for each chunk, with this input...
q = some phase & qf = a b c
...you get...
( (a:some | b:some | c:some) (a:phrase | b:phrase | c:phrase) )
...even if dismax could tell that "c" was a field that should only support
exact matches, how would it fit c:"some phrase" into that structure?
I've already kinda forgotten how this thread started ... but would it make
sense to just use your "exact" fields in the pf, and have inexact versions
of them in the qf? then docs that match your input exactly should score
at the top, but less exact matches will also still match.
-Hoss
