A Discriminative Sentence Compression Method as Combinatorial Optimization Problem
نویسندگان
چکیده
منابع مشابه
solution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
Discriminative Sentence Compression with Soft Syntactic Evidence
We present a model for sentence compression that uses a discriminative largemargin learning framework coupled with a novel feature set defined on compressed bigrams as well as deep syntactic representations provided by auxiliary dependency and phrase-structure parsers. The parsers are trained out-of-domain and contain a significant amount of noise. We argue that the discriminative nature of the...
متن کاملSentence Compression as Tree Transduction Sentence Compression as Tree Transduction
This paper presents a tree-to-tree transduction method for sentence compression. Our model is based on synchronous tree substitution grammar, a formalism that allows local distortion of the tree topology and can thus naturally capture structural mismatches. We describe an algorithm for decoding in this framework and show how the model can be trained discriminatively within a large margin framew...
متن کاملGraph matching as a combinatorial optimization problem with constraints
Let us introduce some notations. We will call GM = (VM , EM ) the model graph and GD = (VD, ED) the data graph which contains the image segments that have to be matched against GM , where Vi is the set of vertices and Ei is the set of edges of graph Gi (i = M,D). In inexact graph matching problems GD is assumed to contain more segments than GM , as that is the case when generated from an over-s...
متن کاملEfficient inference in Bayes networks as a combinatorial optimization problem
A number of exact algorithms have been developed to perform probabilistic inference in Bayesian belief networks in recent years. The techniques used in these algorithms are closely related to network structures and some of them are not easy to understand and implement. In this paper, we consider the problem from the combinatorial optimization point of view and state that e cient probabilistic i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Japanese Society for Artificial Intelligence
سال: 2007
ISSN: 1346-0714,1346-8030
DOI: 10.1527/tjsai.22.574