The paper presents a novel method of finding a fragment in a long temporal sequence similar to the set of shorter sequences. We are the first to propose an algorithm for such a search that does not rely on computing the average sequence from query examples. Instead, we use query examples as is, utilizing all of them simultaneously. The introduced method based on the Dynamic Time Warping (DTW) technique is suited explicitly for few-shot query-by-example retrieval tasks. We evaluate it on two different few-shot problems from the field of Natural Language Processing. The results show it either outperforms baselines and previous approaches or achieves comparable results when a low number of examples is available.

本文提出了一种新颖的方法，该方法可以在类似于较短序列的较长时间序列中查找片段。我们是第一个提出这种搜索算法的人，该算法不依赖于根据查询示例计算平均序列。相反，我们按原样使用查询示例，同时使用所有示例。引入的基于动态时间规整（DTW）技术的方法明确适用于少量快照的示例查询任务。我们根据自然语言处理领域的两个不同的少数问题对其进行评估。结果表明，它比基线和以前的方法都好，或者在可用的示例数量较少时，可以达到可比的结果。