omitir hasta el contenido
Parsing English with a link grammar Ver este material de antemano
CerrarVer este material de antemano
Chequeando…

Parsing English with a link grammar

Autor: Daniel D Sleator; Davy Temperley
Editorial: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, ©1991.
Serie: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-91-196.
Edición/Formato:   Libro : Inglés (eng)Ver todas las ediciones y todos los formatos
Base de datos:WorldCat
Resumen:
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  Leer más
Calificación:

(todavía no calificado) 0 con reseñas - Ser el primero.

Temas
Más materiales como éste

 

Encontrar un ejemplar en la biblioteca

&AllPage.SpinnerRetrieving; Encontrando bibliotecas que tienen este material…

Detalles

Tipo de documento: Libro/Texto
Todos autores / colaboradores: Daniel D Sleator; Davy Temperley
Número OCLC: 25502860
Notas: "October 1991."
Descripción: 91 pages : illustrations ; 28 cm.
Título de la serie: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-91-196.
Responsabilidad: Daniel D.K. Sleator, Davy Temperley.

Resumen:

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

Reseñas

Reseñas contribuidas por usuarios
Recuperando reseñas de GoodReads…
Recuperando reseñas de DOGObooks…

Etiquetas

Ser el primero.
Confirmar este pedido

Ya ha pedido este material. Escoja OK si desea procesar el pedido de todos modos.

Datos enlazados


<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

Cerrar ventana

Inicie una sesión con WorldCat 

¿No tienes una cuenta? Puede fácilmente crear una cuenta gratuita.