Separation of simultaneous word sequences using Markov model techniques
Kingston, James L.
Therrien, Charles W.
MetadataShow full item record
This thesis develops a method of separating multiple simultaneous conversations through the use of Markov Models. Text samples which represent the conversations to be used as training data are described by a grammar based upon word and word-pair occurences within the text. This grammar is then used to establish a Markov Model for the text. These models are then combined to form a Marjov Model which describes the simultaneous occurrence of multiple conversations. Artificially generated word sequences which have the same grammar as the training conversations are supplied as input to the conversation filter, whose purpose is to "listen to" one of the input sequences. The conversation filter takes on either an optimal form in which the grammars of all input sequences to the filter are known, or a sub-optimal form which uses only the grammar of the desired output.
Approved for public release; distribution is unlimited
Showing items related by title, author, creator and subject.
MacLennan, Bruce J. (Monterey, California. Naval Postgraduate School, 1981-11); NPS-52-81-015A method for measuring the complexity of control structures is presented. It is based on the size of a grammar describing the possible execution sequences of the control structure. This method is applied to a number of ...
Techniques and benefits of shaping the pulses of binary sequences with application to spread spectrum radio communications. Mavranganis, Panayiotis G. (Monterey, California. Naval Postgraduate School, 1979-03);This research is concerned with binary sequences. Such two-level voltage waveforms are used in some types of spread spectrum systems. Of interest in this work is the effect of shaping the normally rectangular pulses of ...
McGruther, Gordon T. (Monterey, California. Naval Postgraduate School, 1972-06);An automatic, language-independent syntax error detection, recovery, and correction system for LR(k) grammars is proposed. The requirement is made that the reverse of the grammar involved is also LR(k). The implications ...