当前位置: 首页>>代码示例>>Java>>正文


Java DiskTreebank.loadPath方法代码示例

本文整理汇总了Java中edu.stanford.nlp.trees.DiskTreebank.loadPath方法的典型用法代码示例。如果您正苦于以下问题:Java DiskTreebank.loadPath方法的具体用法?Java DiskTreebank.loadPath怎么用?Java DiskTreebank.loadPath使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在edu.stanford.nlp.trees.DiskTreebank的用法示例。


在下文中一共展示了DiskTreebank.loadPath方法的2个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Java代码示例。

示例1: TreeTaggedFileReader

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();
}
 
开发者ID:benblamey,项目名称:stanford-nlp,代码行数:18,代码来源:TreeTaggedFileReader.java

示例2: main

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.");
}
 
开发者ID:FabianFriedrich,项目名称:Text2Process,代码行数:51,代码来源:Relation.java


注:本文中的edu.stanford.nlp.trees.DiskTreebank.loadPath方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。