The focus of the task is learning syntactic dependency parsers that can work in a real world setting, starting from raw text, and that can work over many typologically different languages, even surprise languages for which there is little or no training data, by exploiting a common syntactic annotation standard. Systems have to find labeled syntactic dependencies between words, i.e., a syntactic head for each word, and a label classifying the type of the dependency relation. No gold-standard annotation (tokenization, sentence segmentation, lemmas, morphology) is available in the input text.
Task results
| System | LAS Sort ascending |
|---|---|
| Stanford | 0.8999 |

