Active Congruency-Based Reranking
نویسندگان
چکیده
منابع مشابه
Active Congruency-Based Reranking
genre, abstract expressionism. 8 Ben Shalom et al. Active Congruency-Based Reranking Frontiers in Digital Humanities | www.frontiersin.org August 2016 | Volume 3 | Article 7 8. DiscUssiOn Our method combines two different approaches – similarity betterment by graphical models and Spectral Clustering Co-occurrence Stability based on spectral analysis. The experiments demonstrate that the contrib...
متن کاملReranking-based Crash Report Deduplication
Software projects collect and deduplicate vastly numerous crash reports from users to fix bugs efficiently. However, most existing automated methods have performance issues during large-scale clustering. We propose a rerankingbased crash report clustering method. Our method is a combination of two earlier methods. By computing similarity used in ReBucket for the crash reports that are highly si...
متن کاملKernel-based Reranking for Named-Entity Extraction
We present novel kernels based on structured and unstructured features for reranking the N-best hypotheses of conditional random fields (CRFs) applied to entity extraction. The former features are generated by a polynomial kernel encoding entity features whereas tree kernels are used to model dependencies amongst tagged candidate examples. The experiments on two standard corpora in two language...
متن کاملDiscriminative Reranking based Video Object Retrieval
For the instance search task, we are given a set of query images with the corresponding textual meta-data and objects masks to retrieve video shots containing query objects from FLICKR video database. We extract meaningful regions in the key-frames using Maximally Stable Extremal Regions (MSER) and use SIFT descriptors for representation. We use standard Bag of visual Word (BoW) model to repres...
متن کاملUsing LTAG Based Features in Parse Reranking
We propose the use of Lexicalized Tree Adjoining Grammar (LTAG) as a source of features that are useful for reranking the output of a statistical parser. In this paper, we extend the notion of a tree kernel over arbitrary sub-trees of the parse to the derivation trees and derived trees provided by the LTAG formalism, and in addition, we extend the original definition of the tree kernel, making ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers in Digital Humanities
سال: 2016
ISSN: 2297-2668
DOI: 10.3389/fdigh.2016.00007