... that the surface graph is a tree. The tree- hood of surface graphs is part of the defini- tion of S-graph and provides the foundation for our parsing algorithm; it is the SFG analog to the ... ]. The prefix [2,1) of the label [2,1,0] is the SFG representation of RG's unaccusative analysis of adjectives. The suffix (1,0] of [2,1,0]; the prefix [0,1) of the label [0,1] in the ... in the output graph, since no further R-signs may be added to the label once the arc bearing the label is complete. The precedence constraints are interpreted as strict partial orders on the...