Applying Probability Measures to Abstract Languages

DOI10.1109/T-C.1973.223746zbMath0252.68033OpenAlexW2111041233WikidataQ56638387 ScholiaQ56638387MaRDI QIDQ5666171

R. A. Thompson, Taylor Booth

Publication date: 1973

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/t-c.1973.223746

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (19)

A new one pass algorithm for estimating stochastic context-free grammars ⋮ The Generative Power of Probabilistic and Weighted Context-Free Grammars ⋮ Probabilistic hyperedge replacement grammars ⋮ A note on the expressive power of probabilistic context free grammars ⋮ EXPLOITING SYNTACTIC, SEMANTIC, AND LEXICAL REGULARITIES IN LANGUAGE MODELING VIA DIRECTED MARKOV RANDOM FIELDS ⋮ Computation of moments for probabilistic finite-state automata ⋮ Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy ⋮ Consistency of stochastic context-free grammars ⋮ Intricacies of Collins' Parsing Model ⋮ Weighted and Probabilistic Context-Free Grammars Are Equally Expressive ⋮ Multityped abstract categorial grammars and their composition ⋮ Sequential classification of strings generated by SCFG's ⋮ Computation of distances for regular and context-free probabilistic languages ⋮ B-fuzzy grammars ⋮ A probabilistic model of computing with words ⋮ Properties of stochastic syntax-directed translation schemata ⋮ CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS ⋮ CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS ⋮ Maximum likelihood analysis of algorithms and data structures

This page was built for publication: Applying Probability Measures to Abstract Languages