We conduct experiments aimed at addressing three primary research questions: (1) How does each taxonomic organization algorithm perform?
our second method selects hypernym edges for the taxonomy by using the Chu-Liu-Edmonds optimum branching algorithm (Chu and Liu, 1965;Edmonds, 1967) to solve the directed analog of the maximum spanning tree problem (DMST).