Examples of edu.stanford.nlp.ling.Label

edu.stanford.nlp.ling.Label
Something that implements the Label interface can act as a constituent, node, or word label with linguistic attributes. A Label is required to have a "primary" String value() (although this may be null). This is referred to as its value.
Implementations of Label split into two groups with respect to equality. Classes that extend ValueLabel define equality solely in terms of String equality of its value (secondary facets may be present but are ignored for purposes of equality), and have equals and compareTo defined across all subclasses of ValueLabel. This behavior should not be changed. Other classes that implement Label define equality only with their own type and require all fields of the type to be equal.
A subclass that extends another Label class should override the definition of labelFactory(), since the contract for this method is that it should return a factory for labels of the exact same object type. @author Christopher Manning

        }
        if (leaves == null) {
          leaves = tree.yield();
        }
        token.setTag(taggedWords.get(i).tag());
        Label leaf = leaves.get(i);
        if (leaf instanceof HasTag) {
          ((HasTag) leaf).setTag(taggedWords.get(i).tag());
        }
      }
    }

View Full Code Here

      private static final long serialVersionUID = -7250433816896327901L;


      @Override
      public boolean test(Tree t) {
        Tree[] kids = t.children();
        Label l = t.label();
        // The special Switchboard non-terminals clause.
        // Note that it deletes IP which other Treebanks might use!
        if ("RS".equals(t.label().value()) || "RM".equals(t.label().value()) || "IP".equals(t.label().value()) || "CODE".equals(t.label().value())) {
          return false;
        }
        if ((l != null) && l.value() != null && (l.value().equals("-NONE-")) && !t.isLeaf() && kids.length == 1 && kids[0].isLeaf()) {
          // Delete empty/trace nodes (ones marked '-NONE-')
          return false;
        }
        return true;
      }

View Full Code Here

      for (Tree subtree : treeCopy) {
        if (subtree.depth() < 2) {
          continue;
        }
        String categoryLabel = subtree.label().toString();
        Label label = subtree.label();
        label.setFromString(categoryLabel+"-t1");
      }
      return treeCopy;
    }

View Full Code Here

      for (Tree subtree : treeCopy) {
        if (subtree.depth() < 1) {
          continue;
        }
        String categoryLabel = subtree.label().toString();
        Label label = subtree.label();
        label.setFromString(categoryLabel+"-t2");
      }
      return treeCopy;
    }

View Full Code Here

      for (Tree subtree : treeCopy) {
        if (subtree.depth() < 2) {
          continue;
        }
        String categoryLabel = subtree.label().toString();
        Label label = subtree.label();
        label.setFromString(categoryLabel+"-t3");
      }
      return treeCopy;
    }

View Full Code Here

    return parserProcessor;
  }


  // This probably isn't needed now; everything is always a core label. But no-op.
  private static void convertToCoreLabels(Tree tree) {
    Label l = tree.label();
    if (! (l instanceof CoreLabel)) {
      CoreLabel cl = new CoreLabel();
      cl.setValue(l.value());
      tree.setLabel(cl);
    }


    for (Tree kid : tree.children()) {
      convertToCoreLabels(kid);

View Full Code Here

          numNonPhrasal++;
        }
        starts.incrementCount(t2.value());
      }
      for (Tree subtree : t) {
        Label lab = subtree.label();
        if (lab == null || lab.value() == null || "".equals(lab.value())) {
          if (numNullLabel == 0) {
            nullLabelEg = subtree;
          }
          numNullLabel++;
          if (lab == null) {
            subtree.setLabel(new StringLabel(""));
          } else if (lab.value() == null) {
            subtree.label().setValue("");
          }
        }
        if (subtree.isLeaf()) {
          numWords++;

View Full Code Here

    List<HasWord> sentenceB;
    if (op.wordFunction != null) {
      sentenceB = Generics.newArrayList();
      for (HasWord word : originalSentence) {
        if (word instanceof Label) {
          Label label = (Label) word;
          Label newLabel = label.labelFactory().newLabel(label);
          if (newLabel instanceof HasWord) {
            sentenceB.add((HasWord) newLabel);
          } else {
            throw new AssertionError("This should have been a HasWord");
          }

View Full Code Here

   * @param pw     The PrintWriter to print the tree to
   * @param printScores Whether to print the scores (log probs) of tree nodes
   */
  private void indentedListPrint(String indent, String pad, PrintWriter pw, boolean printScores) {
    StringBuilder sb = new StringBuilder(indent);
    Label label = label();
    if (label != null) {
      sb.append(label.toString());
    }
    if (printScores) {
      sb.append("  ");
      sb.append(score());
    }

View Full Code Here

   */
  private void indentedXMLPrint(String indent, String pad,
                                PrintWriter pw, boolean printScores) {
    StringBuilder sb = new StringBuilder(indent);
    Tree[] children = children();
    Label label = label();
    if (label != null) {
      sb.append("<");
      if (children.length > 0) {
        sb.append("node value=\"");
      } else {

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

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

edu.stanford.nlp.dcoref.CoNLL2011DocumentReader$CorpusStats

edu.stanford.nlp.dcoref.CoNLL2011DocumentReader$DocumentIterator

edu.stanford.nlp.dcoref.RuleBasedCorefMentionFinder

edu.stanford.nlp.ie.machinereading.GenericDataSetReader

edu.stanford.nlp.international.french.process.FrenchLexer

edu.stanford.nlp.international.french.scripts.MungeTreesWithMorfetteAnalyses

edu.stanford.nlp.international.spanish.process.SpanishLexer

edu.stanford.nlp.neural.rnn.RNNCoreAnnotations

edu.stanford.nlp.parser.lexparser.AbstractTreebankParserParams$RemoveGFSubcategoryStripper

edu.stanford.nlp.parser.lexparser.AbstractTreebankParserParams$SubcategoryStripper

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.