In case the shortest derivation is not unique, Bod (2000b) proposes to back off to a frequency ordering of the subtrees.
all subtrees of each root label are assigned a rank according to their frequency in the treebank: the most frequent subtree (or subtrees) of each root label gets rank 1, the second most frequent subtree gets rank 2, etc.