In this paper, we consider the problem of preprocessing a text $T$ of length $n$ and a dictionary $\mathcal{D}$ to answer multiple types of pattern queries. Inspired by [Charalampopoulos-Kociumaka-Mohamed-Radoszewski-Rytter-Wale\'n ISAAC 2019], we consider the Internal Dictionary, where the dictionary is interval in the sense that every pattern is given as a fragment of $T$. Therefore, the size of $\mathcal{D}$ is proportional to the number of patterns instead of their total length, which could be $\Theta(n \cdot |\mathcal{D}|)$. We propose a new technique to preprocess $T$ and organize the substring structure. In this way, we are able to develop algorithms to answer queries more efficiently than in previous works.

翻译：本文研究对长度为n的文本T和字典D进行预处理，以回答多种模式查询的问题。受[Charalampopoulos-Kociumaka-Mohamed-Radoszewski-Rytter-Wale'n ISAAC 2019]启发，我们考虑内部字典问题，其中字典在意义上具有区间性，即每个模式均以T的片段形式给出。因此，D的大小与模式数量成正比，而非其总长度（总长度可能达到Θ(n · |D|)）。我们提出一种预处理T并组织子串结构的新技术。通过该方法，我们能够开发出比以往工作更高效的回答查询的算法。