aller au contenu
Parsing English with a link grammar Aperçu de cet ouvrage
FermerAperçu de cet ouvrage
Vérifiant…

Parsing English with a link grammar

Auteur : Daniel D Sleator; Davy Temperley
Éditeur : Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, ©1991.
Collection : Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-91-196.
Édition/format :   Livre : AnglaisVoir toutes les éditions et tous les formats
Base de données :WorldCat
Résumé :
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  Lire la suite...
Évaluation :

(pas encore évalué) 0 avec des critiques - Soyez le premier.

Sujets
Plus comme ceci

 

Trouver un exemplaire dans la bibliothèque

&AllPage.SpinnerRetrieving; Recherche de bibliothèques qui possèdent cet ouvrage...

Détails

Format : Livre
Tous les auteurs / collaborateurs : Daniel D Sleator; Davy Temperley
Numéro OCLC : 25502860
Notes : "October 1991."
Description : 91 pages : illustrations ; 28 cm.
Titre de collection : Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-91-196.
Responsabilité : Daniel D.K. Sleator, Davy Temperley.

Résumé :

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

Critiques

Critiques d’utilisateurs
Récupération des critiques de GoodReads...
Récuperation des critiques DOGObooks…

Tags

Soyez le premier.
Confirmez cette demande

Vous avez peut-être déjà demandé cet ouvrage. Veuillez sélectionner OK si vous voulez poursuivre avec cette demande quand même.

Données liées


<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

Fermer la fenêtre

Veuillez vous identifier dans WorldCat 

Vous n’avez pas de compte? Vous pouvez facilement créer un compte gratuit.