skip to content
Basic methods of probabilistic context free grammars Preview this item
ClosePreview this item
Checking...

Basic methods of probabilistic context free grammars

Author: Frederick Jelinek; John D Lafferty; R L Mercer
Publisher: Yorktown Heights, N.Y. : IBM T.J. Watson Research Center, [1990]
Series: International Business Machines Corporation.; Research Division.; Research Report
Edition/Format:   Book : English
Database:WorldCat
Summary:
Abstract: "The purpose of this tutorial article is to introduce methods related to probabilistic context free grammars (PCFG's), that is grammars whose production rules have attached to them a probability of being used. PCFG's have at least three advantages: (1) In an ambiguous, but appropriately specified PCFG, correct parses are high probability parses; (2) Parsing can be considerably speeded up by early pruning
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Frederick Jelinek; John D Lafferty; R L Mercer
OCLC Number: 24366955
Notes: "12/13/90"--Cover.
Description: 116 pages : illustrations ; 28 cm.
Series Title: International Business Machines Corporation.; Research Division.; Research Report
Responsibility: by F. Jelinek, J.D. Lafferty, and R.L. Mercer.

Abstract:

Abstract: "The purpose of this tutorial article is to introduce methods related to probabilistic context free grammars (PCFG's), that is grammars whose production rules have attached to them a probability of being used. PCFG's have at least three advantages: (1) In an ambiguous, but appropriately specified PCFG, correct parses are high probability parses; (2) Parsing can be considerably speeded up by early pruning of low probability parses; (3) A rigorous comparison along information theoretic lines is possible of the relative qualities of rival probabilistic grammars.

We introduce four classes of algorithms that handle PCFGs: (1) Computation of the total probability that a PCFG generates a given sentence; (2) Method of finding the most probable parse tree of a given sentence; (3) Estimation of probabilities of rewriting rules of a PCFG on the basis of a text corpus; (4) Computation of the probability that the PCFG produces a sentence having a given initial substring."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/24366955>
library:oclcnum"24366955"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/24366955>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
<http://id.worldcat.org/fast/822769>
rdf:typeschema:Intangible
schema:name"Automatic speech recognition"@en
schema:name"Automatic speech recognition."@en
schema:contributor
schema:contributor
schema:creator
schema:datePublished"1990"
schema:description"We introduce four classes of algorithms that handle PCFGs: (1) Computation of the total probability that a PCFG generates a given sentence; (2) Method of finding the most probable parse tree of a given sentence; (3) Estimation of probabilities of rewriting rules of a PCFG on the basis of a text corpus; (4) Computation of the probability that the PCFG produces a sentence having a given initial substring.""@en
schema:description"Abstract: "The purpose of this tutorial article is to introduce methods related to probabilistic context free grammars (PCFG's), that is grammars whose production rules have attached to them a probability of being used. PCFG's have at least three advantages: (1) In an ambiguous, but appropriately specified PCFG, correct parses are high probability parses; (2) Parsing can be considerably speeded up by early pruning of low probability parses; (3) A rigorous comparison along information theoretic lines is possible of the relative qualities of rival probabilistic grammars."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/26366130>
schema:inLanguage"en"
schema:name"Basic methods of probabilistic context free grammars"@en
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.