String similarity search is a fundamental operation in data cleaning and integration. It has two variants: threshold-based string similarity search and top-k string similarity search. Existing algorithms are efficient for either the former or the latter; most of them cannot support both two variants. To address this limitation, we propose a unified framework. We first recursively partition strings into disjoint segments and build a hierarchical segment tree index (