Assertion: tree | /r/HasProperty | different
Facets:
value: lexicographically
type: DEGREE
value: very
type: DEGREE
Source sentences:
text: The problem with this representation is that listing all bit strings in lexicographic order would mean two successive strings might represent two trees that are lexicographically very different.
text: Here the trees have no values attached to their nodes (this would just multiply the number of possible trees by an easily determined factor), and trees are distinguished only by their structure; however the left and right child of any node are distinguished (if they are different trees, then interchanging them will produce a tree distinct from the original one).