I'm trying to align a sequence of characters together, I found that sequence alignment algorithms which use dynamic programming like Needleman-Wunsch or SmithWaterman only align one character with one character beside allowing character substitution, deletion or insertion.For example, if I have a set of similarly sounding characters, likemonir, monier, muneer, munir, mounir, mouneerThe alignment algorithm will produce the following outputm u n i - r| | | |   |m o n e e rIs there a way to adapt these algorithms (or an alternative algorithm) to consider aligning/substituting character with more than one character in order to output something likem u n i  r| | | |  |m o n ee rPlease note that, I'm using the standard java implementation for these algorithms and I don't have a predefined list of similarly sounding characters, so I'm trying to aligning the similar words together in order to extract these alignments.
Sequence alignment with one to many characters
algorithms;strings;edit distance