import edu.stanford.nlp.io.NumberRangesFileFilter; //导入依赖的package包/类
/**
 * For testing: loads a treebank and prints the trees.
 */
public static void main(String[] args) {
  TreebankLangParserParams tlpp = new ChineseTreebankParserParams();
  System.out.println("Default encoding is: " +
                     tlpp.diskTreebank().encoding());

  if (args.length < 2) {
    printlnErr("Usage: edu.stanford.nlp.parser.lexparser.ChineseTreebankParserParams treesPath fileRange");
  } else {
    Treebank m = tlpp.diskTreebank();
    m.loadPath(args[0], new NumberRangesFileFilter(args[1], false));

    for (Tree t : m ) {
      t.pennPrint(tlpp.pw());
    }
    System.out.println("There were " + m.size() + " trees.");
  }
}
 

import edu.stanford.nlp.io.NumberRangesFileFilter; //导入依赖的package包/类
private TaggedFileRecord(String file, Format format, 
                         String encoding, String tagSeparator,
                         TreeTransformer treeTransformer,
                         TreeNormalizer treeNormalizer,
                         NumberRangesFileFilter treeRange,
                         Filter<Tree> treeFilter,
                         Integer wordColumn, Integer tagColumn) {
  this.file = file;
  this.format = format;
  this.encoding = encoding;
  this.tagSeparator = tagSeparator;
  this.treeTransformer = treeTransformer;
  this.treeNormalizer = treeNormalizer;
  this.treeRange = treeRange;
  this.treeFilter = treeFilter;
  this.wordColumn = wordColumn;
  this.tagColumn = tagColumn;
}
 

import edu.stanford.nlp.io.NumberRangesFileFilter; //导入依赖的package包/类
private TaggedFileRecord(String file, Format format,
                         String encoding, String tagSeparator,
                         TreeTransformer treeTransformer,
                         TreeNormalizer treeNormalizer,
                         NumberRangesFileFilter treeRange,
                         Filter<Tree> treeFilter,
                         Integer wordColumn, Integer tagColumn) {
  this.file = file;
  this.format = format;
  this.encoding = encoding;
  this.tagSeparator = tagSeparator;
  this.treeTransformer = treeTransformer;
  this.treeNormalizer = treeNormalizer;
  this.treeRange = treeRange;
  this.treeFilter = treeFilter;
  this.wordColumn = wordColumn;
  this.tagColumn = tagColumn;
}
 

import edu.stanford.nlp.io.NumberRangesFileFilter; //导入依赖的package包/类
/**
 * For testing.
 */
public static void main(String[] args) {
  if (args.length < 2) {
    System.err.println("usage: Relation treebank numberRanges");
    return;
  }
  FileFilter testFilt = new NumberRangesFileFilter(args[1], true);
  TreeReaderFactory trf = new PennTreeReaderFactory(new NPTmpRetainingTreeNormalizer());
  DiskTreebank testTreebank = new DiskTreebank(trf);
  testTreebank.loadPath(new File(args[0]), testFilt);
  HeadFinder hf = new ModCollinsHeadFinder();
  List<Relation> relations = new ArrayList<Relation>();
  relations.addAll(Arrays.asList(SIMPLE_RELATIONS));
  relations.add(new HasIthChild(2));
  relations.add(new HasIthChild(-1));
  relations.add(new IthChildOf(1));
  relations.add(new IthChildOf(-2));
  relations.add(new HeadedBy(hf));
  relations.add(new Heads(hf));
  relations.add(new ImmediatelyHeadedBy(hf));
  relations.add(new ImmediatelyHeads(hf));
  relations.add(new UnbrokenCategoryDominates("NP"));
  relations.add(new UnbrokenCategoryDominates("VP"));
  relations.add(new UnbrokenCategoryIsDominatedBy("NP"));
  relations.add(new UnbrokenCategoryIsDominatedBy("VP"));
  int trees = 0, subtrees = 0;
  for (Tree root : testTreebank) {
    for (Tree tree : root.subTrees()) {
      boolean error = false;
      for (Relation relation : relations) {
        error = error || relation.testRelation(tree, root);
      }
      if (error) {
        System.err.println("Tree: ");
        root.pennPrint(System.err);
        System.err.println();
        System.err.println("SubTree: ");
        tree.pennPrint(System.err);
        System.err.println();
        System.exit(0);
      }
      subtrees++;
    }
    trees++;
  }
  System.out.println("Tested all relations on " + subtrees
      + " subtrees in " + trees + " trees with no errors.");
}