I am using
tre-agrep (manpage), an implementation of
agrep (manpage), to perform approximate pattern matching. This utility searches for matches based on Levenshtein distance, and the user can configure the penalty applied for substitution, insertion, or deletion edits.
I would like, however, to apply weighs differentially across the length of the query, namely with a lower weight for deletions at the beginning (left end) of the query than at the right. The
man page for this utility does not indicate that such a level of control is possible.
Are there other command line tools where approximate matching with finer control over the mismatch penalties is possible?