Task 1 (A)
|System name||LAS (F1 score)||MLAS (F1 score)||BLEX (F1 score)|
Task 1 (B)
|System name||ELAS (F1 score)||SLAS (F1 score)|
The predicted analyses are evaluated with the script poleval2018_cykle.py. It is a modified version of the evaluation script prepared for CoNLL 2018 shared task on Multilingual Parsing from Raw Text to Universal Dependencies. The most important modification consists in adding two measures, ELAS and SLAS, for the purpose of evaluating dependency graphs with enhanced edges and semantic labels, respectively. The second modification is motivated by the fact that some of the participating systems predicted trees with cycles, multiple root nodes, etc. We decided not to reject such submissions, but only to score incorrect trees with 0.
There are two main metrics: LAS in the task 1(A) and ELAS in the task 1(B). The systems are ranked according to these scores.
The gold standard data is available below:
The table below shows results of evaluation. It contains system names, initials of submitting authors, micro average F1 scores computed for overlap and exact matches. We computed final scores as weighted means: 0.8 * overlap + 0.2 * exact. The reason for this are (1) combining both measures while (2) giving strong premium for overlap matches. Hopefully, both overlap and exact matches produce very similar orderings of competing systems, even without using combined weighted scores as in the column Final.
|Per group LSTM-CRF with Contextual String Embeddings||[Ł. B.]||0.826||0.877||0.866|
None of the systems has been declared as using other named entity annotated corpus than the official 1M NKJP, therefore we present the competing systems in just one table.
Thank you for participation and congratulations for everyone, especially the winners!
UPDATE: annotation guidelines for the test set can be found here.
|PocoLM Order 6||208.6297|