• No results found

K best Spanning Tree Parsing

N/A
N/A
Protected

Academic year: 2020

Share "K best Spanning Tree Parsing"

Copied!
8
0
0

Loading.... (view fulltext now)

Full text

Loading

Figure

Figure 1: A dependency graph for an English sen-tence in our development set (Penn WSJ section 24):Two share a house almost devoid of furniture.
Figure 2 presents a view of the algorithm when
Table 1: k -best MST oracle results. The 1-best results represent the performance of the parser in isolation.Results are reported for the CoNLL test set and for English, on Section 23 of the Penn WSJ Treebank.

References

Related documents