Hi Philipp,
At 10:49 pm +0100 3/7/07, Paul Elschot wrote:
On Wednesday 07 March 2007 18:12, Philipp Nanz wrote:
Thanks for your answers. Your input is really appreciated :-)
@Paul Elschot:
Thanks for the hint. I guess I could use coord() to penalize missing
terms like this:
Query: a b c
On Wednesday 07 March 2007 18:12, Philipp Nanz wrote:
> Thanks for your answers. Your input is really appreciated :-)
>
> @Paul Elschot:
> Thanks for the hint. I guess I could use coord() to penalize missing
> terms like this:
>
> Query: a b c d
> Doc A: a b c d => sloppyFreq(0) * coord(4, 4) = 1
: Query: a b c d
: Doc A: a b c d => sloppyFreq(0) * coord(4, 4) = 1
: Doc B: a b c => sloppyFreq(0) * coord(3, 4) = 0,75
:
: Doc would score higher. I guess that might be a valid solution.
: There is a drawback though, i.e. sloppyFreq(1) * coord(4, 4) = 0,5
: So a perfect match with one insertion
Thanks for your answers. Your input is really appreciated :-)
@Paul Elschot:
Thanks for the hint. I guess I could use coord() to penalize missing
terms like this:
Query: a b c d
Doc A: a b c d => sloppyFreq(0) * coord(4, 4) = 1
Doc B: a b c => sloppyFreq(0) * coord(3, 4) = 0,75
Doc would score
: My initial idea was to penalize a missing term position with its maximum
error.
:
: Consider this:
: Query: a b c d
: Document A: b c d
:
: Term a is missing, score it as if it was at the worst position possible
:
: result: b c d a
: pos. diffs: -1 -1 -1 +3
side comment: this doesn't sou
Philipp,
First off: I have no solutions, just some existing things that might
be useful.
On Tuesday 06 March 2007 01:08, Philipp Nanz wrote:
> Hello folks,
>
...
>
> Now my problem is with scoring the deletion cases.
>
> My initial idea was to penalize a missing term position with its maximum
