Package opennlp.ccg.hylo.graph

Examples of opennlp.ccg.hylo.graph.LFVertex

321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
      }
    }
  }
 
  private Element createDisjunctiveElement(DLFContext context) {
    LFVertex alias = vertexAliases.get(context.vertex);
   
    String vertexName = nameFor(context.vertex);
    boolean imported = importedVertices.contains(context.vertex);
   
    Element newNode = document.createElement(NODE_TAG);
    context.parent.appendChild(newNode);
   
    DLFContext localContext = context.copy();
    localContext.parent = newNode;
    Set<LFVertex> locals = localContext.getVertices(LOCAL_ANCESTOR),
        visited = localContext.getVertices(VISITED);
   
    if(locals.contains(localContext.vertex)
        || (alias != null && visited.contains(localContext.vertex))) {
      LFVertex v = (alias == null) ? localContext.vertex : alias;
      localContext.parent.setAttribute(IDREF_ATTR, nameFor(v));
     
      if(visited.contains(localContext.vertex)
          && localContext.getVertices(SHARED).contains(v) && !locals.contains(v)) {
        localContext.parent.setAttribute(SHARED_ATTR, "true");
View Full Code Here
434
435
436
437
438
439
440
441
442
443
444
      doInsertDelete(ctxt.copy(), del);
    }
  }
 
  private void doInsertDelete(DLFContext context, LFEdge edge) {
    LFVertex trg = edge.getTarget();
    DLFContext ctxt = context.copy();
    ctxt.vertex = trg;
    ctxt.parent = addRelation(ctxt, edge.getLabel());
    ctxt.addVertex(trg, OPTIONAL);
   
View Full Code Here
459
460
461
462
463
464
465
466
467
468
469
  private void processNonsubstitutedEdge(DLFContext context, LFEdge outgoing) {
    if(!context.getVertices(PREDICATES).contains(context.vertex)) {
      setPredicateName(context);
    }
   
    LFVertex trg = outgoing.getTarget();
    Set<LFVertex> similarTargets = new FilteredSet<LFVertex>(context.getVertices(OPTIONAL),
        new SimilarTargetVertexFilter(trg));
   
    if(similarTargets.isEmpty()) {
      DLFContext ctxt = context.copy();
View Full Code Here
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
   
    boolean aliased = false;
    context.parent = toAppendTo;
   
    for(LFEdge s : substituedEdges) {
      LFVertex t = s.getTarget();
      String vPred = context.vertex.getPredicate(), tPred = t.getPredicate();
      LFEdgeLabel l = s.getLabel();
     
      context.parent = addRelation(context, l);
     
      // shared?
      if(vPred != null && vPred.equals(tPred) && !label.equals(l)) {
        Element subNode = addElement(context, NODE_TAG);
        subNode.setAttribute(IDREF_ATTR, nameFor(context.vertex));
       
        LFVertex sAlias = vertexAliases.get(context.vertex);
        if(context.getVertices(VISITED).contains(sAlias)
            && context.getVertices(SHARED).contains(sAlias)
            && !context.getVertices(LOCAL_ANCESTOR).contains(sAlias)) {
          subNode.setAttribute(SHARED_ATTR, "true");
        }
View Full Code Here
TOP

Related Classes of opennlp.ccg.hylo.graph.LFVertex

  • opennlp.ccg.disjunctivizer.AlignedEdgeFilterTest
  • opennlp.ccg.disjunctivizer.Disjunctivizer
  • opennlp.ccg.disjunctivizer.EdgeMatchFilterTest
  • opennlp.ccg.disjunctivizer.FilteredLFEdgeSetTest
  • opennlp.ccg.disjunctivizer.LabelMatchFilterTest
  • opennlp.ccg.disjunctivizer.LFGraphDifference$SourceView
  • opennlp.ccg.disjunctivizer.LFGraphDifferenceTest
  • opennlp.ccg.disjunctivizer.VertexMatchFilterTest
  • opennlp.ccg.hylo.Proposition
    • 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.