Hyponymy can be described in terms of ( ) graphs, with higher-order superordinates above the lower subordinates.
TREE-LIKE
Hyponymy can be described in terms of ( ) graphs, with higher-order superordinates above the lower subordinates.
TREE-LIKE