Joerg Tiedemann > Lingua-Align > Lingua::Align::LinkSearch::Assignment

Download:
Lingua-Align-0.04.tar.gz

Dependencies

Annotate this POD

CPAN RT

New  1
Open  0
View/Report Bugs
Source  

NAME ^

Lingua::Align::LinkSearch::Assignment - Alignment as an assignment problem in bipartite graphs

SYNOPSIS ^

DESCRIPTION ^

This module uses the Kuhn-Munkres algorithm using Algorithm::Munkres to assign links between tree nodes. In this way, alignment is treated as an assignment problem in a bipartite graph. As a consequence, only one-to-one alignments will be found. Well-formedness constraints for tree alignment cannot be enforced.

SEE ALSO ^

http://en.wikipedia.org/wiki/Hungarian_algorithm

AUTHOR ^

Joerg Tiedemann

COPYRIGHT AND LICENSE ^

Copyright (C) 2009 by Joerg Tiedemann

This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself, either Perl version 5.8.8 or, at your option, any later version of Perl 5 you may have available.

syntax highlighting: