| P98-1101 | algorithm is one of the simplest | CFG recognition | al - gorithms . Given a CFG G |
| J92-4001 | types of grammar require that a | CFG recognition | rule such Robert F. Simmons and |
| W07-1805 | thresholds equal and reverting to the | CFG recognition | if the backoff confidence score |
| P85-1010 | brevity of expression is not free . | CFG recognition | can be solved in cubic time or |
| J09-3001 | asymptotically exponential on D , whereas | CFG recognition | is cubic regardless of depth |
| W08-0108 | Exploit the fast and accurate | CFG recognition | of in-grammar ( ING ) utterances |
| E93-1045 | discussion of the methods for | cfg recognition | and the representation of parses |
| J09-3001 | length of an utterance , whereas | CFG recognition | is cubic .5 Similar limits have |
| J85-4001 | does not come free ; while the | CFG recognition | problem can be solved in time |
| E93-1045 | -LSB- 1992 \ -RSB- applied this to | cfg recognition | as follows . Given an input , |
