lsa: Latent Semantic Analysis

The basic idea of latent semantic analysis (LSA) is, that text do have a higher order (=latent semantic) structure which, however, is obscured by word usage (e.g. through the use of synonyms or polysemy). By using conceptual indices that are derived statistically via a truncated singular value decomposition (a two-mode factor analysis) over a given document-term matrix, this variability problem can be overcome.

Version: 0.73.2
Depends: SnowballC
Suggests: tm
Published: 2020-05-04
Author: Fridolin Wild
Maintainer: Fridolin Wild <wild at>
License: GPL-2 | GPL-3 [expanded from: GPL (≥ 2)]
NeedsCompilation: no
Materials: ChangeLog
In views: NaturalLanguageProcessing
CRAN checks: lsa results


Reference manual: lsa.pdf


Package source: lsa_0.73.2.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
macOS binaries: r-release (arm64): lsa_0.73.2.tgz, r-release (x86_64): lsa_0.73.2.tgz, r-oldrel: lsa_0.73.2.tgz
Old sources: lsa archive

Reverse dependencies:

Reverse depends: AurieLSHGaussian, LSAfun, RWBP
Reverse imports: BrainSABER, ccmap, CellScore, CoreGx, DCD, DiffNet, DTWBI, DTWUMI, FSMUMI, IBCF.MTME, Signac
Reverse suggests: quanteda, quanteda.textmodels


Please use the canonical form to link to this page.