Applying Probability Measures to Abstract Languages

DOI10.1109/T-C.1973.223746MaRDI QIDQ5666171zbMATH OpenOpenAlexWikidataFDO

Authors Taylor Booth, R. A. Thompson

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)

Cited in

(20)

• Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy
• Consistency of stochastic context-free grammars
• A probabilistic model of computing with words
• Properties of stochastic syntax-directed translation schemata
• A note on the expressive power of probabilistic context free grammars
• Sequential classification of strings generated by SCFG's
• Computation of distances for regular and context-free probabilistic languages
• Multityped abstract categorial grammars and their composition
• A new one pass algorithm for estimating stochastic context-free grammars
• The generative power of probabilistic and weighted context-free grammars
• CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS
• Maximum likelihood analysis of algorithms and data structures
• Probabilistic hyperedge replacement grammars
• Computation of moments for probabilistic finite-state automata
• Weighted and probabilistic context-free grammars are equally expressive
• B-fuzzy grammars
• Cross-moments computation for stochastic context-free grammars
• Intricacies of Collins' parsing model
• Exploiting syntactic, semantic, and lexical regularities in language modeling via directed Markov random fields
• Generative Datalog with continuous distributions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5666171)