In this task, you will be presented with a context from an academic paper and a question separated with a 
. You have to answer the question based on the context.

[Q]: The two main data sets that we will use to evaluate our architecture are the 2014 i2b2 de-identification challenge data set BIBREF2 and the nursing notes corpus BIBREF3 . 
 Question: Which two datasets is the system tested on?
[A]: 2014 i2b2 de-identification challenge data set BIBREF2 nursing notes corpus BIBREF3


[Q]: Our model yields the best results on both UAS and LAS metrics of all languages except the Japanese. As for Japanese, our model gives unsatisfactory results because the original treebank was written in Roman phonetic characters instead of hiragana, which is used by both common Japanese writing and our pre-trained embeddings. Despite this, our model overall still gives 1.0% higher average UAS and LAS than the previous best parser, BIAF. Although both BIAF and STACKPTR parsers have achieved relatively high parsing accuracies on the 12 languages and have all UAS higher than 90%, our model achieves state-of-the-art results in all languages for both UAS and LAS. Overall, our model reports more than 1.0% higher average UAS than STACKPTR and 0.3% higher than BIAF. 
 Question: What are performance compared to former models?
[A]: model overall still gives 1.0% higher average UAS and LAS than the previous best parser, BIAF our model reports more than 1.0% higher average UAS than STACKPTR and 0.3% higher than BIAF


[Q]: The most intuitive way to represent syntactic information is to use individual dependency relations directly, like dependency head and dependency relation label, denoted as Dep and Rel for short. In order to preserve the structural information of dependency trees as much as possible, we take the syntactic path between candidate arguments and predicates in dependency trees as linguistic knowledge. Referring to BIBREF9, we use the Tree-based Position Feature (TPF) as Dependency Path (DepPath) and use the Shortest Dependency Path (SDP) as Relation Path (RelPath). 
 Question: What different approaches of encoding syntactic information authors present?
[A]:
dependency head and dependency relation label, denoted as Dep and Rel for short Tree-based Position Feature (TPF) as Dependency Path (DepPath) Shortest Dependency Path (SDP) as Relation Path (RelPath)