| W06-3813 | central node , and continues with | edge matching | . If G ( w ) is the graph centered |
| N03-3005 | algorithm looks up in the chart for | edges matching | a specific daughter . Instead |
| W06-3813 | between two graphs . We note that | edge matching | uses only edge information -- |
| M91-1020 | efficient manner , so the active chart | edge matching | and proposing mechanisms are |
| P11-1076 | quality of the match while the the | edge matching | eschews the pattern-based approach |
| D08-1037 | si ) , presented in Figure 5 an | edge matching | a vowel to a Hebrew character |
| W10-4010 | PRi | S | -- Similarity-based . | Edge matching | techniques similar to those of |
| W10-4010 | extension of TITLE J -- Jaccard-based | edge matching | between title and sentence graphs |
| W10-4010 | extension of D COV O -- Overlap-based | edge matching | between sentence and document |
| W10-4010 | extension of TITLE O -- Overlap-based | edge matching | between title and sentence graphs |
| W10-4010 | Szpakowicz ( 2006 ) are used . | Edge matching | is an alternative approach to |
| W10-4010 | extension of D COV J -- Jaccard-based | edge matching | 5Using undirected word graphs |
| N13-1040 | 2006 ) we employ the hierarchical | edge matching | scheme which aggregates counts |
