import edu.stanford.nlp.ling.CategoryWordTagFactory; //导入依赖的package包/类
public TreeAnnotatorAndBinarizer(HeadFinder annotationHF, HeadFinder binarizationHF, TreebankLangParserParams tlpParams, boolean forceCNF, boolean insideFactor, boolean doSubcategorization) {
  if (doSubcategorization) {
    annotator = new TreeAnnotator(annotationHF, tlpParams);
  } else {
    annotator = new TreeNullAnnotator(annotationHF);
  }
  binarizer = new TreeBinarizer(binarizationHF, tlpParams.treebankLanguagePack(), insideFactor, Train.markovFactor, Train.markovOrder, Train.compactGrammar() > 0, Train.compactGrammar() > 1, Train.HSEL_CUT, Train.markFinalStates);
  if (Train.selectivePostSplit) {
    postSplitter = new PostSplitter(tlpParams);
  }
  this.tf = new LabeledScoredTreeFactory(new CategoryWordTagFactory());
  this.tlp = tlpParams.treebankLanguagePack();
  this.forceCNF = forceCNF;
  if (Train.printAnnotatedRuleCounts) {
    annotatedRuleCounts = new ClassicCounter<Tree>();
  }
  if (Train.printAnnotatedStateCounts) {
    annotatedStateCounts = new ClassicCounter<String>();
  }
}
 

import edu.stanford.nlp.ling.CategoryWordTagFactory; //导入依赖的package包/类
public TreeAnnotatorAndBinarizer(HeadFinder annotationHF, HeadFinder binarizationHF, TreebankLangParserParams tlpParams, boolean forceCNF, boolean insideFactor, boolean doSubcategorization, Options op) {
  this.trainOptions = op.trainOptions;
  if (doSubcategorization) {
    annotator = new TreeAnnotator(annotationHF, tlpParams, op);
  } else {
    annotator = new TreeNullAnnotator(annotationHF);
  }
  binarizer = new TreeBinarizer(binarizationHF, tlpParams.treebankLanguagePack(), insideFactor, trainOptions.markovFactor, trainOptions.markovOrder, trainOptions.compactGrammar() > 0, trainOptions.compactGrammar() > 1, trainOptions.HSEL_CUT, trainOptions.markFinalStates, trainOptions.simpleBinarizedLabels, trainOptions.noRebinarization);
  if (trainOptions.selectivePostSplit) {
    postSplitter = new PostSplitter(tlpParams, op);
  }
  this.tf = new LabeledScoredTreeFactory(new CategoryWordTagFactory());
  this.tlp = tlpParams.treebankLanguagePack();
  this.forceCNF = forceCNF;
  if (trainOptions.printAnnotatedRuleCounts) {
    annotatedRuleCounts = new ClassicCounter<Tree>();
  }
  if (trainOptions.printAnnotatedStateCounts) {
    annotatedStateCounts = new ClassicCounter<String>();
  }
}
 

import edu.stanford.nlp.ling.CategoryWordTagFactory; //导入依赖的package包/类
public ExhaustiveDependencyParser(DependencyGrammar dg, Lexicon lex, Options op) {
  this.dg = dg;
  this.lex = lex;
  this.op = op;
  this.tlp = op.langpack();
  tf = new LabeledScoredTreeFactory(new CategoryWordTagFactory());
}
 

import edu.stanford.nlp.ling.CategoryWordTagFactory; //导入依赖的package包/类
/** Use the DependencyGrammar to score the tree.
 *
 * @param tr A binarized tree (as returned by the PCFG parser
 * @return The score for the tree according to the grammar
 */
private double depScoreTree(Tree tr) {
  // System.err.println("Here's our tree:");
  // tr.pennPrint();
  // System.err.println(Trees.toDebugStructureString(tr));
  Tree cwtTree = tr.deepCopy(new LabeledScoredTreeFactory(), new CategoryWordTagFactory());
  cwtTree.percolateHeads(binHeadFinder);
  // System.err.println("Here's what it went to:");
  // cwtTree.pennPrint();
  List<IntDependency> deps = MLEDependencyGrammar.treeToDependencyList(cwtTree, wordIndex, tagIndex);
  // System.err.println("Here's the deps:\n" + deps);
  return dg.scoreAll(deps);
}
 

import edu.stanford.nlp.ling.CategoryWordTagFactory; //导入依赖的package包/类
public TreeAnnotator(HeadFinder hf, TreebankLangParserParams tlpp) {
  this.tlpParams = tlpp;
  this.hf = hf;
  this.tf = new LabeledScoredTreeFactory(new CategoryWordTagFactory());
}
 

import edu.stanford.nlp.ling.CategoryWordTagFactory; //导入依赖的package包/类
/**
 * Create a new TreeReaderFactory with CategoryWordTag labels.
 */
public LabeledScoredTreeReaderFactory() {
  lf = new CategoryWordTagFactory();
  tm = new BobChrisTreeNormalizer();
}