tokenize_letters

Tokenise text into a sequence of characters

Find similarities between texts using the Smith-Waterman algorithm. The algorithm performs local sequence alignment and determines similar regions between two strings.
The Smith-Waterman algorithm is explained in the paper: "Identification of common molecular subsequences" by T.F.Smith and M.S.Waterman (1981), available at <doi:10.1016/0022-2836(81)90087-5>.
This package implements the same logic for sequences of words and letters instead of molecular sequences.

Jan Wijffels

text.alignment

Text Alignment with Smith-Waterman

Vrije Universiteit Brussel - DIGI: Brussels Platform for Digital Humanities 

Lincoln Mullen

tokenize_letters function

<dl><dt>x</dt>
<dd>a character string of length 1</dd></dl>

Arguments

Tokenise text into a sequence of characters — tokenize_letters

<dl>

<dt>x</dt>
<dd>a character string of length 1</dd>

</dl>

tokenize_letters: Tokenise text into a sequence of characters

Description

Usage

Value

Arguments

See Also

Examples