Examples of edu.stanford.nlp.trees.GrammaticalRelation

edu.stanford.nlp.trees.GrammaticalRelation
{@code GrammaticalRelation} is used to define astandardized, hierarchical set of grammatical relations, together with patterns for identifying them in parse trees.
Each GrammaticalRelation has:
- A String short name, which should be a lowercase abbreviation of some kind (in the fure mainly Universal Dependency names).
- A String long name, which should be descriptive.
- A parent in the GrammaticalRelation hierarchy.
- A {@link Pattern Pattern} calledsourcePattern which matches (parent) nodes from which this GrammaticalRelation could hold. (Note: this is done with the Java regex Pattern matches() predicate. The pattern must match the whole node name, and ^ or $ aren't needed. Tregex constructions like __ do not work. Use ".*" to be applicable at all nodes. This prefiltering is used for efficiency.)
- A list of zero or more {@link TregexPattern TregexPatterns} called targetPatterns,which describe the local tree structure which must hold between the source node and a target node for the GrammaticalRelation to apply. (Note: {@code tregex}regular expressions match with the {@code find()} method, whileliteral string label descriptions that are not regular expressions must be {@code equals()}.)
The targetPatterns associated with a GrammaticalRelation are designed as follows. In order to recognize a grammatical relation X holding between nodes A and B in a parse tree, we want to associate with GrammaticalRelation X a {@link TregexPattern TregexPattern} such that:
- the root of the pattern matches A, and
- the pattern includes a node labeled "target", which matches B.
For example, for the grammatical relation PREDICATE which holds between a clause and its primary verb phrase, we might want to use the pattern {@code "S < VP=target"}, in which the root will match a clause and the node labeled "target" will match the verb phrase.
For a given grammatical relation, the method {@link GrammaticalRelation#getRelatedNodes getRelatedNodes()}takes a Tree node as an argument and attempts to return other nodes which have this grammatical relation to the argument node. By default, this method operates as follows: it steps through the patterns in the pattern list, trying to match each pattern against the argument node, until it finds some matches. If a pattern matches, all matching nodes (that is, each node which corresponds to node label "target" in some match) are returned as a list; otherwise the next pattern is tried.
For some grammatical relations, we need more sophisticated logic to identify related nodes. In such cases, {@link GrammaticalRelation#getRelatedNodes getRelatedNodes()}can be overridden on a per-relation basis using anonymous subclassing.
@see GrammaticalStructure @see EnglishGrammaticalStructure @see EnglishGrammaticalRelations @see edu.stanford.nlp.trees.international.pennchinese.ChineseGrammaticalRelations @author Bill MacCartney @author Galen Andrew (refactoring English-specific stuff) @author Ilya Sherman (refactoring annotation-relation pairing, which is now gone)


      IndexedWord thisWord = new IndexedWord(tokens.get(i - 1));
      IndexedWord headWord = head == 0 ? root
                                       : new IndexedWord(tokens.get(head - 1));


      GrammaticalRelation relation = head == 0
                                     ? GrammaticalRelation.ROOT
                                     : makeGrammaticalRelation(label);


      dependencies.add(new TypedDependency(relation, headWord, thisWord));
    }

View Full Code Here

    TreeGraphNode rootNode = new TreeGraphNode(root);
    return makeGrammaticalStructure(dependencies, rootNode);
  }


  private GrammaticalRelation makeGrammaticalRelation(String label) {
    GrammaticalRelation stored;


    switch (language) {
      case English:
        stored = EnglishGrammaticalRelations.shortNameToGRel.get(label);
        if (stored != null)
          return stored;
        break;
      case Chinese:
        stored = ChineseGrammaticalRelations.shortNameToGRel.get(label);
        if (stored != null)
          return stored;
        break;
    }


    return new GrammaticalRelation(language, label, null, GrammaticalRelation.DEPENDENT);
  }

View Full Code Here

    buf.write(String.valueOf(weight));
    return buf.toString();
  }
  
  public static AddEdge createEngAddEdge(String govName, String depName, String engRelnName) {
    GrammaticalRelation reln = EnglishGrammaticalRelations.valueOf(engRelnName);
    return new AddEdge(govName, depName, reln);
  }

View Full Code Here

    GrammaticalRelation reln = EnglishGrammaticalRelations.valueOf(engRelnName);
    return new AddEdge(govName, depName, reln);
  }


  public static AddEdge createEngAddEdge(String govName, String depName, String engRelnName, double weight) {
    GrammaticalRelation reln = EnglishGrammaticalRelations.valueOf(engRelnName);
    return new AddEdge(govName, depName, reln, weight);
  }

View Full Code Here

  /**
   * Creates an EnglishGrammaticalRelation AddDep edit.
   * @param newNode String representation of new dependent IndexedFeatureNode map.
   */
  public static AddDep createEngAddDep(String govNodeName, String engRelation,  String newNode) {
    GrammaticalRelation relation = EnglishGrammaticalRelations.valueOf(engRelation);
//  IndexedWord newNodeObj = new IndexedWord(CoreLabel.fromAbstractMapLabel(IndexedFeatureLabel.valueOf(newNode, MapFactory.HASH_MAP_FACTORY)));
    IndexedWord newNodeObj = fromCheapString(newNode);
    return new AddDep(govNodeName, relation, newNodeObj);
  }

View Full Code Here

   */
  public static List<SemanticGraphEdge> edgesWithReln(Iterable<SemanticGraphEdge> edges,
                                                      GrammaticalRelation reln) {
    List<SemanticGraphEdge> found = Generics.newArrayList();
    for (SemanticGraphEdge edge : edges) {
      GrammaticalRelation tgtReln = edge.getRelation();
      if (tgtReln.equals(reln)) {
        found.add(edge);
      }
    }
    return found;
  }

View Full Code Here

   *
   */
  public static List<SemanticGraphEdge> findAllRelnsWithPrefix(SemanticGraph sg, String prefix) {
    ArrayList<SemanticGraphEdge> relns = new ArrayList<SemanticGraphEdge>();
    for (SemanticGraphEdge edge : sg.edgeIterable()) {
      GrammaticalRelation edgeRelation = edge.getRelation();
      if (edgeRelation.toString().startsWith(prefix)) {
        relns.add(edge);
      }
    }
    return relns;
  }

View Full Code Here

   * generated edges indeed do have collapsed preps as strings.
   */
  public static void enRepairEdges(SemanticGraph sg, boolean verbose) {
    for (SemanticGraphEdge edge : sg.edgeIterable()) {
      if (edge.getRelation().isFromString()) {
        GrammaticalRelation newReln =
          EnglishGrammaticalRelations.valueOf(edge.getRelation().toString());
        if (newReln != null) {
          IndexedWord gov = edge.getGovernor();
          IndexedWord dep = edge.getDependent();
          double weight = edge.getWeight();

View Full Code Here

          throw new RuntimeIOException("Failed to find node " + ie.target + "-" + ie.targetCopy);
        }
        assert(target != null);
        synchronized (LOCK) {
          // this is not thread-safe: there are static fields in GrammaticalRelation
          GrammaticalRelation rel = GrammaticalRelation.valueOf(ie.dep);
          graph.addEdge(source, target, rel, 1.0, ie.isExtra);
        }
      }
      
      // compute root nodes if they weren't stored in the graph

View Full Code Here

   *
   * @param conjunctionString The conjunction to make a GrammaticalRelation out of
   * @return A grammatical relation for this conjunction
   */
  public static GrammaticalRelation getConj(String conjunctionString) {
    GrammaticalRelation result = conjs.get(conjunctionString);
    if (result == null) {
      synchronized(conjs) {
        result = conjs.get(conjunctionString);
        if (result == null) {
          result = new GrammaticalRelation(Language.English, "conj", "conj_collapsed", CONJUNCT, conjunctionString);
          conjs.put(conjunctionString, result);
          threadSafeAddRelation(result);
        }
      }
    }

View Full Code Here

0 1 2

TOP

Related Classes of edu.stanford.nlp.trees.GrammaticalRelation

edu.stanford.nlp.dcoref.Mention

edu.stanford.nlp.ie.machinereading.BasicRelationFeatureFactory

edu.stanford.nlp.parser.nndep.DependencyParser

edu.stanford.nlp.parser.nndep.DependencyParserITest

edu.stanford.nlp.pipeline.AnnotationSerializer$IntermediateSemanticGraph

edu.stanford.nlp.pipeline.ProtobufAnnotationSerializer

edu.stanford.nlp.semgraph.SemanticGraphUtils

edu.stanford.nlp.semgraph.semgrex.ssurgeon.AddDep

edu.stanford.nlp.semgraph.semgrex.ssurgeon.AddEdge

edu.stanford.nlp.trees.EnglishGrammaticalRelations

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.