Text Alignment with Smith-Waterman

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 . This package implements the same logic for sequences of words and letters instead of molecular sequences.


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


0.1.2 by Jan Wijffels, a year ago


Browse source code at https://github.com/cran/text.alignment

Authors: Jan Wijffels [aut, cre, cph] (Rewrite of functionalities from the textreuse R package) , Vrije Universiteit Brussel - DIGI: Brussels Platform for Digital Humanities [cph] , Lincoln Mullen [ctb, cph]

Documentation:   PDF Manual  

MIT + file LICENSE license

Imports Rcpp

Suggests knitr, markdown

Linking to Rcpp

See at CRAN