OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Probabilistic context-free grammar

 Home Mathematics Fields of mathematics Applied mathematics Applied statistics Statistical natural language processing
 0 By others on same topic  0 Discussions  1970-01-01  See my version
A **Probabilistic Context-Free Grammar (PCFG)** is an extension of a context-free grammar (CFG) that associates probabilities with its production rules. In a standard CFG, each production rule defines how a non-terminal symbol can be replaced with a sequence of non-terminal and terminal symbols. In a PCFG, each production has an associated probability that reflects the likelihood of that production being applied in the parsing process.

 Ancestors (6)

  1. Statistical natural language processing
  2. Applied statistics
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook