skip to content
Grammatical trigrams : a probabilistic model of link grammar Preview this item
ClosePreview this item
Checking...

Grammatical trigrams : a probabilistic model of link grammar

Author: John D Lafferty; Daniel D Sleator; Davy Temperley
Publisher: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, [1992]
Series: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-92-181.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
Abstract: "In this paper we present a new class of language models. This class derives from link grammar, a context-free formalism for the description of natural language. We describe an algorithm for determining maximum-likelihood estimates of the parameters of these models. The language models which we present differ from previous models based on stochastic context-free grammars in that they are highly lexical. In  Read more...
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: John D Lafferty; Daniel D Sleator; Davy Temperley
OCLC Number: 26847322
Notes: "To appear in Proc. of the 1992 AAAI Fall Symp. on Probabilistic Approaches to Natural Language."
"September 1992."
Description: 10 p. ; 28 cm.
Series Title: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-92-181.
Responsibility: John Lafferty, Daniel Sleator, Davy Temperley.

Abstract:

Abstract: "In this paper we present a new class of language models. This class derives from link grammar, a context-free formalism for the description of natural language. We describe an algorithm for determining maximum-likelihood estimates of the parameters of these models. The language models which we present differ from previous models based on stochastic context-free grammars in that they are highly lexical. In particular, they include the familiar n-gram models as a natural subclass. The motivation for considering this class is to estimate the contribution which grammar can make to reducing the relative entropy of natural language."

Reviews

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

Tags

Be the first.

Similar Items

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/26847322>
library:oclcnum"26847322"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/26847322>
rdf:typeschema:Book
rdfs:seeAlso
schema:about
schema:about
schema:about
<http://id.worldcat.org/fast/1034365>
rdf:typeschema:Intangible
schema:name"Natural language processing (Computer science)"
schema:author
schema:contributor
schema:contributor
schema:datePublished"1992"
schema:description"Abstract: "In this paper we present a new class of language models. This class derives from link grammar, a context-free formalism for the description of natural language. We describe an algorithm for determining maximum-likelihood estimates of the parameters of these models. The language models which we present differ from previous models based on stochastic context-free grammars in that they are highly lexical. In particular, they include the familiar n-gram models as a natural subclass. The motivation for considering this class is to estimate the contribution which grammar can make to reducing the relative entropy of natural language.""
schema:exampleOfWork<http://worldcat.org/entity/work/id/29987363>
schema:inLanguage"en"
schema:name"Grammatical trigrams : a probabilistic model of link grammar"
schema:numberOfPages"10"
schema:publisher
rdf:typeschema:Organization
schema:name"School of Computer Science, Carnegie Mellon University"

Content-negotiable representations

Close Window

Please sign in to WorldCat 

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