Integration of diverse recognition methodologies through reevaluation of N-best sentence hypotheses
HLT '91 Proceedings of the workshop on Speech and Natural Language
An efficient algorithm for finding the M most probable configurationsin probabilistic expert systems
Statistics and Computing
A comparison of several approximate algorithms for finding multiple (N-best) sentence hypotheses
ICASSP '91 Proceedings of the Acoustics, Speech, and Signal Processing, 1991. ICASSP-91., 1991 International Conference
Incremental HMM alignment for MT system combination
ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - Volume 2
Code completion of multiple keywords from abbreviated input
Automated Software Engineering
Hi-index | 0.00 |
Extracting rules from RBFs is not a trivial task because of nonlinear functions or high input dimensionality. In such cases, some of the hidden units of the RBF network have a tendency to be "shared" across several output classes or even may not contribute ...