A stochastic grammar (statistical grammar) is a
grammar frameworkwith a probabilisticnotion of grammaticality:
Stochastic context-free grammar
Hidden Markov model
natural language processinguses stochastic, probabilisticand statisticalmethods, especially to resolve difficulties which arise because longer sentences are highly ambiguous when processed with realistic grammars, yielding thousands or millions of possible analyses. Methods for disambiguation often involve the use of corpora and Markov models. Thetechnology for statistical NLP comes mainly from machine learningand data mining, both of which are fields of artificial intelligencethat involve learning from data.
*Christopher D. Manning, Hinrich Schutze "Foundations of Statistical Natural Language Processing", MIT Press (1999), ISBN 978-0262133609.
*Stefan Wermter, Ellen Riloff, Gabriele Scheler (eds.) "Connectionist, Statistical and Symbolic Approaches to Learning for Natural Language Processing", Springer (1996), ISBN 978-3540609254.
Colorless green ideas sleep furiously
Wikimedia Foundation. 2010.
Look at other dictionaries:
Stochastic context-free grammar — A stochastic context free grammar (SCFG; also probabilistic context free grammar, PCFG) is a context free grammar in which each production is augmented with a probability. The probability of a derivation (parse) is then the product of the… … Wikipedia
Grammar framework — In theoretical linguistics, the following fundamental approaches towards constructing grammar frameworks for natural languages are distinguished:*Generative grammar: algorithmic (phrase structure grammars) **Transformational grammar (1960s)… … Wikipedia
Stochastic — (from the Greek Στόχος for aim or guess ) means random.A stochastic process is one whose behavior is non deterministic in that a state s next state is determined both by the process s predictable actions and by a random element. Stochastic crafts … Wikipedia
Generative grammar — In theoretical linguistics, generative grammar refers to a particular approach to the study of syntax. A generative grammar of a language attempts to give a set of rules that will correctly predict which combinations of words will form… … Wikipedia
Context-free grammar — In formal language theory, a context free grammar (CFG) is a formal grammar in which every production rule is of the form V → w where V is a single nonterminal symbol, and w is a string of terminals and/or nonterminals (w can be empty). The… … Wikipedia
Weighted context-free grammar — A weighted context free grammar (WCFG) is a context free grammar where each production has a numeric weight associated with it. The weight of a parse tree in a WCFG is the weight of the rule used to produce the top node, plus the weights of its… … Wikipedia
Graftal — A graftal or L system is a formal grammar used in computer graphics to recursively define branching tree and plant shapes in a compact format. The shape is defined by a string of symbols constructed by a graftal grammar. A graftal grammar… … Wikipedia
Syntax — Syntactic redirects here. For another meaning of the adjective, see Syntaxis. For other uses, see Syntax (disambiguation). Linguistics … Wikipedia
List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… … Wikipedia
Algorithmic composition — is the technique of using algorithms to create music.Algorithms (or, at the very least, formal sets of rules) have been used to compose music for centuries; the procedures used to plot voice leading in Western counterpoint, for example, can often … Wikipedia