From the directed graph A, a Minimum Spanning Tree (MST) is constructed, using Chu-Liu-Edmonds algorithm (Chu & Liu, 1965;Edmonds, 1967) where the weight of each edge is 1/|V|.
at the opposite pole, the literature domain, even if it does not contain long sentences, raises the most parsing problems: the authors' creativity manifests both in the sentence structure (dislocated arguments, unlexicalised ones, unusual word order, etc.)