… method for keyword spotting in … keyword spotting is then conducted by a recent approximation
algorithm for graph edit distance. The novel framework for graph-based keyword spotting …

… Keyword spotting enables content-based retrieval of … Recent approaches include graph-based
representations that … edit distance (HED) for keyword spotting. It is an efficient quadratic-…

The visualisation of the four different graph representation formalisms (ie Keypoint, Grid,
Projection, and Split) is based on graphs with different mean numbers of nodes (ie small= 25-50 …

… The present paper is concerned with a graph-based system for Keyword Spotting (KWS)
in historical documents. This particular system operates on segmented words that are in turn …

Line-level keyword spotting (KWS) is presented on the basis of frame-level word posterior
probabilities. These posteriors are obtained using word graphs derived from the recognition …

Thanks to the use of lexical and syntactic information, Word Graphs (WG) have shown to
provide a competitive Precision-Recall performance, along with fast lookup times, in …

… In this paper a procedure to build an ensemble for the task of graph-based keyword
spotting is presented. Rather than representing a word by a single graph representation, the …

… for template-based keyword spotting in historical handwritten … Moreover, we extend our
method to a spotting ensemble. In … methods for template- and learning-based keyword spotting. …

The accessibility to handwritten historical documents is often constrained by the limited feasibility
of automatic full transcriptions. Keyword Spotting (KWS), that allows to retrieve arbitrary …

… A very important aspect of the whole project is the experimental evaluation of our novel
graph based procedure for keyword spotting. We plan to carry out exhaustive experimental …