An efficient context-free parsing algorithm
Communications of the ACM
Hi-index | 0.02 |
This paper describes a method for converting a task-dependent grammar into a word predictor of a speech understanding system. Since the word prediction is a top-down operation, left recursive rules induces an infinite looping. We have solved this problem by applying an algorithm for bottom-up parsing.