コンテンツへ移動
A robust parsing algorithm for link grammars 資料のプレビュー
閉じる資料のプレビュー
確認中…

A robust parsing algorithm for link grammars

著者: Dennis Grinberg; John D Lafferty; Daniel D Sleator
出版: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, [1995]
シリーズ: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-95-125.
エディション/フォーマット:   書籍 : English
データベース:WorldCat
概要:
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  続きを読む
評価:

(まだ評価がありません) 0 件のレビュー - 是非あなたから!

件名:
関連情報:

 

オフラインで入手

&AllPage.SpinnerRetrieving; この資料の所蔵館を検索中…

詳細

ドキュメントの種類: 図書
すべての著者/寄与者: Dennis Grinberg; John D Lafferty; Daniel D Sleator
OCLC No.: 33830907
注記: "August 1995."
物理形態: 17 pages : illustrations ; 28 cm.
シリーズタイトル: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-95-125.
責任者: Dennis Grinberg, John Lafferty, and Daniel Sleator.

概要:

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

レビュー

ユーザーレビュー
GoodReadsのレビューを取得中…
DOGObooksのレビューを取得中…

タグ

まずはあなたから!

類似資料

リクエストの確認

あなたは既にこの資料をリクエストしている可能性があります。このリクエストを続行してよろしければ、OK を選択してください。

リンクデータ


<http://www.worldcat.org/oclc/33830907>
library:oclcnum"33830907"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:about
schema:about
<http://id.worldcat.org/fast/1034365>
rdf:typeschema:Intangible
schema:name"Natural language processing (Computer science)"@en
schema:contributor
schema:contributor
schema:creator
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/39263753>
schema:inLanguage"en"
schema:isPartOf
schema:name"A robust parsing algorithm for link grammars"@en
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

ウインドウを閉じる

WorldCatにログインしてください 

アカウントをお持ちではないですか?簡単に 無料アカウントを作成することができます。.