Results 81 to 90 of about 459,681 (224)

Introspective Symmetries [PDF]

open access: yes, 2018
The practical unification of context-free grammar and von Neumann machines has enabled telephony, and current trends suggest that the investigation of write-ahead logging will soon emerge. Here, we confirm the understanding of context-free grammar, which
Coles, M. (Michael)   +3 more
core  

Hidden Abstract Stack Markov Models with Learning Process

open access: yesMathematics
We present hidden abstract stack Markov models (HASMMs) with their learning process. The HASMMs we offer carry the more expressive nature of probabilistic context-free grammars (PCFGs) while allowing faster parameter fitting of hidden Markov models (HMMs)
Mete Özbaltan
doaj   +1 more source

Home - About - Disclaimer - Privacy