... tree. Formally, for every s between 1 and n the triple (s,s, ws) E T. • The tree is binary branching and consistent. Formally, for every (s,t, X) in T, s ¢ t, there is exactly one r, Y, and ... maximum, mean, and standard deviation for three criteria, Consis- tent Brackets Recall, Consistent Brackets Tree, and 1For our experiments the corpus was slightly cleaned up. A diff file for "ed" ... bracketed form of the TI section of the ATIS corpus 1 using a modified form of the Inside- Outside Algorithm. Pereira and Schabes then used the Labelled Tree Algorithm to select the best parse for...