Scholarlink

A Chinese frequent string (CFS) is a repeated string in a Chinese text that has at least one net occurrence (i.e., an occurrence with the property that both its left-extension and its right-extension by one character are unique in the text). The net frequency of a CFS is the number of its net occurrences in the text. In this short paper, we improve recent work of Guo et al. [4] in such a way that the computation of Chinese frequent strings and their net frequencies becomes much faster.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Faster Computation of Chinese Frequent Strings and Their Net Frequencies

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Enno Ohlebusch,
  • Thomas Büchler,
  • Jannik Olbrich

摘要

A Chinese frequent string (CFS) is a repeated string in a Chinese text that has at least one net occurrence (i.e., an occurrence with the property that both its left-extension and its right-extension by one character are unique in the text). The net frequency of a CFS is the number of its net occurrences in the text. In this short paper, we improve recent work of Guo et al. [4] in such a way that the computation of Chinese frequent strings and their net frequencies becomes much faster.