Skip to Main Content
Table 5 
Accuracies of the graph merging–based parser on development set. SM is for Simple Merging, and LR for Lagrangian Relaxation. A second-order graph-based parser with a global linear disambiguation model is used for tree parsing.
  UPURUFUCMLPLRLFLCM
SM Subgraph1 88.63 76.19 81.94 18.09 85.94 73.88 79.46 16.11 
Subgraph2 88.04 78.20 82.83 17.47 85.31 75.77 80.26 15.43 
Subgraph3 88.91 81.12 84.84 20.36 86.57 78.99 82.61 17.30 
  Merged 83.23 88.45 85.76 22.97 80.59 85.64 83.04 19.29 
  
LR Subgraph1 89.76 77.48 83.17 18.60 87.17 75.25 80.77 16.39 
Subgraph2 89.30 79.18 83.93 18.66 86.68 76.85 81.47 16.56 
Subgraph3 89.42 81.55 85.31 20.53 87.09 79.43 83.08 17.81 
  Merged 88.07 85.14 86.58 26.32 85.55 82.70 84.10 21.61 
  UPURUFUCMLPLRLFLCM
SM Subgraph1 88.63 76.19 81.94 18.09 85.94 73.88 79.46 16.11 
Subgraph2 88.04 78.20 82.83 17.47 85.31 75.77 80.26 15.43 
Subgraph3 88.91 81.12 84.84 20.36 86.57 78.99 82.61 17.30 
  Merged 83.23 88.45 85.76 22.97 80.59 85.64 83.04 19.29 
  
LR Subgraph1 89.76 77.48 83.17 18.60 87.17 75.25 80.77 16.39 
Subgraph2 89.30 79.18 83.93 18.66 86.68 76.85 81.47 16.56 
Subgraph3 89.42 81.55 85.31 20.53 87.09 79.43 83.08 17.81 
  Merged 88.07 85.14 86.58 26.32 85.55 82.70 84.10 21.61 
Close Modal

or Create an Account

Close Modal
Close Modal