Stochastic grammar

From Wikipedia, the free encyclopedia

Linguistics
Part of a series on
Outline History Index
General linguistics Diachronic Lexicography Morphology Phonology Pragmatics Semantics Syntax Syntax–semantics interface Typology
Applied linguistics Acquisition Anthropological Applied Computational Conversation analysis Corpus linguistics Discourse analysis Determinism Distance Documentation Ethnography of communication Ethnomethodology Forensic History of linguistics Interlinguistics Neurolinguistics Philology Philosophy of language Phonetics Psycholinguistics Sociolinguistics Text Translating and interpreting Writing systems
Theoretical frameworks Formalist Constituency Dependency Distributionalism Generative Glossematics Functional Cognitive Construction grammar Functional discourse grammar Grammaticalization Interactional linguistics Prague circle Systemic functional Usage-based Structuralism
Topics Autonomy of syntax Compositionality Conservative and innovative language Descriptivism Etymology Iconicity Internationalism Internet linguistics LGBTQ linguistics Origin of language Orismology Orthography Philosophy of linguistics Prescriptivism Second-language acquisition Theory of language Terminology
Portal
v t e

A stochastic grammar (statistical grammar) is a grammar framework with a probabilistic notion of grammaticality:

Stochastic context-free grammar
Statistical parsing
Data-oriented parsing
Hidden Markov model (or stochastic regular grammar^[1])
Estimation theory

The grammar is realized as a language model. Allowed sentences are stored in a database together with the frequency how common a sentence is.^[2] Statistical natural language processing uses stochastic, probabilistic and statistical methods, especially to resolve difficulties that 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. "A probabilistic model consists of a non-probabilistic model plus some numerical quantities; it is not true that probabilistic models are inherently simpler or less structural than non-probabilistic models."^[3]

Examples

A probabilistic method for rhyme detection is implemented by Hirjee & Brown^[4] in their study in 2013 to find internal and imperfect rhyme pairs in rap lyrics. The concept is adapted from a sequence alignment technique using BLOSUM (BLOcks SUbstitution Matrix). They were able to detect rhymes undetectable by non-probabilistic models.

References

^ Carrasco, Rafael C.; Oncina, Jose (1994). Carrasco, Rafael C.; Oncina, Jose (eds.). "Learning stochastic regular grammars by means of a state merging method". Grammatical Inference and Applications. Berlin, Heidelberg: Springer: 139–152. doi:10.1007/3-540-58473-0_144. ISBN 978-3-540-48985-6.
^ Steve Young; Gerrit Bloothooft (14 March 2013). Corpus-Based Methods in Language and Speech Processing. Springer Science & Business Media. pp. 140–. ISBN 978-94-017-1183-8.
^ John Goldsmith. 2002. "Probabilistic Models of Grammar: Phonology as Information Minimization." Phonological Studies #5: 21–46.
^ Hirjee, Hussein; Brown, Daniel (2013). "Using Automated Rhyme Detection to Characterize Rhyming Style in Rap Music" (PDF). Empirical Musicology Review.

Examples

See also

References

Further reading