Skip to content

PyTorch implementation of Graph Matching Networks, adapted specifically for Linguistic Trees, e.g., Graph Matching with Bi-level Noisy Correspondence (COMMON, ICCV 2023), Graph Matching Networks for Learning the Similarity of Graph Structured Objects (GMN, ICML 2019).

License

Notifications You must be signed in to change notification settings

jlunder00/Tree-Matching-Networks

 
 

Repository files navigation

Tree Matching Networks

LICENSE last commit

In this repo, implementations of Graph Matching algorithms from the referenced papers are adapted, utilized for, and tested on linguistic trees.

Yijie Lin, Mouxing Yang, Jun Yu, Peng Hu, Changqing Zhang, Xi Peng. Graph Matching with Bi-level Noisy Correspondence. ICCV, 2023. [paper] [code].

Yujia Li, Chenjie Gu, Thomas Dullien, Oriol Vinyals, Pushmeet Kohli. Graph Matching Networks for Learning the Similarity of Graph Structured Objects. ICML 2019. [paper] [code].

About

PyTorch implementation of Graph Matching Networks, adapted specifically for Linguistic Trees, e.g., Graph Matching with Bi-level Noisy Correspondence (COMMON, ICCV 2023), Graph Matching Networks for Learning the Similarity of Graph Structured Objects (GMN, ICML 2019).

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Python 96.5%
  • C++ 2.5%
  • Other 1.0%