whether or not the transitions that built the two states are equal . does n't check anything else . useful for training using an agenda , for example , when you know the underlying information such as the words are the same and all you care about checking is the transition sequence concode_field_sep List<Tree> sentence concode_elem_sep double score concode_elem_sep TreeShapedStack<Tree> stack concode_elem_sep int tokenPosition concode_elem_sep Pattern separatorRegex concode_elem_sep boolean finished concode_elem_sep TreeShapedStack<Transition> transitions concode_elem_sep char[][] equivalentSeparators concode_elem_sep TreeMap<Integer,String> separators concode_field_sep String getSeparatorBetween concode_elem_sep String getSeparatorBetween concode_elem_sep Tree getQueueNode concode_elem_sep double score concode_elem_sep boolean endOfQueue concode_elem_sep int getSeparatorCount concode_elem_sep int getSeparatorCount concode_elem_sep HeadPosition getSeparator concode_elem_sep String toString concode_elem_sep TreeMap<Integer,String> findSeparators concode_elem_sep Tree getStackNode concode_elem_sep boolean isFinished
boolean function ( State arg0 ) { return transitions . equals ( arg0 . transitions ) ; }