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.1 |
| Depends: | SnowballC |
| Suggests: | tm |
| Published: | 2015-05-08 |
| Author: | Fridolin Wild |
| Maintainer: | Fridolin Wild <f.wild at open.ac.uk> |
| 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.1.tar.gz |
| Windows binaries: | r-devel: lsa_0.73.1.zip, r-release: lsa_0.73.1.zip, r-oldrel: lsa_0.73.1.zip |
| OS X El Capitan binaries: | r-release: lsa_0.73.1.tgz |
| OS X Mavericks binaries: | r-oldrel: lsa_0.73.1.tgz |
| Old sources: | lsa archive |
| Reverse depends: | AurieLSHGaussian, LSAfun, RWBP |
| Reverse imports: | DCD, DiffNet, IBCF.MTME, IntClust |
Please use the canonical form https://CRAN.R-project.org/package=lsa to link to this page.