arXiv AI By Armen Kostanyan, Arevik Harmandayan

Fuzzy Segmentations of a String

Read the original on arXiv AI →

The article addresses a specific data clustering problem: identifying groups of adjacent text segments of a suitable length that match a fuzzy pattern defined by a sequence of fuzzy properties. It proposes a heuristic algorithm that uses a prefix structure to efficiently map text segments to fuzzy properties, and proves that for the special case of unit-length segments (fuzzy string matching), the algorithm finds all matching segments. Additionally, it presents a dynamic programming approach to determine the best segmentation of an entire text based on a fuzzy pattern.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.