Text processing

Algorithms for processing of text data.

Import alias 'ads-js/text-processing'

Table of contents

Longest common subsequence - implementation of an algorithm which computes the longest common between two given character sequences.

Boyer-Moore - pattern-matching algorithm with pattern preprocessing and skips along portions of the text. Works better on longer alphabet sets.

Knuth-Morris-Pratt - pattern-matching algorithm with pattern preprocessing and linear runtime performance. Works better on shorter patterns.