I am afraid the order is the big issue here.
The list I usually get is e.g. chronological list of shows. The filenames do not necessarily follow that order. I just realized that possibly the fastest solution would be to rearrange the list itself, i.e. sort it alphabetically. As most of the files have (or can be made to have) the first letter correct, the rearrangement of files (by means of manual rename) could be quite easy.
Having said that, I had a look at the Levenshtein distance. I was familiar with the concept, but imagined the application would be rather complicated. In fact, it is not - I had a working Perl script within minutes... While it is quite rough at the edges, it did the test job quite well.
As I said, the script is rather amateurish, but if someone insists, I can put it here. By the way, Perl is great here as parsing through the filename list (and the list of files) is very fast. An application (e.g. VB) might be easier to use, but I suppose it would be much slower...