Metraipolis › archive › dc_05882a42d8fc
Probabilistic context-free grammar — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Probabilistic_context-free_grammar
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T23:40:27.819Z
- SHA-256 of the archived text
cc8bff50eaff09d89c23f74022e51571941f654825a00333b251044b97ff3027- Stable URL of this page
https://metraipolis.com/documento/dc_05882a42d8fc
How to cite
Probabilistic context-free grammar — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Probabilistic_context-free_grammar (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_05882a42d8fc (Metraipolis archive dc_05882a42d8fc, sha256 cc8bff50eaff09d89c23f74022e51571941f654825a00333b251044b97ff3027)
BibTeX
@misc{dc05882a42d8fc,
title = {Probabilistic context-free grammar — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Probabilistic_context-free_grammar},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_05882a42d8fc; sha256 cc8bff50eaff09d89c23f74022e51571941f654825a00333b251044b97ff3027},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Probabilistic_context-free_grammar. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In theoretical linguistics and computational linguistics, probabilistic context free grammars (PCFGs) extend context-free grammars, similar to how hidden Markov models extend regular grammars. Each production is assigned a probability. The probability of a derivation (parse) is the product of the probabilities of the productions used in that derivation. These probabilities can be viewed as parameters of the model, and for large problems it is convenient to learn these parameters via machine learning. A probabilistic grammar's validity is constrained by context of its training dataset. PCFGs originated from grammar theory and have applications ranging from natural language processing to the study of RNA structure and the design of programming languages. Designing efficient PCFGs has to weigh factors of scalability and generality. Issues such as grammar ambiguity must be resolved. The grammar design affects results accuracy. Grammar parsing algorithms have various time and memory requirements. Tema degli esploratori: scienze della vita e salute (deposito sistematico; categoria «Bioinformatics»). Fonte: Wikipedia in inglese, voce «Probabilistic context-free grammar» — https://en.wikipedia.org/wiki/Probabilistic_context-free_grammar Wikidata Q2377216 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q2377216 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Probabilistic_context-free_grammar?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1374572893, consultata il 2026-10-07T23:21:39.548Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: dc20373843297f794b1e7d3bea3eb7477c4c94c5c164983f8b40819114724000