Yves Lepage
Easier C programming
Dynamic programming
Abstract:This report describes the dynamic programming facility developed for our programming work on distances among computational linguistics objects. We propose a set of functions to implement a simple database. The search and retrieve method uses AVL trees. Using this simple database structure, any function with two arguments of any type can be declared as a "dynamic" function. This is done using predefined macros. As an example, we applied the dynamic programming facility to the implementation of a general distance.
Keywords: Programming in C, dynamic programming, distance calculation.