Investigating Unstructured Texts with Latent Semantic Analysis
Latent semantic analysis (LSA) is an algorithm applied to approximate the meaning of texts, thereby exposing semantic structure to computation. LSA combines the classical vector-space model — well known in computational linguistics — with a singular value decomposition (SVD), a two-mode factor analysis. Thus, bag-of-words representations of texts can be mapped into a modified vector space that is assumed to reflect semantic structure. In this contribution the authors describe the lsa package for the statistical language and environment R and illustrate its proper use through examples from the areas of automated essay scoring and knowledge representation.
Unable to display preview. Download preview PDF.
- BAEZA-YATES, R. and RIBEIRO-NETO, B. (1999): Modern Information Retrieval. ACM Press, New York.Google Scholar
- LANG, D.T. (2004): Rstem. R Package Version 0.2-0.Google Scholar
- STALNAKER, J.M. (1951): The Essay Type of Examination. In: E.F. Lindquist (Ed.): Educational Measurement. George Banta, Menasha, 495–530.Google Scholar
- WILD, F., STAHL, C., STERMSEK, G. and NEUMANN, G. (2005): Parameters Driving Effectiveness of Automated Essay Scoring with LSA. In: M. Danson (Ed.): Proceedings of the 9th CAA. Prof. Development, Loughborough, 485–494.Google Scholar
- WILD, F. (2005): lsa: Latent Semantic Analysis. R Package Version 0.57.Google Scholar