Nothing
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.
Package details |
|
---|---|
Author | 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] |
Maintainer | Jan Wijffels <jwijffels@bnosac.be> |
License | MIT + file LICENSE |
Version | 0.1.4 |
URL | https://github.com/DIGI-VUB/text.alignment |
Package repository | View on CRAN |
Installation |
Install the latest version of this package by entering the following in R:
|
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.