Remove stringology::matching::HammingMatchingAutomaton::construct_unclean() and ajdust tests accordingly.

the same base algorithm as the rest of dynamic programing simulations.

Implement simulation for aproximate string matching using dynamic programming and General Levenshtein distance.

Implement simulation for aproximate string matching using dynamic programming and Levenshtein distance.

Implement simulation for aproximate string matching using dynamic programming and Levenshtein distance.

Implement simulation for aproximate string matching using bit paralelism and Generalized Levenshtein distance.

Tomáš Čapek authored 6 years ago and Jan Trávníček committed 6 years ago

Add registrations of all WildcardLinearString implementations in stringology::matching::*Automaton classes.