Đang chuẩn bị liên kết để tải về tài liệu:
Báo cáo khoa học: "INTERLEAVING SYNTAX AND SEMANTICS AN EFFICIENT BOTTOM-UP PARSER*"

Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ

We describe an efficient bottom-up parser that interleaves syntactic and semantic structure building. Two techniques are presented for reducing search by reducing local ambiguity: Limited leftcontext constraints are used to reduce local syntactic ambiguity, and deferred sortal-constraint application is used to reduce local semantic ambiguity. We experimentally evaluate these techniques, and show dramatic reductions in both number of chart edges and total parsing time. | INTERLEAVING SYNTAX AND SEMANTICS IN AN EFFICIENT BOTTOM-UP PARSER John Dowding Robert Moore Frangois Andry Ị and Douglas Moran SRI International 333 Ravenswood Avenue Menlo Park CA 94025 dowding bmoore andry mor an @ ai. sri. com Abstract We describe an efficient bottom-up parser that interleaves syntactic and semantic structure building. Two techniques are presented for reducing search by reducing local ambiguity Limited leftcontext constraints are used to reduce local syntactic ambiguity and deferred sortal-constraint application is used to reduce local semantic ambiguity. We experimentally evaluate these techniques and show dramatic reductions in both number of chart edges and total parsing time. The robust processing capabilities of the parser are demonstrated in its use in improving the accuracy of a speech recognizer. INTRODUCTION The parsing problem is typically framed as a recognition problem Given a grammar and a word string determine if the word string is a member of the language described by the grammar. For some applications notably robust natural-language processing and spoken-language understanding this is insufficient since many utterances will not be accepted by the grammar because of nonstandard language inadequate grammatical coverage or errors made in speech recognition. In these cases it is still desirable to determine what well-formed phrases occurred in the word string even when the entire string is not recognized. The goal of the parser described here is to construct a chart as efficiently as possible that contains all the syntactically well-formed semantically meaningful phrases This research was supported by the Advanced Research Projects Agency under Contract ONR N00014-90-C-0085 with the Office of Naval Research. The views and conclusions contained in this document are those of the authors and should not be interpreted as necessarily representing the official policies either expressed or implied of the Advanced Research Projects Agency .

TAILIEUCHUNG - Chia sẻ tài liệu không giới hạn
Địa chỉ : 444 Hoang Hoa Tham, Hanoi, Viet Nam
Website : tailieuchung.com
Email : tailieuchung20@gmail.com
Tailieuchung.com là thư viện tài liệu trực tuyến, nơi chia sẽ trao đổi hàng triệu tài liệu như luận văn đồ án, sách, giáo trình, đề thi.
Chúng tôi không chịu trách nhiệm liên quan đến các vấn đề bản quyền nội dung tài liệu được thành viên tự nguyện đăng tải lên, nếu phát hiện thấy tài liệu xấu hoặc tài liệu có bản quyền xin hãy email cho chúng tôi.
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.