Hello!
If I have two (fairly long) sequences of text, ('The', 'words', 'are',
'sequence', 'members') and I want all the index numbers of matching pairs
despite the sequences only mostly matching (so a word, or several words, can be
missing from sequence A or sequence B), is there an established algorithm for
doing this?(If I search on "aligning sequences" I get bioinformatics about gene sequences; if I search on "aligning text" I get typography.) Thanks! Graydon
