Skip to content
Reference implementations of basic and advanced hypergraph algorithms.
Python
Branch: master
Clone or download
Latest commit 4f471e5 Aug 12, 2019
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
hypergraphs added MERT semiring notes Aug 12, 2019
.hgignore adding project boilerplate (`.hgignore` and `setup.py`) Aug 12, 2019
README.md update readme Aug 12, 2019
setup.py adding project boilerplate (`.hgignore` and `setup.py`) Aug 12, 2019

README.md

This is a reference implementation of various hypergraph algorithms with an emphasis on clarity and generality over performance.

I have decided to release it in a somewhat rough state. I am happy to expand it in a number of ways if there is a demand for it. If you have any questions about this code, please let me know.

However, even in its current state, I believe that there is a lot of useful stuff worked out and implemented. Most notable are the advanced dynamic programming algorithms presented in

Li & Einser (2009) First- and Second-Order Expectation Semirings with Applications to Minimum-Risk Training on Translation Forests

and

Dyer (2013) Minimum Error Rate Training and the Convex Hull Semiring

Citation: If you found this useful, please cite it as

@software{vieira-hypergraphs,
  author = {Tim Vieira},
  title = {hypergraphs: A reference implementation of basic and advanced hypergraph algorithms},
  url = {https://github.com/timvieira/hypergraphs}
}
You can’t perform that action at this time.