Package org.maltparserx.core.syntaxgraph.node

Examples of org.maltparserx.core.syntaxgraph.node.DependencyNode

700
701
702
703
704
705
706
707
708
709
710
    }
    return childSuccess && success;
  }

  private DependencyNode breadthFirstSearchSortedByDistanceForPath(DependencyStructure dg, DependencyNode start, DependencyNode avoid) {
    DependencyNode dependent;
    Vector<DependencyNode> nodes = new Vector<DependencyNode>(), newNodes;
    nodes.addAll(findAllDependentsVectorSortedByDistanceToPProjNode(dg, start, avoid, true));
    while (nodes.size() > 0) {
      dependent = nodes.remove(0);
      if (((newNodes = findAllDependentsVectorSortedByDistanceToPProjNode(dg, dependent, avoid, true)).size()) == 0) {
View Full Code Here
716
717
718
719
720
721
722
723
724
725
726
  }

  private boolean deprojectivizeWithHeadAndPath(DependencyStructure pdg, DependencyNode node) throws MaltChainedException {
    boolean success = true, childSuccess = false;
    int i, childAttempts = 2;
    DependencyNode child, possibleSyntacticHead;
    if (node.hasHead() && node.getHeadEdge().isLabeled() && nodeLifted.get(node.getIndex()) && nodePath.get(node.getIndex())) {
      possibleSyntacticHead = breadthFirstSearchSortedByDistanceForHeadAndPath(pdg, node.getHead(), node, synacticHeadDeprel.get(node
          .getIndex()));
      if (possibleSyntacticHead != null) {
        pdg.moveDependencyEdge(possibleSyntacticHead.getIndex(), node.getIndex());
View Full Code Here
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
    return childSuccess && success;
  }

  private DependencyNode breadthFirstSearchSortedByDistanceForHeadAndPath(DependencyStructure dg, DependencyNode start, DependencyNode avoid, String syntacticHeadDeprelCode)
      throws MaltChainedException {
    DependencyNode dependent;
    Vector<DependencyNode> nodes = new Vector<DependencyNode>(), newNodes = null, secondChance = new Vector<DependencyNode>();
    nodes.addAll(findAllDependentsVectorSortedByDistanceToPProjNode(dg, start, avoid, true));
    while (nodes.size() > 0) {
      dependent = nodes.remove(0);
      if (((newNodes = findAllDependentsVectorSortedByDistanceToPProjNode(dg, dependent, avoid, true)).size()) == 0
          && deprelSymbolTable.getSymbolCodeToString(dependent.getHeadEdge().getLabelCode(deprelSymbolTable)).equals(syntacticHeadDeprelCode)) {
        return dependent;
      }
      nodes.addAll(newNodes);
      if (deprelSymbolTable.getSymbolCodeToString(dependent.getHeadEdge().getLabelCode(deprelSymbolTable)).equals(syntacticHeadDeprelCode)
          && newNodes.size() != 0) {
        secondChance.add(dependent);
      }
    }
    if (secondChance.size() > 0) {
View Full Code Here
200
201
202
203
204
205
206
207
208
209
210
211
212
213
   * @param target a target dependency structure
   * @throws MaltChainedException
   */
  protected void copyEdges(DependencyStructure source, DependencyStructure target) throws MaltChainedException {
    for (int index : source.getTokenIndices()) {
      DependencyNode snode = source.getTokenNode(index);
     
      if (snode.hasHead()) {
        Edge s = snode.getHeadEdge();
        Edge t = target.addDependencyEdge(s.getSource().getIndex(), s.getTarget().getIndex());
       
        for (SymbolTable table : s.getLabelTypes()) {
          t.addLabel(table, s.getLabelSymbol(table));
        }
View Full Code Here
215
216
217
218
219
220
221
222
223
224
225
226
227
228
    }
  }
 
  protected void copyDynamicInput(DependencyStructure source, DependencyStructure target) throws MaltChainedException {
    for (int index : source.getTokenIndices()) {
      DependencyNode snode = source.getTokenNode(index);
      DependencyNode tnode = target.getTokenNode(index);
      for (SymbolTable table : snode.getLabelTypes()) {
        if (!tnode.hasLabel(table)) {
          tnode.addLabel(table,snode.getLabelSymbol(table));
        }
      }
    }
  }
View Full Code Here
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
    }
    GuideUserAction action = null;
    if (stack.size() < 2) {
      action = updateActionContainers(NonProjective.SHIFT, null);
    } else {
      DependencyNode left = stack.get(stack.size()-2);
      int leftIndex = left.getIndex();
      int rightIndex = stack.get(stack.size()-1).getIndex();
      if (swapArray.get(leftIndex) > swapArray.get(rightIndex)) {
        action =  updateActionContainers(NonProjective.SWAP, null);
      } else if (!left.isRoot() && gold.getTokenNode(leftIndex).getHead().getIndex() == rightIndex
          && nodeComplete(gold, config.getDependencyGraph(), leftIndex)) {
        action = updateActionContainers(NonProjective.LEFTARC, gold.getTokenNode(leftIndex).getHeadEdge().getLabelSet());
      } else if (gold.getTokenNode(rightIndex).getHead().getIndex() == leftIndex
          && nodeComplete(gold, config.getDependencyGraph(), rightIndex)) {
        action = updateActionContainers(NonProjective.RIGHTARC, gold.getTokenNode(rightIndex).getHeadEdge().getLabelSet());
View Full Code Here
76
77
78
79
80
81
82
83
84
85
86
87
88
89
  }
 
  public void setDependencyGraph(DependencyStructure source) throws MaltChainedException {
    dependencyGraph.clear();
    for (int index : source.getTokenIndices()) {
      DependencyNode gnode = source.getTokenNode(index);
      DependencyNode pnode = dependencyGraph.addTokenNode(gnode.getIndex());
      for (SymbolTable table : gnode.getLabelTypes()) {
        pnode.addLabel(table, gnode.getLabelSymbol(table));
      }
     
      if (gnode.hasHead()) {
        Edge s = gnode.getHeadEdge();
        Edge t = dependencyGraph.addDependencyEdge(s.getSource().getIndex(), s.getTarget().getIndex());
View Full Code Here
125
126
127
128
129
130
131
132
133
134
135
136
        input.add(dependencyGraph.getDependencyNode(sourceInput.get(i).getIndex()));
      }
    } else {
      stack.push(dependencyGraph.getDependencyRoot());
      for (int i = dependencyGraph.getHighestTokenIndex(); i > 0; i--) {
        final DependencyNode node = dependencyGraph.getDependencyNode(i);
        if (node != null && !node.hasHead()) {
          input.push(node);
        }
      }
    }
  }
View Full Code Here
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
  public void apply(GuideUserAction currentAction, ParserConfiguration configuration) throws MaltChainedException {
    final StackConfig config = (StackConfig)configuration;
    final Stack<DependencyNode> stack = config.getStack();
    currentAction.getAction(actionContainers);
    Edge e = null;
    DependencyNode head = null;
    DependencyNode dep = null;
    switch (transActionContainer.getActionCode()) {
    case LEFTARC:
      head = stack.pop();
      dep = stack.pop();
      e = config.getDependencyStructure().addDependencyEdge(head.getIndex(), dep.getIndex());
      addEdgeLabels(e);
      stack.push(head);
      break;
    case RIGHTARC:
      dep = stack.pop();
      e = config.getDependencyStructure().addDependencyEdge(stack.peek().getIndex(), dep.getIndex());
      addEdgeLabels(e);
      break;
    default:
      final Stack<DependencyNode> input = config.getInput();
      if (input.isEmpty()) {
View Full Code Here
34
35
36
37
38
39
40
41
42
43
44
45
46
47
      swapArrayActive = true;
    }
    if (stack.size() < 2) {
      return updateActionContainers(NonProjective.SHIFT, null);
    } else {
      final DependencyNode left = stack.get(stack.size()-2);
      final DependencyNode right = stack.get(stack.size()-1);
      final int leftIndex = left.getIndex();
      final int rightIndex = right.getIndex();
      if (swapArray.get(leftIndex) > swapArray.get(rightIndex) && necessarySwap(gold, config.getDependencyGraph(), right, config.getInput())) {
        return updateActionContainers(NonProjective.SWAP, null);
      } else if (!left.isRoot() && gold.getTokenNode(leftIndex).getHead().getIndex() == rightIndex
          && nodeComplete(gold, config.getDependencyGraph(), leftIndex)) {
        return updateActionContainers(NonProjective.LEFTARC, gold.getTokenNode(leftIndex).getHeadEdge().getLabelSet());
View Full Code Here
TOP

Related Classes of org.maltparserx.core.syntaxgraph.node.DependencyNode

  • org.maltparserx.core.propagation.Propagation
  • org.maltparserx.core.syntaxgraph.CopyChartItem
  • org.maltparserx.core.syntaxgraph.DependencyGraph
  • org.maltparserx.core.syntaxgraph.ds2ps.LosslessMapping
  • org.maltparserx.core.syntaxgraph.feature.ArcDirFeature
  • org.maltparserx.core.syntaxgraph.feature.DGraphAddressFunction
  • org.maltparserx.core.syntaxgraph.feature.DistanceFeature
  • org.maltparserx.core.syntaxgraph.feature.InputArcDirFeature
  • org.maltparserx.core.syntaxgraph.feature.InputArcFeature
  • org.maltparserx.core.syntaxgraph.feature.InputColumnFeature
    • 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.