order of previous and upcoming words in an answer using positional indexing, .... submitted answers are then chec6ed by the automatic answer evaluator.
Available online at www.sciencedirect.com
ScienceDirect Procedia Computer Science 58 (2015) 257 – 264
. ' * $ .*/0
% % % 12 , 1 %' #$ / #3 %$ 4 &3 4 )5
( 1, ' 6 1, 2, ' 123 $ $, , 7$ + $ 123 6 + ++ $ 6 , '3 & %3 + $ $ ' + , & + 83 ' + $ $ +&6 #$ $ &' +3 , 0 $ $0 3 , ' 1% #$3 , $ + , , 9,3 & $ 6' &' $ $ % + $ , , 1%3 6' , $6 $: 6 ++ + $ , $ , ,$ $ $ ' ,, 9, 12 ©" #$ % $ &$ &' ( )* 2015 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/). &' + ,-, + $ . ' * $ Peer-review under responsibility of organizing committee of the Second International Symposium on Computer Vision and the Internet .*/0 (VisionNet’15)
( ,31 %'3 1, 2, '3 .9,;
( 1, 6 + $ + $ #$ &' + ++ 1, 2, ' 12 $ $ $ %3 ++ , + +9&' $ $3 $ $ & 1, 2, ' + + ,, 3 ' 6, #$ 12 . , $ 3 3
1877-0509 © 2015 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/). Peer-review under responsibility of organizing committee of the Second International Symposium on Computer Vision and the Internet (VisionNet’15) doi:10.1016/j.procs.2015.08.019
258
N.T. Thomas et al. / Procedia Computer Science 58 (2015) 257 – 264
3 6 3 , $ , 12 , + 3 $ 3 +3 ' 6 12 23 3 )6&3 63 ,3 ? 3 -&'3 , & + ,3 & + #$ ' ' = , = , ' #$ 2 $ > (' + = 3 ? ,3 2 $ = 3 $ = 3 / = 3 2$, = 3 (& 3 @ $ 3 + 3 . , &+&+- / )6& 1 12 $ $ & $, 6 . ++ + + . -& , ' . + ,- #$ )6& 1 $ > (' ' = 3 A = 3 A $ &63 8 3 2$, = 3 ?, = 3 B & 3 2 $3 C - &3 $ ' = 3 # A = 3 @ &63 A = - .> + ' ,3 , 3 ' , + , 3 + , '3 ( +3 &3 & + > 16 + +3 + + &3 & $ , , ' ' = ' &+0+1& ''+$ K '&+ $ K '0+ $ '2+ $ '(+ $ ':+$ 8$ ';+ K , + ' ' + , , A&6
:+&+!. 4 .
% D' $ , ' , , ' % D' 2, ' %D2 #$ + , %D2 + , #$ + & &' 7 , + #$ 9 + E ++ + #$ + $ + &' $ , #$ ,- $ & + , %3 )3 #$ , + & , ,, , & $ , 3 E 7$ % & + , & $ ,, , # + #$ &&' + 9 $ + ,3 I (9 , + % , (9 , + ) , (9 , + , #$ , , & $ &' $ + $ #$ &&' + , % $ &&' + 9 &' $ ) #$ &&' ,$ + , $ A,
$: 4 $ , $ , #$ , , 6 + $ $ & .
$: 4 ++3
#$ $ $ ,$ + , & $ , I
264
N.T. Thomas et al. / Procedia Computer Science 58 (2015) 257 – 264
(!> #$ & ,
#& $: 6 ,$ + ,
Q %
Q )
Q
#
%,
%, 9 &' $
4
,$ + ,
L
I
LE!S EIS EILS
IIEES I!E!LS LES
LIE EI L!
Q Q Q
) #$ $ $ $ & &' 12 #$ $ &' , 1 %' 1% $ & $ #$ ' $ 9 $ , 9, $ , + &' $ $ 6' $6 $ &' $ ' % + $ , , $ & + 1%3 6' , $6 #$ $ ' + $ & $ #$ $: 6 ++ + $ , $ , ,$ $ $ ' + ,, 9, 12 (9 $ $ $ $ & ++' 12 . + 3 $ 6 & 9 $6 $ '9 + & 12
$
R3 8 3 @3 $$ G %3 % T#$, ,U B . ! 3 3 * L3 I L 2,=, F$,3 $ , 8 T% (' , D, . 1 %'U B C.#.3 I3 * !3 / 3 / , 8$ @5 TD 7 6 ,676 >1V+VV ,QVV2
E I L !