question: the string is divided according to the divider character usually , '' / '' . we assume that we can always just divide on the rightmost divider character , rather than trying to parse up escape sequences . if the divider character is n't found in the word , then the whole string becomes the word , and lemma and tag are null . we assume that if only one divider character is found , word and tag are present in the string , and lemma will be computed . concode_field_sep String DIVIDER concode_elem_sep long serialVersionUID concode_elem_sep String lemma concode_elem_sep String tag concode_elem_sep String word concode_field_sep String lemma concode_elem_sep void main concode_elem_sep void setLemma concode_elem_sep int compareTo concode_elem_sep LabelFactory labelFactory concode_elem_sep int hashCode concode_elem_sep void setValue concode_elem_sep boolean equals concode_elem_sep void setTag concode_elem_sep String toString concode_elem_sep String toString concode_elem_sep String tag concode_elem_sep String value concode_elem_sep String word concode_elem_sep void setWord
target: void function ( String arg0 ) { setFromString ( arg0 , DIVIDER ) ; }