text.alignment
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 doi:10.1016/0022-2836(81)90087-5. This package implements the same logic for sequences of words and letters instead of molecular sequences.
- Version0.1.4
- R versionunknown
- LicenseMIT
- Needs compilation?Yes
- Last release09/14/2023
Documentation
Team
Jan Wijffels
Lincoln Mullen
Show author detailsRolesContributor, Copyright holderVrije Universiteit Brussel - DIGI: Brussels Platform for Digital Humanities
Show author detailsRolesCopyright holder
Insights
Last 30 days
Last 365 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Imports1 package
- Suggests2 packages
- Linking To1 package