přejít na obsah
Grammatical trigrams : a probabilistic model of link grammar Náhled dokumentu
ZavřítNáhled dokumentu
Probíhá kontrola...

Grammatical trigrams : a probabilistic model of link grammar

Autor John D Lafferty; Daniel D Sleator; Davy Temperley
Vydavatel: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, [1992]
Edice: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-92-181.
Vydání/formát:   Kniha : EnglishZobrazit všechny vydání a formáty
Databáze:WorldCat
Shrnutí:
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  Přečíst více...
Hodnocení:

(ještě nehodnoceno) 0 zobrazit recenze - Buďte první.

Předmětová hesla:
Více podobných

 

Vyhledat exemplář v knihovně

&AllPage.SpinnerRetrieving; Vyhledávání knihoven, které vlastní tento dokument...

Detaily

Typ dokumentu: Book
Všichni autoři/tvůrci: John D Lafferty; Daniel D Sleator; Davy Temperley
OCLC číslo: 26847322
Poznámky: "To appear in Proc. of the 1992 AAAI Fall Symp. on Probabilistic Approaches to Natural Language."
"September 1992."
Popis: 10 p. ; 28 cm.
Název edice: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-92-181.
Odpovědnost: John Lafferty, Daniel Sleator, Davy Temperley.

Anotace:

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."

Recenze

Recenze vložené uživatelem
Nahrávání recenzí GoodReads...
Přebírání recenzí DOGO books...

Štítky

Buďte první.

Podobné dokumenty

Související předmětová hesla:(1)

Potvrdit tento požadavek

Tento dokument jste si již vyžádali. Prosím vyberte Ok pokud chcete přesto v žádance pokračovat.

Propojená data


<http://www.worldcat.org/oclc/26847322>
library:oclcnum"26847322"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/26847322>
rdf:typeschema:Book
schema:about
schema:about
schema:about
<http://id.worldcat.org/fast/1034365>
rdf:typeschema:Intangible
schema:name"Natural language processing (Computer science)"
schema:contributor
schema:contributor
schema:creator
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
schema:url

Content-negotiable representations

Zavřít okno

Prosím přihlaste se do WorldCat 

Nemáte účet? Můžete si jednoduše vytvořit bezplatný účet.