Question 4
In a graph-based dependency parser using edge-factored scoring, the following edge scores have been calculated for a sentence:
What is the score of the maximum spanning tree (assuming all other possible edges have lower scores)?
1.5
1.6
1.7
1.8