arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2605.09668cs.FLmath.GN
收藏

渐近豪斯多夫与语言相似性

Asymptotic Hausdorff and Language Similarity

Stein Faculty of Computer and Information Science, Ben Gurion University(本-古里安大学斯坦计算机与信息科学学院)

Dana Fisman, Gal Meirom

AI总结:

本文提出渐近豪斯多夫提升方法,用于在无限域上提升元素级度量,以捕捉渐近相似性。通过研究正则语言的等价类,揭示了基于归一化编辑距离的渐近本质。

摘要:

本文提出渐近豪斯多夫提升方法,用于在无限域上提升元素级度量,以捕捉渐近相似性。通过研究正则语言的等价类,揭示了基于归一化编辑距离的渐近本质。

英文摘要:

We introduce the \textit{Asymptotic Hausdorff} lifting, denoted $\mathbb{AH}_{d}$, a general method for lifting an element-level metric $d$ to a (pseudo-) metric on sets, that captures asymptotic similarity in infinite domains equipped with a notion of size. The construction is designed to be insensitive to finite deviations and to avoid the limitations of classical Hausdorff-based approaches, which are often overly sensitive to outliers and fail to reflect asymptotic behavior. Formal languages provide a central motivating instance of this framework, where elements are words and sets are languages. When applied to normalized edit distances, the Asymptotic Hausdorff lifting yields metric-valued distances between languages that reflect asymptotic edit behavior while preserving metric structure. We study the equivalence classes of regular languages induced by $\mathbb{AH}_{d}$ for normalized edit distances $d$, and characterize their asymptotic essence. Focusing in particular on the normalized edit distance of Marzal and Vidal, $\textsf{ned}$, we investigate the computation of $\mathbb{AH}_{\textsf{ned}}$ for regular languages and for bounded context-free languages.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑