In a related question the other day, ikegami posted a solution using String::LCSS_XS, which he later deleted. This led me to investigate what other modules which find longest common substrings are available on CPAN. Here is what I found:
Note that there are other modules with similar names, but they relate to longest common subsequences.
String::LCSS_XS seems to be the best of the bunch. It has one reported bug, but the bug is simple to avoid, and there is even a potential patch.
The other 3 modules have reported functional bugs for which there are no specified workarounds or patches.
Algorithm::LCSS was last updated in 2003 (which was a magical year for LCSS modules, apparently). The author's last activity on CPAN (for other modules) was in 2008. Soon after that, 2 bugs were filed, but the author never responded to either one.
The POD for Tree::Suffix indicates that the author has ceased to maintain the module due to numerous bugs in an external dependency.
In reply to Re: A better implementation of LCSS?
by toolic
in thread A better implementation of LCSS?
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |