Saturday, 16 November 2013


Intro: A perfect hash function maps a static set of n keys into a set of m integer numbers without collisions, where m is greater than or equal to n. If m is equal to n, the function is called minimal.

Sunday, 10 November 2013


Intro: a tool to assist manual alignment in MT, summarization, ...