Graph matching
Related Topics
Experts
Publications (10)

1Concept clustering and knowledge integration from a children's dictionary1996  Caroline Barrihre,Fred Popowichstructure between the set of relations is essential to the graph matching operations we use for the integration phase. As we...

2Using Discourse Commitments to Recognize Textual Entailment2008  H. Andrew SchwartzLexical Similarity (Adams, 2006) 0.6200 0.6788 +0.0588 Graph Matching (MacCartney et al., 2006) 0.6433 0.6533 +0.0100 Clas...

3Modern Natural Language Interfaces to Databases: Composing Statistical Parsing with Semantic Tractabilitytraining examples. reducing semantic interpretation to a graph matching problem that is solved by MaxFlow. In this section we...

4Probabilistic TreeEdit Models with Structured Latent Variables for Textual Entailment and Question AnsweringHaghighi et al. (2005) treated alignment finding in RTE as a graph matching problem 1170 between sentence parse trees. MacCartney...

5A Distributed Platform for Sanskrit ProcessingEach analysis gives rise to some penalties issued from graphmatching. Restricting the segmentation solutions to the minimal...

6Improving the Quality of Text Understanding by Delaying Ambiguity ResolutionIdentify semantically aligned parts between PG1 and PG2. Use graph matching to identify alignments (redundant portions) between PG1...

7AN ARCHITECTURE FOR A UNIVERSAL LEXICON A Case Study on Shared Syntactic Information in Japanese, Hindi, Bengali, Greek, and Englishi.e., the complexity may be calculated as ~ipartitc graph matching. We will assume an interlingua9ased MT, which supposedly...

8Learning Bilingual Collocations by WordLevel Sortingsimilarity trees are constructed as shown in Figure 4. Graph matching is then iteratively attempted by compnting mutual in...

9Automatic analysis of semantic similarity in comparable text through syntactic tree matching2010  Erwin Marsi,Emiel Krahmergraphtheoretical terms is a minimum weighted bipartite graph matching. This problem can be solved in polynomial time (O(n3))...

10Improved Unsupervised Sentence Alignment for Symmetrical and Asymmetrical Parallel Corpora2010  Fabienne Braune,Alexander Fraserproblem of, given a parallel text, finding a bipartite graph matching minimal groups of sentences in one language to their...