Examples of edu.stanford.nlp.parser.lexparser.TreeBinarizer.transformTree()

Package edu.stanford.nlp.parser.lexparser

Class edu.stanford.nlp.parser.lexparser.TreeBinarizer

Examples of edu.stanford.nlp.parser.lexparser.TreeBinarizer.transformTree()

edu.stanford.nlp.parser.lexparser.TreeBinarizer.transformTree()
Binarizes the tree according to options set up in the constructor. Does the whole tree by calling itself recursively. @param t A tree to be binarized. The non-leaf nodes must already haveCategoryWordTag labels, with heads percolated. @return A binary tree.


    ParserAnnotatorUtils.fillInParseAnnotations(VERBOSE, BUILD_GRAPHS, gsf, sentence, tree);


    if (saveBinaryTrees) {
      TreeBinarizer binarizer = TreeBinarizer.simpleTreeBinarizer(parser.getTLPParams().headFinder(), parser.treebankLanguagePack());
      Tree binarized = binarizer.transformTree(tree);
      Trees.convertToCoreLabels(binarized);
      sentence.set(TreeCoreAnnotations.BinarizedTreeAnnotation.class, binarized);
    }
  }

View Full Code Here

      }


      // TODO: add an option which treats the spans as constraints when parsing


      Tree tree = parser.apply(tokens);
      Tree binarized = binarizer.transformTree(tree);
      Tree collapsedUnary = transformer.transformTree(binarized);


      // if there is a sentiment model for use in prelabeling, we
      // label here and then use the user given labels to adjust
      if (sentimentModel != null) {

View Full Code Here

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.