zum Inhalt wechseln
Parsing English with a link grammar Titelvorschau
SchließenTitelvorschau
Prüfung…

Parsing English with a link grammar

Verfasser/in: Daniel D Sleator; Davy Temperley
Verlag: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, ©1991.
Serien: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-91-196.
Ausgabe/Format   Buch : EnglischAlle Ausgaben und Formate anzeigen
Datenbank:WorldCat
Zusammenfassung:
Abstract: "We develop a formal grammatical system called a link grammar, show how English grammar can be encoded in such a system, and give algorithms for efficiently parsing with a link grammar. Although the expressive power of link grammars is equivalent to that of context free grammars, encoding natural language grammars appears to be much easier with the new system. We have written a program for general link  Weiterlesen…
Bewertung:

(noch nicht bewertet) 0 mit Rezensionen - Verfassen Sie als Erste eine Rezension.

Themen
Ähnliche Titel

 

Exemplar ausleihen

&AllPage.SpinnerRetrieving; Suche nach Bibliotheken, die diesen Titel besitzen ...

Details

Dokumenttyp: Buch
Alle Autoren: Daniel D Sleator; Davy Temperley
OCLC-Nummer: 25502860
Anmerkungen: "October 1991."
Beschreibung: 91 pages : illustrations ; 28 cm.
Serientitel: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-91-196.
Verfasserangabe: Daniel D.K. Sleator, Davy Temperley.

Abstract:

Abstract: "We develop a formal grammatical system called a link grammar, show how English grammar can be encoded in such a system, and give algorithms for efficiently parsing with a link grammar. Although the expressive power of link grammars is equivalent to that of context free grammars, encoding natural language grammars appears to be much easier with the new system. We have written a program for general link parsing and written a link grammar for the English language. The performance of this preliminary system -- both in the breadth of English phenomena that it captures and in the computational resources used -- indicates that the approach may have practical uses as well as linguistic significance. Our program is written in C and may be obtained through the internet."

Rezensionen

Nutzer-Rezensionen
Suche nach GoodReads-Rezensionen
Suche nach DOGObooks-Rezensionen…

Tags

Tragen Sie als Erste Tags ein.
Anfrage bestätigen

Sie haben diesen Titel bereits angefordert. Wenn Sie trotzdem fortfahren möchten, klicken Sie auf OK.

Verlinkung


<http://www.worldcat.org/oclc/25502860>
library:oclcnum"25502860"
library:placeOfPublication
library:placeOfPublication
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)"@en
schema:contributor
schema:copyrightYear"1991"
schema:creator
schema:datePublished"1991"
schema:description"Abstract: "We develop a formal grammatical system called a link grammar, show how English grammar can be encoded in such a system, and give algorithms for efficiently parsing with a link grammar. Although the expressive power of link grammars is equivalent to that of context free grammars, encoding natural language grammars appears to be much easier with the new system. We have written a program for general link parsing and written a link grammar for the English language. The performance of this preliminary system -- both in the breadth of English phenomena that it captures and in the computational resources used -- indicates that the approach may have practical uses as well as linguistic significance. Our program is written in C and may be obtained through the internet.""@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/27633006>
schema:inLanguage"en"
schema:isPartOf
schema:name"Parsing English with a link grammar"@en
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

Fenster schließen

Bitte in WorldCat einloggen 

Sie haben kein Konto? Sie können sehr einfach ein kostenloses Konto anlegen,.