Occasional speech string matching failures can occur when a substituted or abbreviated string in a talk instruction is searched in a listfile when TAS assembles a script. If the string fails to match, add one or more words to the string in the talk instruction until the string matches.
Although the string matching algorithm has this small drawback, it is user-friendly in that it requires a minimum amount of effort on the part of the script writer to identify phrases in talk instructions. Rather than entire phrases in talk instructions, only a minimal substring that uniquely identifies the phrase in talk instructions is required.