A best-first parser

A parser for a speech understanding system is described. The parser uses a best-first strategy in which alternative paths are assigned priorities and paths are suspended as long as there is a higher priority alternative to explore. Discussions are included on the types of steps in a parse, the assignment of priorities, cooperation among competing parses, and experimental results.