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

   * Return the value of the label (or null if none).
   *
   * @return String the value for the label
   */
  public String value() {
    Label lab = label();
    if (lab == null) {
      return null;
    }
    return lab.value();
  }

View Full Code Here

   * Set the value for the label (if one is stored).
   *
   * @param value The value for the label
   */
  public void setValue(String value) {
    Label lab = label();
    if (lab != null) {
      lab.setValue(value);
    }
  }

View Full Code Here

   *
   * @param labelStr the String that translates into the content of the
   *                 label
   */
  public void setFromString(String labelStr) {
    Label lab = label();
    if (lab != null) {
      lab.setFromString(labelStr);
    }
  }

View Full Code Here

       */
      private static final long serialVersionUID = -7250433816896327901L;


      public boolean accept(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 The hash code
   */
  @Override
  public int hashCode() {
    Label l = label();
    int hc = (l == null) ? 1 : l.hashCode();
    Tree[] kids = children();
    for (int i = 0; i < kids.length; i++) {
      l = kids[i].label();
      int hc2 = (l == null) ? i : l.hashCode();
      hc ^= (hc2 << i);
    }
    return hc;
  }

View Full Code Here

        if (nodes == null) {
          nodes = StringUtils.getShortClassName(st);
        } else if ( ! nodes.equals(StringUtils.getShortClassName(st))) {
          nodes = "mixed";
        }
        Label lab = st.label();
        if (phraseLabels == null) {
          if (lab == null) {
            phraseLabels = "null";
          } else {
            phraseLabels = StringUtils.getShortClassName(lab);
          }
        } else if ( ! phraseLabels.equals(StringUtils.getShortClassName(lab))) {
          phraseLabels = "mixed";
        }
      } else if (st.isPreTerminal()) {
        if (nodes == null) {
          nodes = StringUtils.getShortClassName(st);
        } else if ( ! nodes.equals(StringUtils.getShortClassName(st))) {
          nodes = "mixed";
        }
        Label lab = st.label();
        if (tagLabels == null) {
          if (lab == null) {
            tagLabels = "null";
          } else {
            tagLabels = StringUtils.getShortClassName(lab);
          }
        } else if ( ! tagLabels.equals(StringUtils.getShortClassName(lab))) {
          tagLabels = "mixed";
        }
      } else if (st.isLeaf()) {
        if (leaves == null) {
          leaves = StringUtils.getShortClassName(st);
        } else if ( ! leaves.equals(StringUtils.getShortClassName(st))) {
          leaves = "mixed";
        }
        Label lab = st.label();
        if (leafLabels == null) {
          if (lab == null) {
            leafLabels = "null";
          } else {
            leafLabels = StringUtils.getShortClassName(lab);

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

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.