Pages that link to "Item:Q5666171"

The following pages link to Applying Probability Measures to Abstract Languages (Q5666171):

Displaying 18 items.

• A new one pass algorithm for estimating stochastic context-free grammars (Q294698) (← links)
• Consistency of stochastic context-free grammars (Q611793) (← links)
• A note on the expressive power of probabilistic context free grammars (Q851193) (← links)
• Computation of distances for regular and context-free probabilistic languages (Q932320) (← links)
• Maximum likelihood analysis of algorithms and data structures (Q1041238) (← links)
• Probabilistic hyperedge replacement grammars (Q1351216) (← links)
• A probabilistic model of computing with words (Q1776375) (← links)
• Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy (Q2177476) (← links)
• Computation of moments for probabilistic finite-state automata (Q2660903) (← links)
• The Generative Power of Probabilistic and Weighted Context-Free Grammars (Q3172827) (← links)
• Intricacies of Collins' Parsing Model (Q3225422) (← links)
• Weighted and Probabilistic Context-Free Grammars Are Equally Expressive (Q3225468) (← links)
• EXPLOITING SYNTACTIC, SEMANTIC, AND LEXICAL REGULARITIES IN LANGUAGE MODELING VIA DIRECTED MARKOV RANDOM FIELDS (Q3462266) (← links)
• Properties of stochastic syntax-directed translation schemata (Q3873569) (← links)
• Sequential classification of strings generated by SCFG's (Q4055155) (← links)
• B-fuzzy grammars (Q4105810) (← links)
• CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS (Q5896876) (← links)
• CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS (Q5896879) (← links)