Package edu.stanford.nlp.ling

Examples of edu.stanford.nlp.ling.CategoryWordTagFactory

43
44
45
46
47
48
49
50
51
52
53
    if (trainOptions.selectivePostSplit) {
      postSplitter = new PostSplitter(tlpParams, op);
    } else {
      postSplitter = null;
    }
    this.tf = new LabeledScoredTreeFactory(new CategoryWordTagFactory());
    this.tlp = tlpParams.treebankLanguagePack();
    this.forceCNF = forceCNF;
    if (trainOptions.printAnnotatedRuleCounts) {
      annotatedRuleCounts = new ClassicCounter<Tree>();
    } else {
View Full Code Here
93
94
95
96
97
98
99
100
101
102
103
   */
  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);
View Full Code Here
281
282
283
284
285
286
287
288
289
290
291
    // actually calls the lattice reader (e.g., this says that we can't have a word longer than
    // 80 characters...seems sensible for Arabic
    op.testOptions.maxSpanForTags = 80;

    treePrint = op.testOptions.treePrint(op.tlpParams);
    debinarizer = new Debinarizer(op.forceCNF, new CategoryWordTagFactory());
    subcategoryStripper = op.tlpParams.subcategoryStripper();

    Timing.startTime();

    final Treebank trainTreebank = op.tlpParams.diskTreebank();
View Full Code Here
21
22
23
24
25
26
27
28
  /**
   * Create a new TreeReaderFactory with CategoryWordTag labels.
   */
  public LabeledScoredTreeReaderFactory() {
    lf = new CategoryWordTagFactory();
    tm = new BobChrisTreeNormalizer();
  }
View Full Code Here
31
32
33
34
35
36
37
38
    this.lf = lf;
    tm = new BobChrisTreeNormalizer();
  }

  public LabeledScoredTreeReaderFactory(TreeNormalizer tm) {
    lf = new CategoryWordTagFactory();
    this.tm = tm;
  }
View Full Code Here
TOP

Related Classes of edu.stanford.nlp.ling.CategoryWordTagFactory

  • edu.stanford.nlp.international.arabic.parsesegment.JointParsingModel
  • edu.stanford.nlp.parser.lexparser.FastFactoredParser
  • edu.stanford.nlp.parser.lexparser.TreeAnnotatorAndBinarizer
  • edu.stanford.nlp.trees.LabeledScoredTreeReaderFactory
    • Copyright © 2018 www.massapicom. All rights reserved.
    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.