TAILIEUCHUNG - Báo cáo khoa học: "Sequential Labeling with Latent Variables: An Exact Inference Algorithm and Its Efficient Approximation"

Latent conditional models have become popular recently in both natural language processing and vision processing communities. However, establishing an effective and efficient inference method on latent conditional models remains a question. In this paper, we describe the latent-dynamic inference (LDI), which is able to produce the optimal label sequence on latent conditional models by using efficient search strategy and dynamic programming. | Sequential Labeling with Latent Variables An Exact Inference Algorithm and Its Efficient Approximation Xu Sun1 Jun ichi Tsujii Department of Computer Science University of Tokyo Japan School of Computer Science University of Manchester UK National Centre for Text Mining Manchester UK sunxu tsujii @ Abstract Latent conditional models have become popular recently in both natural language processing and vision processing communities. However establishing an effective and efficient inference method on latent conditional models remains a question. In this paper we describe the latent-dynamic inference LDI which is able to produce the optimal label sequence on latent conditional models by using efficient search strategy and dynamic programming. Furthermore we describe a straightforward solution on approximating the LDI and show that the approximated LDI performs as well as the exact LDI while the speed is much faster. Our experiments demonstrate that the proposed inference algorithm outperforms existing inference methods on a variety of natural language processing tasks. 1 Introduction When data have distinct sub-structures models exploiting latent variables are advantageous in learning Matsuzaki et al. 2005 Petrov and Klein 2007 Blunsom et al. 2008 . Actually discriminative probabilistic latent variable models DPLVMs have recently become popular choices for performing a variety of tasks with sub-structures . vision recognition Morency et al. 2007 syntactic parsing Petrov and Klein 2008 and syntactic chunking Sun et al. 2008 . Morency et al. 2007 demonstrated that DPLVM models could efficiently learn sub-structures of natural problems and outperform several widely-used conventional models . support vector machines SVMs conditional random fields CRFs and hidden Markov models HMMs . Petrov and Klein 2008 reported on a syntactic parsing task that DPLVM models can learn more compact and accurate grammars than the conventional techniques without latent

TỪ KHÓA LIÊN QUAN
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.