aller au contenu
A robust parsing algorithm for link grammars Aperçu de cet ouvrage
FermerAperçu de cet ouvrage
Vérifiant…

A robust parsing algorithm for link grammars

Auteur : Dennis Grinberg; John D Lafferty; Daniel D Sleator
Éditeur : Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, [1995]
Collection : Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-95-125.
Édition/format :   Print book : AnglaisVoir toutes les éditions et tous les formats
Base de données :WorldCat
Résumé :
Abstract: "In this paper we present a robust parsing algorithm based on the link grammar formalism for parsing natural languages. Our algorithm is a natural extension of the original dynamic programming recognition algorithm which recursively counts the number of linkages between two words in the input sentence. The modified algorithm uses the notion of a null link in order to allow a connection between any pair of  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 : Dennis Grinberg; John D Lafferty; Daniel D Sleator
Numéro OCLC : 33830907
Notes : "August 1995."
Description : 17 pages : illustrations ; 28 cm.
Titre de collection : Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-95-125.
Responsabilité : Dennis Grinberg, John Lafferty, and Daniel Sleator.

Résumé :

Abstract: "In this paper we present a robust parsing algorithm based on the link grammar formalism for parsing natural languages. Our algorithm is a natural extension of the original dynamic programming recognition algorithm which recursively counts the number of linkages between two words in the input sentence. The modified algorithm uses the notion of a null link in order to allow a connection between any pair of adjacent words, regardless of their dictionary definitions. The algorithm proceeds by making three dynamic programming passes. In the first pass, the input is parsed using the original algorithm which enforces the constraints on links to ensure grammaticality. In the second pass, the total cost of each substring of words is computed, where cost is determined by the number of null links necessary to parse the substring. The final pass counts the total number of parses with minimal cost. All of the original pruning techniques have natural counterparts in the robust algorithm. When used together with memoization [sic], these techniques enable the algorithm to run efficiently with cubic worst-case complexity. We have implemented these ideas and tested them by parsing the Switchboard corpus of conversational English. This corpus is comprised of approximately three million words of text, corresponding to more than 150 hours of transcribed speech collected from telephone conversations restricted to 70 different topics. Although only a small fraction of the sentences in this corpus are 'grammatical' by standard criteria, the robust link grammar parser is able to extract relevant structure for a large portion of the sentences. We present the results of our experiments using this system, including the analyses of selected and random sentences from the corpus. We placed a version of the robust parser on the Word [sic] Wide Web for experimentation. It can be reached at URL http://www.cs.cmu.edu/afs/cs.cmu.edu/project/link/www/robust.html. In this version there are some limitations such as the maximum length of a sentence in words and the maximum amount of memory the parser can use."

Critiques

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

Tags

Soyez le premier.

Ouvrages semblables

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


Primary Entity

<http://www.worldcat.org/oclc/33830907> # A robust parsing algorithm for link grammars
    a schema:Book, schema:CreativeWork ;
    library:oclcnum "33830907" ;
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/pau> ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/2244426648#Place/pittsburgh_pa> ; # Pittsburgh, Pa.
    schema:about <http://dewey.info/class/510.7808/> ;
    schema:about <http://id.worldcat.org/fast/1034365> ; # Natural language processing (Computer science)
    schema:bookFormat bgn:PrintBook ;
    schema:contributor <http://viaf.org/viaf/69171210> ; # John D. Lafferty
    schema:contributor <http://viaf.org/viaf/54241399> ; # Daniel Dominic Sleator
    schema:creator <http://experiment.worldcat.org/entity/work/data/2244426648#Person/grinberg_dennis> ; # Dennis Grinberg
    schema:datePublished "1995" ;
    schema:description "Abstract: "In this paper we present a robust parsing algorithm based on the link grammar formalism for parsing natural languages. Our algorithm is a natural extension of the original dynamic programming recognition algorithm which recursively counts the number of linkages between two words in the input sentence. The modified algorithm uses the notion of a null link in order to allow a connection between any pair of adjacent words, regardless of their dictionary definitions. The algorithm proceeds by making three dynamic programming passes. In the first pass, the input is parsed using the original algorithm which enforces the constraints on links to ensure grammaticality. In the second pass, the total cost of each substring of words is computed, where cost is determined by the number of null links necessary to parse the substring. The final pass counts the total number of parses with minimal cost. All of the original pruning techniques have natural counterparts in the robust algorithm. When used together with memoization [sic], these techniques enable the algorithm to run efficiently with cubic worst-case complexity. We have implemented these ideas and tested them by parsing the Switchboard corpus of conversational English. This corpus is comprised of approximately three million words of text, corresponding to more than 150 hours of transcribed speech collected from telephone conversations restricted to 70 different topics. Although only a small fraction of the sentences in this corpus are 'grammatical' by standard criteria, the robust link grammar parser is able to extract relevant structure for a large portion of the sentences. We present the results of our experiments using this system, including the analyses of selected and random sentences from the corpus. We placed a version of the robust parser on the Word [sic] Wide Web for experimentation. It can be reached at URL http://www.cs.cmu.edu/afs/cs.cmu.edu/project/link/www/robust.html. In this version there are some limitations such as the maximum length of a sentence in words and the maximum amount of memory the parser can use.""@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/2244426648> ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/2244426648#Series/research_paper_carnegie_mellon_university_school_of_computer_science> ; # Research paper (Carnegie Mellon University. School of Computer Science) ;
    schema:name "A robust parsing algorithm for link grammars"@en ;
    schema:productID "33830907" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/33830907#PublicationEvent/pittsburgh_pa_school_of_computer_science_carnegie_mellon_university_1995> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/2244426648#Agent/school_of_computer_science_carnegie_mellon_university> ; # School of Computer Science, Carnegie Mellon University
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/33830907> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/2244426648#Agent/school_of_computer_science_carnegie_mellon_university> # School of Computer Science, Carnegie Mellon University
    a bgn:Agent ;
    schema:name "School of Computer Science, Carnegie Mellon University" ;
    .

<http://experiment.worldcat.org/entity/work/data/2244426648#Person/grinberg_dennis> # Dennis Grinberg
    a schema:Person ;
    schema:familyName "Grinberg" ;
    schema:givenName "Dennis" ;
    schema:name "Dennis Grinberg" ;
    .

<http://experiment.worldcat.org/entity/work/data/2244426648#Place/pittsburgh_pa> # Pittsburgh, Pa.
    a schema:Place ;
    schema:name "Pittsburgh, Pa." ;
    .

<http://experiment.worldcat.org/entity/work/data/2244426648#Series/research_paper_carnegie_mellon_university_school_of_computer_science> # Research paper (Carnegie Mellon University. School of Computer Science) ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/33830907> ; # A robust parsing algorithm for link grammars
    schema:name "Research paper (Carnegie Mellon University. School of Computer Science) ;" ;
    schema:name "[Research paper] / Carnegie Mellon University. School of Computer Science ;" ;
    .

<http://id.worldcat.org/fast/1034365> # Natural language processing (Computer science)
    a schema:Intangible ;
    schema:name "Natural language processing (Computer science)"@en ;
    .

<http://viaf.org/viaf/54241399> # Daniel Dominic Sleator
    a schema:Person ;
    schema:birthDate "1953" ;
    schema:familyName "Sleator" ;
    schema:givenName "Daniel Dominic" ;
    schema:givenName "Daniel D." ;
    schema:name "Daniel Dominic Sleator" ;
    .

<http://viaf.org/viaf/69171210> # John D. Lafferty
    a schema:Person ;
    schema:familyName "Lafferty" ;
    schema:givenName "John D." ;
    schema:name "John D. Lafferty" ;
    .


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.