import edu.stanford.nlp.trees.DiskTreebank; //导入依赖的package包/类
public TreeTaggedFileReader(TaggedFileRecord record) {
  filename = record.file;
  trf = new LabeledScoredTreeReaderFactory();
  transformer = record.treeTransformer;
  normalizer = record.treeNormalizer;
  treeFilter = record.treeFilter;

  treebank = new DiskTreebank(trf, record.encoding);
  if (record.treeRange != null) {
    treebank.loadPath(filename, record.treeRange);
  } else {
    treebank.loadPath(filename);
  }

  treeIterator = treebank.iterator();
  findNext();
}
 

import edu.stanford.nlp.trees.DiskTreebank; //导入依赖的package包/类
public static void main(String[] args) {
  // simple testing code
  Treebank treebank = new DiskTreebank();
  CategoryWordTag.suppressTerminalDetails = true;
  treebank.loadPath(args[0]);
  final HeadFinder chf = new NoPunctuationHeadFinder();
  treebank.apply(new TreeVisitor() {
    public void visitTree(Tree pt) {
      pt.percolateHeads(chf);
      pt.pennPrint();
      System.out.println();
    }
  });
}
 

import edu.stanford.nlp.trees.DiskTreebank; //导入依赖的package包/类
public DiskTreebank diskTreebank() {
  return new DiskTreebank(treeReaderFactory(), inputEncoding);
}
 

import edu.stanford.nlp.trees.DiskTreebank; //导入依赖的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.");
}
 

import edu.stanford.nlp.trees.DiskTreebank; //导入依赖的package包/类
@Override
public DiskTreebank diskTreebank() {
  return new DiskTreebank(treeReaderFactory(), inputEncoding);
}
 

import edu.stanford.nlp.trees.DiskTreebank; //导入依赖的package包/类
public ATBArabicDataset() {
  super();

  //Read the raw file as UTF-8 irrespective of output encoding
  treebank = new DiskTreebank(new ArabicTreeReaderFactory.ArabicRawTreeReaderFactory(true), "UTF-8");
}