Package org.maltparserx.core.syntaxgraph

Examples of org.maltparserx.core.syntaxgraph.DependencyGraph

23
24
25
26
27
28
29
 
  public StackConfig(SymbolTableHandler symbolTableHandler) throws MaltChainedException {
    super();
    stack = new Stack<DependencyNode>();
    input = new Stack<DependencyNode>();
    dependencyGraph = new DependencyGraph(symbolTableHandler);
  }
View Full Code Here
27
28
29
30
31
32
33
34
35
 
  public CovingtonConfig(SymbolTableHandler symbolTableHandler, boolean cr, boolean cs) throws MaltChainedException {
    super();
    input = new ArrayList<DependencyNode>();
    dependencyGraph = new DependencyGraph(symbolTableHandler);
    setAllowRoot(cr);
    setAllowShift(cs);
  }
View Full Code Here
25
26
27
28
29
30
31
32
33
 
  public NivreConfig(SymbolTableHandler symbolTableHandler, boolean allowRoot, boolean allowReduce) throws MaltChainedException {
    super();
    stack = new Stack<DependencyNode>();
    input = new Stack<DependencyNode>();
    dependencyGraph = new DependencyGraph(symbolTableHandler);
    setAllowRoot(allowRoot);
    setAllowReduce(allowReduce);
  }
View Full Code Here
50
51
52
53
54
55
56
57
58
59
60
 
  public PlanarConfig(SymbolTableHandler symbolTableHandler, String noCoveredRoots , String acyclicity , String connectedness , String rootHandling ) throws MaltChainedException {
    super();
    stack = new Stack<DependencyNode>();
    input = new Stack<DependencyNode>();
    dependencyGraph = new DependencyGraph(symbolTableHandler);
    setRootHandling(rootHandling);
    setNoCoveredRoots(Boolean.valueOf(noCoveredRoots));
    setAcyclicity(Boolean.valueOf(acyclicity));
    setConnectedness(connectedness);
  }
View Full Code Here
62
63
64
65
66
67
68
69
70
71
72
    super();
    firstStack = new Stack<DependencyNode>();
    secondStack = new Stack<DependencyNode>();
    activeStack = FIRST_STACK;
    input = new Stack<DependencyNode>();
    dependencyGraph = new DependencyGraph(symbolTableHandler);
    setRootHandling(rootHandling);
    setNoCoveredRoots(Boolean.valueOf(noCoveredRoots));
    setAcyclicity(Boolean.valueOf(acyclicity));
    setReduceAfterSwitch(Boolean.valueOf(reduceAfterSwitch));
  }
View Full Code Here
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
    }
    if (tokens == null || tokens.length == 0) {
      throw new MaltChainedException("Nothing to parse. ");
    }

    DependencyStructure outputGraph = new DependencyGraph(singleMalt.getSymbolTables());
   
    for (int i = 0; i < tokens.length; i++) {
      Iterator<ColumnDescription> columns = dataFormatInstance.iterator();
      DependencyNode node = outputGraph.addDependencyNode(i+1);
      String[] items = tokens[i].split("\t");
      for (int j = 0; j < items.length; j++) {
        if (columns.hasNext()) {
          ColumnDescription column = columns.next();
          if (column.getCategory() == ColumnDescription.INPUT && node != null) {
            outputGraph.addLabel(node, column.getName(), items[j]);
          }
        }
      }
    }
    outputGraph.setDefaultRootEdgeLabel(outputGraph.getSymbolTables().getSymbolTable("DEPREL"), "ROOT");
    // Invoke parse with the output graph
    singleMalt.parse(outputGraph);
    return outputGraph;
  }
View Full Code Here
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
      throw new MaltChainedException("No parser model has been initialized. Please use the method initializeParserModel() before invoking this method.");
    }
    if (tokens == null || tokens.length == 0) {
      throw new MaltChainedException("Nothing to convert. ");
    }
    DependencyStructure outputGraph = new DependencyGraph(singleMalt.getSymbolTables());
   
    for (int i = 0; i < tokens.length; i++) {
      Iterator<ColumnDescription> columns = dataFormatInstance.iterator();
      DependencyNode node = outputGraph.addDependencyNode(i+1);
      String[] items = tokens[i].split("\t");
      Edge edge = null;
      for (int j = 0; j < items.length; j++) {
        if (columns.hasNext()) {
          ColumnDescription column = columns.next();
          if (column.getCategory() == ColumnDescription.INPUT && node != null) {
            outputGraph.addLabel(node, column.getName(), items[j]);
          } else if (column.getCategory() == ColumnDescription.HEAD) {
            if (column.getCategory() != ColumnDescription.IGNORE && !items[j].equals("_")) {
              edge = ((DependencyStructure)outputGraph).addDependencyEdge(Integer.parseInt(items[j]), i+1);
            }
          } else if (column.getCategory() == ColumnDescription.DEPENDENCY_EDGE_LABEL && edge != null) {
            outputGraph.addLabel(edge, column.getName(), items[j]);
          }
        }
      }
    }
    outputGraph.setDefaultRootEdgeLabel(outputGraph.getSymbolTables().getSymbolTable("DEPREL"), "ROOT");
    return outputGraph;
  }
View Full Code Here
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
    // Creates a dependency graph
    if (tokens == null || tokens.length == 0) {
      throw new MaltChainedException("Nothing to convert. ");
    }
    DependencyStructure outputGraph = new DependencyGraph(symbolTables);
   
    for (int i = 0; i < tokens.length; i++) {
      Iterator<ColumnDescription> columns = dataFormatInstance.iterator();
      DependencyNode node = outputGraph.addDependencyNode(i+1);
      String[] items = tokens[i].split("\t");
      Edge edge = null;
      for (int j = 0; j < items.length; j++) {
        if (columns.hasNext()) {
          ColumnDescription column = columns.next();
          if (column.getCategory() == ColumnDescription.INPUT && node != null) {
            outputGraph.addLabel(node, column.getName(), items[j]);
          } else if (column.getCategory() == ColumnDescription.HEAD) {
            if (column.getCategory() != ColumnDescription.IGNORE && !items[j].equals("_")) {
              edge = ((DependencyStructure)outputGraph).addDependencyEdge(Integer.parseInt(items[j]), i+1);
            }
          } else if (column.getCategory() == ColumnDescription.DEPENDENCY_EDGE_LABEL && edge != null) {
            outputGraph.addLabel(edge, column.getName(), items[j]);
          }
        }
      }
    }
    outputGraph.setDefaultRootEdgeLabel(outputGraph.getSymbolTables().getSymbolTable("DEPREL"), "ROOT");
    return outputGraph;
  }
View Full Code Here
TOP

Related Classes of org.maltparserx.core.syntaxgraph.DependencyGraph

  • org.maltparserx.core.syntaxgraph.edge.Edge
  • org.maltparserx.core.syntaxgraph.edge.GraphEdge
  • org.maltparserx.core.syntaxgraph.node.DependencyNode
  • org.maltparserx.core.syntaxgraph.node.Node
  • org.maltparserx.core.syntaxgraph.node.Root
  • org.maltparserx.MaltParserService
  • org.maltparserx.parser.algorithm.covington.CovingtonConfig
  • org.maltparserx.parser.algorithm.nivre.NivreConfig
  • org.maltparserx.parser.algorithm.planar.PlanarConfig
  • org.maltparserx.parser.algorithm.stack.StackConfig
    • 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.