---
description: Algorithms for processing of text data.
---

# Text processing

Import alias `'ads-js/text-processing'`

### Table of contents

[Longest common subsequence](test-processing/longest-common-subsequence) - implementation of an algorithm which computes the longest common between two given character sequences.

[Boyer-Moore](test-processing/boyer-moore) - pattern-matching algorithm with pattern preprocessing and skips along portions of the text. Works better on longer alphabet sets.

[Knuth-Morris-Pratt](test-processing/knuth-morris-pratt) - pattern-matching algorithm with pattern preprocessing and linear runtime performance. Works better on shorter patterns.
