Datasets:
taidng
/
WikiSER

Dataset card Viewer Files Community
1
text
stringlengths
3
233
whether O
a O
word O
of O
student O
input O
matched O
a O
word O
of O
the O
pattern O
, O
the O
Hamming O
distance O
between O
the O
two O
bit B-Data_Structure
vectors I-Data_Structure
was O
used O
as O
a O
measure O
of O
the O
degree O
of O
difference O
between O
the O
words O
. O
</s>
<s>
Split O
: O
To O
split O
a O
weight-balanced B-Data_Structure
tree I-Data_Structure
into O
two O
smaller O
trees O
, O
those O
smaller O
than O
key O
x O
, O
and O
those O
larger O
than O
key O
x O
, O
first O
draw O
a O
path O
from O
the O
root O
by O
inserting O
x O
into O
the O
tree O
. O
</s>
<s>
A O
common O
optimization O
is O
to O
put O
the O
unsorted O
elements O
of O
the O
buckets O
back O
in O
the O
original O
array B-Data_Structure
first O
, O
then O
run O
insertion B-Algorithm