Dear Chang, Mena, #Microposts2014 NEEL Challenge participants,
we have updated the evaluation framework with a logic that considers the
longest ordered common subsequence.
Given:
GS = A B C
TS = B D C
The new logic counts 2 TPs.
Attached you can find the library, while the source code is available at:
https://github.com/giusepperizzo/neeleval
The logic has been co-updated together with Stefano Parmesan (thanks
Stafano).
Cheers,
#Microposts2014 NEEL Challenge crew
On 19/02/14 09:40, Mena Badieh Habib Morgan wrote:
> I agree with Chang ... the evaluation method considers correct pair a
> false one if other false pairs appeared before the correct one.
> I think you should not assume that both the gs_pairsand ts_pairsare of
> <
https://github.com/giusepperizzo/neeleval>.
> --
> You received this message because you are subscribed to the Google
> Groups "microposts2014" group.
> To unsubscribe from this group and stop receiving emails from it, send
> an email to
microposts201...@googlegroups.com.
> Visit this group at
http://groups.google.com/group/microposts2014.
> For more options, visit
https://groups.google.com/groups/opt_out.