PROBABILITIES IN CONTEXT-FREE PROGRAMMED GRAMMARS,

Abstract

Context-free programmed grammars with probabilities attached to the 'go-to' fields are studied as realistic models for syntactical information sources. The model is formally defined and examples of its output are given. Simplifications that follow from the imposition of leftmost derivations are displayed. Source models for languages that are known to be context-free are studied, and for these a first-order Markov approximating source is obtained; standard methods are then used to calculate its entropy. (Author)

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1970
Accession Number
AD0707855

Entities

People

  • Celso De Renna E Souza

Organizations

  • University of HawaiĘ»i System

Tags

DTIC Thesaurus Topics

  • Grammars
  • Language
  • Linguistics
  • Probability
  • Standards

Readers

  • Computational Linguistics
  • Computational Modeling and Simulation