跳至内容
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.
版本/格式:   圖書 : 英語
資料庫: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系統控制編碼: 33830907
注意: "August 1995."
描述: 17 p. : ill. ; 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的評論

標籤

成爲第一個

類似資料

確認申請

你可能已經申請過這份資料。若還是想申請,請選確認。

連結資料


<http://www.worldcat.org/oclc/33830907>
library:oclcnum"33830907"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/33830907>
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)"
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.""
schema:exampleOfWork<http://worldcat.org/entity/work/id/39263753>
schema:inLanguage"en"
schema:name"A robust parsing algorithm for link grammars"
schema:numberOfPages"17"
schema:publisher
schema:url

Content-negotiable representations

關閉視窗

請登入WorldCat 

没有帳號嗎?你可很容易的 建立免費的帳號.