code: public Label newLabelFromString(String labelStr) {
      int first = labelStr.indexOf(divider);
      int second = labelStr.lastIndexOf(divider);
      if (first == second) {
        return new WordLemmaTag(labelStr.substring(0, first), Morphology.stemStatic(labelStr.substring(0, first), labelStr.substring(first + 1)).word(), labelStr.substring(first + 1));
      } else if (first >= 0) {
        return new WordLemmaTag(labelStr.substring(0, first), labelStr.substring(first + 1, second), labelStr.substring(second + 1));
      } else {
        return new WordLemmaTag(labelStr);
      }
    }
docs: Create a new word, where the label is formed from
  the <code>String</code> passed in.  The String is divided according
  to the divider character.  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 isn't found
  in the word, then the whole string becomes the word, and lemma and tag
  are <code>null</code>.
  We assume that if only one divider character is found, word and tag are presents in
  the String, and lemma will be computed.
  
  @param labelStr The word that will go into the <code>Word</code>
  @return The new WordLemmaTag