text
stringlengths
0
32
we O
give O
a O
lower O
bound O
on O
-LRB- O
even O
the O
nondeterministic O
-RRB- O
communication B-KEY
requirements O
of O
the O
voting B-KEY
rule O
. O
The O
bounds O
match O
for O
all O
voting B-KEY
rules O
except O
STV O
and O
maximin O
. O
A O
New O
Approach O
for O
Evaluating B-KEY
Query B-KEY
Expansion I-KEY
: O
Query-Document O
Term O
Mismatch O
ABSTRACT O
The O
effectiveness O
of O
information B-KEY
retrieval I-KEY
-LRB- O
IR O
-RRB- O
systems O
is O
influenced O
by O
the O
degree O
of O
term O
overlap O
between O
user O
queries O
and O
relevant B-KEY
documents I-KEY
. O
Query-document O
term O
mismatch O
, O
whether O
partial O
or O
total O
, O
is O
a O
fact O
that O
must O
be O
dealt O
with O
by O
IR O
systems O
. O
Query B-KEY
Expansion I-KEY
-LRB- O
QE O
-RRB- O
is O
one O
method O
for O
dealing O
with O
term O