Formal Grammars and Markov Models,

Abstract

The theory of formal grammars is widely used in computer science and linguistics. Hidden Markov models are well established in automatic speech recognition. This expository memorandum sets out the links between the two areas, via stochastic grammars, and points to stochastic context-free grammars as an interesting area for practical application.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1987
Accession Number
ADA188889

Entities

People

  • J. S. Bridle
  • L. Dodd

Organizations

  • Royal Signals and Radar Establishment

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Automata
  • Automated Speech Recognition
  • Computer Science
  • Context Free Grammars
  • Grammars
  • Hidden Markov Models
  • Language
  • Linguistics
  • Markov Chains
  • Markov Models
  • Natural Languages
  • Pattern Recognition
  • Probability
  • Probability Distributions
  • Random Variables
  • Stochastic Processes

Readers

  • Artificial Intelligence
  • Mathematical Modeling and Probability Theory.

Technology Areas

  • AI & ML
  • AI & ML - Machine Learning Algorithms
  • AI & ML - Machine Translation