Package opennlp.ccg.hylo.graph

Examples of opennlp.ccg.hylo.graph.LFVertex

23
24
25
26
27
28
29
30
31
32
33
34
 
  @Before
  public void setUp() throws Exception {
    super.setUp();
   
    edge = new LFEdge(new LFVertex(new NominalAtom("w0"), new Proposition("blah")),
        new LFVertex(new NominalAtom("w1"), new Proposition("blah blah")),
        new LFEdgeLabel(new ModeLabel("blase")));
   
    filter = new EdgeMatchFilter(edge, MatchType.LABEL_MISMATCH, MatchType.SOURCE_PREDICATE_MISMATCH,
        MatchType.TARGET_PREDICATE_MATCH);
  }
View Full Code Here
44
45
46
47
48
49
50
51
52
53
54
55
    }
  }
 
  @Test
  public void testAllows() {
    LFEdge test = new LFEdge(new LFVertex(new NominalAtom("w0"), new Proposition("blah blah")),
        new LFVertex(new NominalAtom("w1"), new Proposition("blah blah")),
        new LFEdgeLabel(new ModeLabel("boring")));
   
    assertTrue(filter.allows(test));
   
    test = new LFEdge(test.getSource(), test.getTarget(), edge.getLabel());
View Full Code Here
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
 
  @Before
  public void setUp() throws Exception {
    super.setUp();
   
    one = new LFEdge(new LFVertex(new NominalAtom("w0"), new Proposition("blah")),
        new LFVertex(new NominalAtom("w1"), new Proposition("blah blah")),
        new LFEdgeLabel(new ModeLabel("blase")));
    two = new LFEdge(new LFVertex(new NominalAtom("w2"), new Proposition("blah")),
        new LFVertex(new NominalAtom("w3"), new Proposition("blah blah")),
        new LFEdgeLabel(new ModeLabel("blurg")));
   
    label = new LFEdgeLabel(new ModeLabel("blase"));
   
    filter = new LabelMatchFilter(label);
View Full Code Here
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
  }

  @SuppressWarnings("unchecked")
  @Test
  public void testAllows() {
    LFEdge one = new LFEdge(new LFVertex(new NominalAtom("w0"), new Proposition("blah")),
        new LFVertex(new NominalAtom("w1"), new Proposition("blah blah")),
        new LFEdgeLabel(new ModeLabel("blase"))),
      two = new LFEdge(new LFVertex(new NominalAtom("w2"), new Proposition("blah")),
        new LFVertex(new NominalAtom("w3"), new Proposition("blah blah")),
        new LFEdgeLabel(new ModeLabel("blase")));
   
    assertTrue(filter.allows(one));
    assertFalse(filter.allows(two));
   
View Full Code Here
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
    alignment.add(new Mapping(1, 0));
    alignment.add(new Mapping(2, 1));
   
    aGraph = new LFGraph();
   
    LFVertex aw0 = new LFVertex(new NominalAtom("w0"), new Proposition("a")),
      aw1 = new LFVertex(new NominalAtom("w1"), new Proposition("boy")),
      aw2 = new LFVertex(new NominalAtom("w2"), new Proposition("walk")),
      aw3 = new LFVertex(new NominalAtom("w3"), new Proposition("quickly"));
   
    aGraph.addVertex(aw0);
    aGraph.addVertex(aw1);
    aGraph.addVertex(aw2);
    aGraph.addVertex(aw3);
       
    aDet = aGraph.addLabeledEdge(aw1, aw0, LFEdgeLabel.forMode(new ModeLabel("Det")));
    aArg0 = aGraph.addLabeledEdge(aw2, aw1, LFEdgeLabel.forMode(new ModeLabel("Arg0")));
    aMod = aGraph.addLabeledEdge(aw2, aw3, LFEdgeLabel.forMode(new ModeLabel("Mod")));
   
    bGraph = new LFGraph();
   
    LFVertex bw0 = new LFVertex(new NominalAtom("w0"), new Proposition("he")),
      bw1 = new LFVertex(new NominalAtom("w1"), new Proposition("move"));
   
    bGraph.addVertex(bw0);
    bGraph.addVertex(bw1);
       
    bArg0 = bGraph.addLabeledEdge(bw1, bw0, LFEdgeLabel.forMode(new ModeLabel("Arg0")));
View Full Code Here
23
24
25
26
27
28
29
30
31
32
33
34
35
36
  @Before
  public void setUp() throws Exception {
    super.setUp();
   
    one = new LFVertex(new NominalAtom("w0"), new Proposition("blah"));
    two = new LFVertex(new NominalAtom("w1"), new Proposition("blah"));
   
    edge = new LFEdge(two,
        new LFVertex(new NominalAtom("w2"), new Proposition("blah blah")),
        new LFEdgeLabel(new ModeLabel("blase")));
   
    filter = new VertexMatchFilter(two, MatchType.SOURCE_MATCH);
  }
View Full Code Here
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
  @SuppressWarnings("unchecked")
  @Before
  public void setUp() throws Exception {
    super.setUp();
   
    one = new LFEdge(new LFVertex(new NominalAtom("w0"), new Proposition("blah")),
        new LFVertex(new NominalAtom("w1"), new Proposition("blah blah")),
        new LFEdgeLabel(new ModeLabel("blase")));
    two = new LFEdge(new LFVertex(new NominalAtom("w2"), new Proposition("blah")),
        new LFVertex(new NominalAtom("w3"), new Proposition("blah blah")),
        new LFEdgeLabel(new ModeLabel("bored")));
    three = new LFEdge(new LFVertex(new NominalAtom("w0"), new Proposition("zzz")),
        new LFVertex(new NominalAtom("w2"), new Proposition("snooze")),
        new LFEdgeLabel(new ModeLabel("blase")));
   
    edges = new LinkedHashSet<LFEdge>();
    edges.add(one);
    edges.add(two);
View Full Code Here
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
      }
    }
  }
 
  private void processSubstitutedSimilarTarget(DLFContext context, LFEdge outgoing) {
    LFVertex target = outgoing.getTarget();
    Map<LFVertex, Set<LFEdge>> subsBySource = graphDifference.substitutionsBySourceFor(outgoing);
   
    DLFContext ctxt = context.copy();
   
    // for each substituted edge, look for similar target
    for(LFVertex subSource : subsBySource.keySet()) {
      Set<LFEdge> similarTargetEdges = new FilteredLFEdgeSet(subsBySource.get(subSource),
          new SimilarTargetEdgeFilter(ctxt.vertex, outgoing.getLabel()));
     
      if(!similarTargetEdges.isEmpty()) {
        if(similarTargetEdges.size() > 1) { // more than one similar target?
          System.err.println("more than one similar target edge for " + ctxt.vertex
              + ": " + similarTargetEdges); // TODO figure out what to do about this
        }
       
        assimilateAttributes(ctxt, target, similarTargetEdges.iterator().next().getTarget());
        LFVertex hp = ctxt.getGraph().highestLFAncestorOf(target);
       
        if(hp == null || hp.equals(outgoing.getSource())) {
          context.getVertices(SHARED).add(target);
         
          ctxt.vertex = target;
          ctxt.vertices = context.copyVertices(LOCAL_ANCESTOR, PREDICATES);
          ctxt.parent.appendChild(createDisjunctiveElement(ctxt));
View Full Code Here
371
372
373
374
375
376
377
378
379
380
381
            public Entry<LFVertex, FilteredLFEdgeSet> next() {
              if(edgeIterator == null) {
                edgeIterator = subs.iterator();
              }
             
              LFVertex src = edgeIterator.next().getSource();
             
              return new SimpleImmutableEntry<LFVertex, FilteredLFEdgeSet>(src,
                  new FilteredLFEdgeSet(subs, new VertexMatchFilter(src, SOURCE_MATCH)));
            }
           
View Full Code Here
306
307
308
309
310
311
312
313
314
315
316
317
318
319
   
    LFGraphIterator rootIterator = new LFGraphIterator(graphDifference.b);
    Map<Integer, Set<Integer>> mappings = graphDifference.alignment.asMap(B);
   
    while(rootIterator.hasNext()) {
      LFVertex vertex = rootIterator.next();
     
      if(!foreignAlignedSubgraphRoots.containsKey(vertex)) { // already encountered?
        if(mappings.containsKey(vertex.getIndex())) { // aligned?
          LFGraphIterator subgraphIterator = new LFGraphIterator(graphDifference.b, vertex);
         
          while(subgraphIterator.hasNext()) { // map whole subgraph to the aligned vertex
            foreignAlignedSubgraphRoots.put(subgraphIterator.next(), vertex);
          }
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.