ข้ามไปที่เนือ้หา
A robust parsing algorithm for link grammars แสดงตัวอย่างรายการนี้
ปิดแสดงตัวอย่างรายการนี้
Checking...

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 กับความคิดเห็น - เป็นคนแรก

หัวเรื่อง
เพิ่มเติมเช่นนี้

 

ค้นหาสำเนาในห้องสมุด

กำลังดึงข้อมูล… ค้นหาห้องสมุดที่มีรายการนี้

รายละเอียด

ประเภทของเอกสาร: หนังสือ
ผู้เขียนทั้งหมด : ผู้เขียนร่วม Dennis Grinberg; John D Lafferty; Daniel D Sleator
OCLC Number: 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…
Retrieving DOGObooks reviews...

แท็ก

เป็นคนแรก.

รายการคล้ายกัน

หัวเรื่องที่เกี่ยวข้อง:(1)

ยืนยันคำขอนี้

คุณอาจะร้องขอรายการนี้แล้. โปรดเลือก ตกลง ถ้าคุณต้องการดำเนินการคำขอนี้ต่อไป.

Linked Data


<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 

ยังไม่มีบัญชีผู้ใช้? คุณสามารถสร้างได้อย่างง่ายดาย สร้างบัญชีผู้ใช้ฟรี.