The second method, named Weighted K-Best (WKB), is a deterministic method building on properties of the inference algorithm.
we use k-best Maximum Spanning Tree algorithm (Hall, 2007) to produce the K parse trees with the highest score.