This paper proposes a new continuous speech recognition method by phoneme-based word spotting and time-synchronous context-free parsing.
reference patterns and task language. The system first spots word candidates in an input sentence, and then generates a word lattice. The word.
This paper proposes a new continuous-speech recognition method by phoneme-based word spotting and time-synchronous context-free parsing.
This paper proposes a new continuous-speech recognition method by phoneme-based word spotting and time-synchronous context-free parsing.
Nakagawa: "Spoken Sentence Recognition by Time-. Synchronous Parsing Algorithm of Context-Free. Grammar", Proc. ICASSP, pp.829-832 (1987). [9] S. Nakagawa and ...
A dynamic programming algorithm for recognizing and parsing spoken word strings of a context-free grammar that performs all functions simultaneously, ...
"Spoken sentence recognition by time-synchronous parsing algorithm of context-free grammar." In Proceedings, IEEE Conference on Acoustics, Speech and Signal ...
1987 Spoken Sentence Recognition by. Time-Synchronous Parsing Algorithm of Context-. Free Grammar'. Proc. ICASSP 87, Dallas (Texas),. Vol. 2 : 829-832. [23] ...
This paper describes an adaptation of Earley's algorithm for the recognition of spoken sentences. Earley's algorithm is one of the most efficient parsing ...
Synchronous context-free grammars (SCFGs) generalize context-free grammars (CFGs) to generate two strings simultaneously. The formalism dates from the early ...
Missing: Spoken | Show results with:Spoken