Latent semantic analysis

Short description: Technique in natural language processing

Latent semantic analysis (LSA) is a technique in natural language processing, in particular distributional semantics, of analyzing relationships between a set of documents and the terms they contain by producing a set of concepts related to the documents and terms. LSA assumes that words that are close in meaning will occur in similar pieces of text (the distributional hypothesis). A matrix containing word counts per document (rows represent unique words and columns represent each document) is constructed from a large piece of text and a mathematical technique called singular value decomposition (SVD) is used to reduce the number of rows while preserving the similarity structure among columns. Documents are then compared by cosine similarity between any two columns. Values close to 1 represent very similar documents while values close to 0 represent very dissimilar documents.

An information retrieval technique using latent semantic structure was patented in 1988 (US Patent 4,839,853, now expired) by Scott Deerwester, Susan Dumais, George Furnas, Richard Harshman, Thomas Landauer, Karen Lochbaum and Lynn Streeter. In the context of its application to information retrieval, it is sometimes called latent semantic indexing (LSI).

Overview

File:Topic model scheme.webm

Occurrence matrix

LSA can use a document-term matrix which describes the occurrences of terms in documents; it is a sparse matrix whose rows correspond to terms and whose columns correspond to documents. A typical example of the weighting of the elements of the matrix is tf-idf (term frequency–inverse document frequency): the weight of an element of the matrix is proportional to the number of times the terms appear in each document, where rare terms are upweighted to reflect their relative importance.

This matrix is also common to standard semantic models, though it is not necessarily explicitly expressed as a matrix, since the mathematical properties of matrices are not always used.

Rank lowering

After the construction of the occurrence matrix, LSA finds a low-rank approximation to the term-document matrix. There could be various reasons for these approximations:

• The original term-document matrix is presumed too large for the computing resources; in this case, the approximated low rank matrix is interpreted as an approximation (a "least and necessary evil").
• The original term-document matrix is presumed noisy: for example, anecdotal instances of terms are to be eliminated. From this point of view, the approximated matrix is interpreted as a de-noisified matrix (a better matrix than the original).
• The original term-document matrix is presumed overly sparse relative to the "true" term-document matrix. That is, the original matrix lists only the words actually in each document, whereas we might be interested in all words related to each document—generally a much larger set due to synonymy.

The consequence of the rank lowering is that some dimensions are combined and depend on more than one term:

{(car), (truck), (flower)} --> {(1.3452 * car + 0.2828 * truck), (flower)}

This mitigates the problem of identifying synonymy, as the rank lowering is expected to merge the dimensions associated with terms that have similar meanings. It also partially mitigates the problem with polysemy, since components of polysemous words that point in the "right" direction are added to the components of words that share a similar meaning. Conversely, components that point in other directions tend to either simply cancel out, or, at worst, to be smaller than components in the directions corresponding to the intended sense.

Derivation

Let [math]\displaystyle{ X }[/math] be a matrix where element [math]\displaystyle{ (i,j) }[/math] describes the occurrence of term [math]\displaystyle{ i }[/math] in document [math]\displaystyle{ j }[/math] (this can be, for example, the frequency). [math]\displaystyle{ X }[/math] will look like this:

[math]\displaystyle{ \begin{matrix} & \textbf{d}_j \\ & \downarrow \\ \textbf{t}_i^T \rightarrow & \begin{bmatrix} x_{1,1} & \dots & x_{1,j} & \dots & x_{1,n} \\ \vdots & \ddots & \vdots & \ddots & \vdots \\ x_{i,1} & \dots & x_{i,j} & \dots & x_{i,n} \\ \vdots & \ddots & \vdots & \ddots & \vdots \\ x_{m,1} & \dots & x_{m,j} & \dots & x_{m,n} \\ \end{bmatrix} \end{matrix} }[/math]

Now a row in this matrix will be a vector corresponding to a term, giving its relation to each document:

[math]\displaystyle{ \textbf{t}_i^T = \begin{bmatrix} x_{i,1} & \dots & x_{i,j} & \dots & x_{i,n} \end{bmatrix} }[/math]

Likewise, a column in this matrix will be a vector corresponding to a document, giving its relation to each term:

[math]\displaystyle{ \textbf{d}_j = \begin{bmatrix} x_{1,j} \\ \vdots \\ x_{i,j} \\ \vdots \\ x_{m,j} \\ \end{bmatrix} }[/math]

Now the dot product [math]\displaystyle{ \textbf{t}_i^T \textbf{t}_p }[/math] between two term vectors gives the correlation between the terms over the set of documents. The matrix product [math]\displaystyle{ X X^T }[/math] contains all these dot products. Element [math]\displaystyle{ (i,p) }[/math] (which is equal to element [math]\displaystyle{ (p,i) }[/math]) contains the dot product [math]\displaystyle{ \textbf{t}_i^T \textbf{t}_p }[/math] ([math]\displaystyle{ = \textbf{t}_p^T \textbf{t}_i }[/math]). Likewise, the matrix [math]\displaystyle{ X^T X }[/math] contains the dot products between all the document vectors, giving their correlation over the terms: [math]\displaystyle{ \textbf{d}_j^T \textbf{d}_q = \textbf{d}_q^T \textbf{d}_j }[/math].

Now, from the theory of linear algebra, there exists a decomposition of [math]\displaystyle{ X }[/math] such that [math]\displaystyle{ U }[/math] and [math]\displaystyle{ V }[/math] are orthogonal matrices and [math]\displaystyle{ \Sigma }[/math] is a diagonal matrix. This is called a singular value decomposition (SVD):

[math]\displaystyle{ \begin{matrix} X = U \Sigma V^T \end{matrix} }[/math]

The matrix products giving us the term and document correlations then become

[math]\displaystyle{ \begin{matrix} X X^T &=& (U \Sigma V^T) (U \Sigma V^T)^T = (U \Sigma V^T) (V^{T^T} \Sigma^T U^T) = U \Sigma V^T V \Sigma^T U^T = U \Sigma \Sigma^T U^T \\ X^T X &=& (U \Sigma V^T)^T (U \Sigma V^T) = (V^{T^T} \Sigma^T U^T) (U \Sigma V^T) = V \Sigma^T U^T U \Sigma V^T = V \Sigma^T \Sigma V^T \end{matrix} }[/math]

Since [math]\displaystyle{ \Sigma \Sigma^T }[/math] and [math]\displaystyle{ \Sigma^T \Sigma }[/math] are diagonal we see that [math]\displaystyle{ U }[/math] must contain the eigenvectors of [math]\displaystyle{ X X^T }[/math], while [math]\displaystyle{ V }[/math] must be the eigenvectors of [math]\displaystyle{ X^T X }[/math]. Both products have the same non-zero eigenvalues, given by the non-zero entries of [math]\displaystyle{ \Sigma \Sigma^T }[/math], or equally, by the non-zero entries of [math]\displaystyle{ \Sigma^T\Sigma }[/math]. Now the decomposition looks like this:

[math]\displaystyle{ \begin{matrix} & X & & & U & & \Sigma & & V^T \\ & (\textbf{d}_j) & & & & & & & (\hat{\textbf{d}}_j) \\ & \downarrow & & & & & & & \downarrow \\ (\textbf{t}_i^T) \rightarrow & \begin{bmatrix} x_{1,1} & \dots & x_{1,j} & \dots & x_{1,n} \\ \vdots & \ddots & \vdots & \ddots & \vdots \\ x_{i,1} & \dots & x_{i,j} & \dots & x_{i,n} \\ \vdots & \ddots & \vdots & \ddots & \vdots \\ x_{m,1} & \dots & x_{m,j} & \dots & x_{m,n} \\ \end{bmatrix} & = & (\hat{\textbf{t}}_i^T) \rightarrow & \begin{bmatrix} \begin{bmatrix} \, \\ \, \\ \textbf{u}_1 \\ \, \\ \,\end{bmatrix} \dots \begin{bmatrix} \, \\ \, \\ \textbf{u}_l \\ \, \\ \, \end{bmatrix} \end{bmatrix} & \cdot & \begin{bmatrix} \sigma_1 & \dots & 0 \\ \vdots & \ddots & \vdots \\ 0 & \dots & \sigma_l \\ \end{bmatrix} & \cdot & \begin{bmatrix} \begin{bmatrix} & & \textbf{v}_1 & & \end{bmatrix} \\ \vdots \\ \begin{bmatrix} & & \textbf{v}_l & & \end{bmatrix} \end{bmatrix} \end{matrix} }[/math]

The values [math]\displaystyle{ \sigma_1, \dots, \sigma_l }[/math] are called the singular values, and [math]\displaystyle{ u_1, \dots, u_l }[/math] and [math]\displaystyle{ v_1, \dots, v_l }[/math] the left and right singular vectors. Notice the only part of [math]\displaystyle{ U }[/math] that contributes to [math]\displaystyle{ \textbf{t}_i }[/math] is the [math]\displaystyle{ i\textrm{'th} }[/math] row. Let this row vector be called [math]\displaystyle{ \hat{\textrm{t}}^T_i }[/math]. Likewise, the only part of [math]\displaystyle{ V^T }[/math] that contributes to [math]\displaystyle{ \textbf{d}_j }[/math] is the [math]\displaystyle{ j\textrm{'th} }[/math] column, [math]\displaystyle{ \hat{ \textrm{d}}_j }[/math]. These are not the eigenvectors, but depend on all the eigenvectors.

It turns out that when you select the [math]\displaystyle{ k }[/math] largest singular values, and their corresponding singular vectors from [math]\displaystyle{ U }[/math] and [math]\displaystyle{ V }[/math], you get the rank [math]\displaystyle{ k }[/math] approximation to [math]\displaystyle{ X }[/math] with the smallest error (Frobenius norm). This approximation has a minimal error. But more importantly we can now treat the term and document vectors as a "semantic space". The row "term" vector [math]\displaystyle{ \hat{\textbf{t}}^T_i }[/math] then has [math]\displaystyle{ k }[/math] entries mapping it to a lower-dimensional space. These new dimensions do not relate to any comprehensible concepts. They are a lower-dimensional approximation of the higher-dimensional space. Likewise, the "document" vector [math]\displaystyle{ \hat{\textbf{d}}_j }[/math] is an approximation in this lower-dimensional space. We write this approximation as

[math]\displaystyle{ X_k = U_k \Sigma_k V_k^T }[/math]

You can now do the following:

• See how related documents [math]\displaystyle{ j }[/math] and [math]\displaystyle{ q }[/math] are in the low-dimensional space by comparing the vectors [math]\displaystyle{ \Sigma_k \cdot \hat{\textbf{d}}_j }[/math] and [math]\displaystyle{ \Sigma_k \cdot \hat{\textbf{d}}_q }[/math] (typically by cosine similarity).
• Comparing terms [math]\displaystyle{ i }[/math] and [math]\displaystyle{ p }[/math] by comparing the vectors [math]\displaystyle{ \Sigma_k \cdot \hat{\textbf{t}}_i }[/math] and [math]\displaystyle{ \Sigma_k \cdot \hat{\textbf{t}}_p }[/math]. Note that [math]\displaystyle{ \hat{\textbf{t}} }[/math] is now a column vector.
• Documents and term vector representations can be clustered using traditional clustering algorithms like k-means using similarity measures like cosine.
• Given a query, view this as a mini document, and compare it to your documents in the low-dimensional space.

To do the latter, you must first translate your query into the low-dimensional space. It is then intuitive that you must use the same transformation that you use on your documents:

[math]\displaystyle{ \hat{\textbf{d}}_j = \Sigma_k^{-1}U_k^T{\textbf{d}}_j }[/math]

Note here that the inverse of the diagonal matrix [math]\displaystyle{ \Sigma_k }[/math] may be found by inverting each nonzero value within the matrix.

This means that if you have a query vector [math]\displaystyle{ q }[/math], you must do the translation [math]\displaystyle{ \hat{\textbf{q}} = \Sigma_k^{-1} U_k^T \textbf{q} }[/math] before you compare it with the document vectors in the low-dimensional space. You can do the same for pseudo term vectors:

[math]\displaystyle{ \textbf{t}_i^T = \hat{\textbf{t}}_i^T \Sigma_k V_k^T }[/math]

[math]\displaystyle{ \hat{\textbf{t}}_i^T = \textbf{t}_i^T V_k^{-T} \Sigma_k^{-1} = \textbf{t}_i^T V_k \Sigma_k^{-1} }[/math]

[math]\displaystyle{ \hat{\textbf{t}}_i = \Sigma_k^{-1} V_k^T \textbf{t}_i }[/math]

Applications

The new low-dimensional space typically can be used to:

• Compare the documents in the low-dimensional space (data clustering, document classification).
• Find similar documents across languages, after analyzing a base set of translated documents (cross-language information retrieval).
• Find relations between terms (synonymy and polysemy).
• Given a query of terms, translate it into the low-dimensional space, and find matching documents (information retrieval).
• Find the best similarity between small groups of terms, in a semantic way (i.e. in a context of a knowledge corpus), as for example in multi choice questions MCQ answering model.
• Expand the feature space of machine learning / text mining systems
• Analyze word association in text corpus

Synonymy and polysemy are fundamental problems in natural language processing:

• Synonymy is the phenomenon where different words describe the same idea. Thus, a query in a search engine may fail to retrieve a relevant document that does not contain the words which appeared in the query. For example, a search for "doctors" may not return a document containing the word "physicians", even though the words have the same meaning.
• Polysemy is the phenomenon where the same word has multiple meanings. So a search may retrieve irrelevant documents containing the desired words in the wrong meaning. For example, a botanist and a computer scientist looking for the word "tree" probably desire different sets of documents.

Commercial applications

LSA has been used to assist in performing prior art searches for patents.

Applications in human memory

The use of Latent Semantic Analysis has been prevalent in the study of human memory, especially in areas of free recall and memory search. There is a positive correlation between the semantic similarity of two words (as measured by LSA) and the probability that the words would be recalled one after another in free recall tasks using study lists of random common nouns. They also noted that in these situations, the inter-response time between the similar words was much quicker than between dissimilar words. These findings are referred to as the Semantic Proximity Effect.

When participants made mistakes in recalling studied items, these mistakes tended to be items that were more semantically related to the desired item and found in a previously studied list. These prior-list intrusions, as they have come to be called, seem to compete with items on the current list for recall.

Another model, termed Word Association Spaces (WAS) is also used in memory studies by collecting free association data from a series of experiments and which includes measures of word relatedness for over 72,000 distinct word pairs.

Implementation

The SVD is typically computed using large matrix methods (for example, Lanczos methods) but may also be computed incrementally and with greatly reduced resources via a neural network-like approach, which does not require the large, full-rank matrix to be held in memory. A fast, incremental, low-memory, large-matrix SVD algorithm has recently been developed. MATLAB and Python implementations of these fast algorithms are available. Unlike Gorrell and Webb's (2005) stochastic approximation, Brand's algorithm (2003) provides an exact solution. In recent years progress has been made to reduce the computational complexity of SVD; for instance, by using a parallel ARPACK algorithm to perform parallel eigenvalue decomposition it is possible to speed up the SVD computation cost while providing comparable prediction quality.

Limitations

Some of LSA's drawbacks include:

• The resulting dimensions might be difficult to interpret. For instance, in

{(car), (truck), (flower)} ↦ {(1.3452 * car + 0.2828 * truck), (flower)}

the (1.3452 * car + 0.2828 * truck) component could be interpreted as "vehicle". However, it is very likely that cases close to

{(car), (bottle), (flower)} ↦ {(1.3452 * car + 0.2828 * bottle), (flower)}

will occur. This leads to results which can be justified on the mathematical level, but have no immediately obvious meaning in natural language. Though, the (1.3452 * car + 0.2828 * bottle) component could be justified on account of the fact that both bottles and cars have transparent and opaque parts, are man made and with high probability contain logos/words on their surface; thus, in many ways these two concepts "share semantics." That is, within a language in question, there may not be a readily available word to assign and explainability becomes an analysis task as opposed to simple word/class/concept assignment task.

• LSA can only partially capture polysemy (i.e., multiple meanings of a word) because each occurrence of a word is treated as having the same meaning due to the word being represented as a single point in space. For example, the occurrence of "chair" in a document containing "The Chair of the Board" and in a separate document containing "the chair maker" are considered the same. The behavior results in the vector representation being an average of all the word's different meanings in the corpus, which can make it difficult for comparison. However, the effect is often lessened due to words having a predominant sense throughout a corpus (i.e. not all meanings are equally likely).
• Limitations of bag of words model (BOW), where a text is represented as an unordered collection of words. To address some of the limitation of bag of words model (BOW), multi-gram dictionary can be used to find direct and indirect association as well as higher-order co-occurrences among terms.
• The probabilistic model of LSA does not match observed data: LSA assumes that words and documents form a joint Gaussian model (ergodic hypothesis), while a Poisson distribution has been observed. Thus, a newer alternative is probabilistic latent semantic analysis, based on a multinomial model, which is reported to give better results than standard LSA.

Alternative methods

Semantic hashing

In semantic hashing documents are mapped to memory addresses by means of a neural network in such a way that semantically similar documents are located at nearby addresses. Deep neural network essentially builds a graphical model of the word-count vectors obtained from a large set of documents. Documents similar to a query document can then be found by simply accessing all the addresses that differ by only a few bits from the address of the query document. This way of extending the efficiency of hash-coding to approximate matching is much faster than locality sensitive hashing, which is the fastest current method.

Latent semantic indexing

Latent semantic indexing (LSI) is an indexing and retrieval method that uses a mathematical technique called singular value decomposition (SVD) to identify patterns in the relationships between the terms and concepts contained in an unstructured collection of text. LSI is based on the principle that words that are used in the same contexts tend to have similar meanings. A key feature of LSI is its ability to extract the conceptual content of a body of text by establishing associations between those terms that occur in similar contexts.

LSI is also an application of correspondence analysis, a multivariate statistical technique developed by Jean-Paul Benzécri in the early 1970s, to a contingency table built from word counts in documents.

Called "latent semantic indexing" because of its ability to correlate semantically related terms that are latent in a collection of text, it was first applied to text at Bellcore in the late 1980s. The method, also called latent semantic analysis (LSA), uncovers the underlying latent semantic structure in the usage of words in a body of text and how it can be used to extract the meaning of the text in response to user queries, commonly referred to as concept searches. Queries, or concept searches, against a set of documents that have undergone LSI will return results that are conceptually similar in meaning to the search criteria even if the results don’t share a specific word or words with the search criteria.

Benefits of LSI

LSI helps overcome synonymy by increasing recall, one of the most problematic constraints of Boolean keyword queries and vector space models. Synonymy is often the cause of mismatches in the vocabulary used by the authors of documents and the users of information retrieval systems. As a result, Boolean or keyword queries often return irrelevant results and miss information that is relevant.

LSI is also used to perform automated document categorization. In fact, several experiments have demonstrated that there are a number of correlations between the way LSI and humans process and categorize text. Document categorization is the assignment of documents to one or more predefined categories based on their similarity to the conceptual content of the categories. LSI uses example documents to establish the conceptual basis for each category. During categorization processing, the concepts contained in the documents being categorized are compared to the concepts contained in the example items, and a category (or categories) is assigned to the documents based on the similarities between the concepts they contain and the concepts that are contained in the example documents.

Dynamic clustering based on the conceptual content of documents can also be accomplished using LSI. Clustering is a way to group documents based on their conceptual similarity to each other without using example documents to establish the conceptual basis for each cluster. This is very useful when dealing with an unknown collection of unstructured text.

Because it uses a strictly mathematical approach, LSI is inherently independent of language. This enables LSI to elicit the semantic content of information written in any language without requiring the use of auxiliary structures, such as dictionaries and thesauri. LSI can also perform cross-linguistic concept searching and example-based categorization. For example, queries can be made in one language, such as English, and conceptually similar results will be returned even if they are composed of an entirely different language or of multiple languages.

LSI is not restricted to working only with words. It can also process arbitrary character strings. Any object that can be expressed as text can be represented in an LSI vector space. For example, tests with MEDLINE abstracts have shown that LSI is able to effectively classify genes based on conceptual modeling of the biological information contained in the titles and abstracts of the MEDLINE citations.

LSI automatically adapts to new and changing terminology, and has been shown to be very tolerant of noise (i.e., misspelled words, typographical errors, unreadable characters, etc.). This is especially important for applications using text derived from Optical Character Recognition (OCR) and speech-to-text conversion. LSI also deals effectively with sparse, ambiguous, and contradictory data.

Text does not need to be in sentence form for LSI to be effective. It can work with lists, free-form notes, email, Web-based content, etc. As long as a collection of text contains multiple terms, LSI can be used to identify patterns in the relationships between the important terms and concepts contained in the text.

LSI has proven to be a useful solution to a number of conceptual matching problems. The technique has been shown to capture key relationship information, including causal, goal-oriented, and taxonomic information.

LSI timeline

• Mid-1960s – Factor analysis technique first described and tested (H. Borko and M. Bernick)
• 1988 – Seminal paper on LSI technique published
• 1989 – Original patent granted
• 1992 – First use of LSI to assign articles to reviewers
• 1994 – Patent granted for the cross-lingual application of LSI (Landauer et al.)
• 1995 – First use of LSI for grading essays (Foltz, et al., Landauer et al.)
• 1999 – First implementation of LSI technology for intelligence community for analyzing unstructured text (SAIC).
• 2002 – LSI-based product offering to intelligence-based government agencies (SAIC)

Mathematics of LSI

LSI uses common linear algebra techniques to learn the conceptual correlations in a collection of text. In general, the process involves constructing a weighted term-document matrix, performing a Singular Value Decomposition on the matrix, and using the matrix to identify the concepts contained in the text.

Term-document matrix

LSI begins by constructing a term-document matrix, [math]\displaystyle{ A }[/math], to identify the occurrences of the [math]\displaystyle{ m }[/math] unique terms within a collection of [math]\displaystyle{ n }[/math] documents. In a term-document matrix, each term is represented by a row, and each document is represented by a column, with each matrix cell, [math]\displaystyle{ a_{ij} }[/math], initially representing the number of times the associated term appears in the indicated document, [math]\displaystyle{ \mathrm{tf_{ij}} }[/math]. This matrix is usually very large and very sparse.

Once a term-document matrix is constructed, local and global weighting functions can be applied to it to condition the data. The weighting functions transform each cell, [math]\displaystyle{ a_{ij} }[/math] of [math]\displaystyle{ A }[/math], to be the product of a local term weight, [math]\displaystyle{ l_{ij} }[/math], which describes the relative frequency of a term in a document, and a global weight, [math]\displaystyle{ g_i }[/math], which describes the relative frequency of the term within the entire collection of documents.

Some common local weighting functions are defined in the following table.

Binary		[math]\displaystyle{ l_{ij} = 1 }[/math] if the term exists in the document, or else [math]\displaystyle{ 0 }[/math]
TermFrequency		[math]\displaystyle{ l_{ij} = \mathrm{tf}_{ij} }[/math], the number of occurrences of term [math]\displaystyle{ i }[/math] in document [math]\displaystyle{ j }[/math]
Log		[math]\displaystyle{ l_{ij} = \log(\mathrm{tf}_{ij} + 1) }[/math]
Augnorm		[math]\displaystyle{ l_{ij} = \frac{\Big(\frac{\mathrm{tf}_{ij}}{\max_i(\mathrm{tf}_{ij})}\Big) + 1}{2} }[/math]

Some common global weighting functions are defined in the following table.

Binary		[math]\displaystyle{ g_i = 1 }[/math]
Normal		[math]\displaystyle{ g_i = \frac{1}{\sqrt{\sum_j \mathrm{tf}_{ij}^2}} }[/math]
GfIdf		[math]\displaystyle{ g_i = \mathrm{gf}_i / \mathrm{df}_i }[/math], where [math]\displaystyle{ \mathrm{gf}_i }[/math] is the total number of times term [math]\displaystyle{ i }[/math] occurs in the whole collection, and [math]\displaystyle{ \mathrm{df}_i }[/math] is the number of documents in which term [math]\displaystyle{ i }[/math] occurs.
Idf (Inverse Document Frequency)		[math]\displaystyle{ g_i = \log_2 \frac{n}{1+ \mathrm{df}_i} }[/math]
Entropy		[math]\displaystyle{ g_i = 1 + \sum_j \frac{p_{ij} \log p_{ij}}{\log n} }[/math], where [math]\displaystyle{ p_{ij} = \frac{\mathrm{tf}_{ij}}{\mathrm{gf}_i} }[/math]

Empirical studies with LSI report that the Log and Entropy weighting functions work well, in practice, with many data sets. In other words, each entry [math]\displaystyle{ a_{ij} }[/math] of [math]\displaystyle{ A }[/math] is computed as:

[math]\displaystyle{ g_i = 1 + \sum_j \frac{p_{ij} \log p_{ij}}{\log n} }[/math]

[math]\displaystyle{ a_{ij} = g_i \ \log (\mathrm{tf}_{ij} + 1) }[/math]

Rank-reduced singular value decomposition

A rank-reduced, singular value decomposition is performed on the matrix to determine patterns in the relationships between the terms and concepts contained in the text. The SVD forms the foundation for LSI. It computes the term and document vector spaces by approximating the single term-frequency matrix, [math]\displaystyle{ A }[/math], into three other matrices— an m by r term-concept vector matrix [math]\displaystyle{ T }[/math], an r by r singular values matrix [math]\displaystyle{ S }[/math], and a n by r concept-document vector matrix, [math]\displaystyle{ D }[/math], which satisfy the following relations:

[math]\displaystyle{ A \approx TSD^T }[/math]

[math]\displaystyle{ T^T T = I_r \quad D^T D = I_r }[/math]

[math]\displaystyle{ S_{1,1} \geq S_{2,2} \geq \ldots \geq S_{r,r} \gt 0 \quad S_{i,j} = 0 \; \text{where} \; i \neq j }[/math]

In the formula, A is the supplied m by n weighted matrix of term frequencies in a collection of text where m is the number of unique terms, and n is the number of documents. T is a computed m by r matrix of term vectors where r is the rank of A—a measure of its unique dimensions ≤ min(m,n). S is a computed r by r diagonal matrix of decreasing singular values, and D is a computed n by r matrix of document vectors.

The SVD is then truncated to reduce the rank by keeping only the largest k « r diagonal entries in the singular value matrix S, where k is typically on the order 100 to 300 dimensions. This effectively reduces the term and document vector matrix sizes to m by k and n by k respectively. The SVD operation, along with this reduction, has the effect of preserving the most important semantic information in the text while reducing noise and other undesirable artifacts of the original space of A. This reduced set of matrices is often denoted with a modified formula such as:

A ≈ A_k = T_k S_k D_k^T

Efficient LSI algorithms only compute the first k singular values and term and document vectors as opposed to computing a full SVD and then truncating it.

Note that this rank reduction is essentially the same as doing Principal Component Analysis (PCA) on the matrix A, except that PCA subtracts off the means. PCA loses the sparseness of the A matrix, which can make it infeasible for large lexicons.

Querying and augmenting LSI vector spaces

The computed T_k and D_k matrices define the term and document vector spaces, which with the computed singular values, S_k, embody the conceptual information derived from the document collection. The similarity of terms or documents within these spaces is a factor of how close they are to each other in these spaces, typically computed as a function of the angle between the corresponding vectors.

The same steps are used to locate the vectors representing the text of queries and new documents within the document space of an existing LSI index. By a simple transformation of the A = T S D^T equation into the equivalent D = A^T T S⁻¹ equation, a new vector, d, for a query or for a new document can be created by computing a new column in A and then multiplying the new column by T S⁻¹. The new column in A is computed using the originally derived global term weights and applying the same local weighting function to the terms in the query or in the new document.

A drawback to computing vectors in this way, when adding new searchable documents, is that terms that were not known during the SVD phase for the original index are ignored. These terms will have no impact on the global weights and learned correlations derived from the original collection of text. However, the computed vectors for the new text are still very relevant for similarity comparisons with all other document vectors.

The process of augmenting the document vector spaces for an LSI index with new documents in this manner is called folding in. Although the folding-in process does not account for the new semantic content of the new text, adding a substantial number of documents in this way will still provide good results for queries as long as the terms and concepts they contain are well represented within the LSI index to which they are being added. When the terms and concepts of a new set of documents need to be included in an LSI index, either the term-document matrix, and the SVD, must be recomputed or an incremental update method (such as the one described in ) is needed.

Additional uses of LSI

It is generally acknowledged that the ability to work with text on a semantic basis is essential to modern information retrieval systems. As a result, the use of LSI has significantly expanded in recent years as earlier challenges in scalability and performance have been overcome.

LSI is being used in a variety of information retrieval and text processing applications, although its primary application has been for concept searching and automated document categorization. Below are some other ways in which LSI is being used:

• Information discovery (eDiscovery, Government/Intelligence community, Publishing)
• Automated document classification (eDiscovery, Government/Intelligence community, Publishing)
• Text summarization (eDiscovery, Publishing)
• Relationship discovery (Government, Intelligence community, Social Networking)
• Automatic generation of link charts of individuals and organizations (Government, Intelligence community)
• Matching technical papers and grants with reviewers (Government)
• Online customer support (Customer Management)
• Determining document authorship (Education)
• Automatic keyword annotation of images
• Understanding software source code (Software Engineering)
• Filtering spam (System Administration)
• Information visualization
• Essay scoring (Education)
• Literature-based discovery
• Stock returns prediction
• Dream Content Analysis (Psychology)

LSI is increasingly being used for electronic document discovery (eDiscovery) to help enterprises prepare for litigation. In eDiscovery, the ability to cluster, categorize, and search large collections of unstructured text on a conceptual basis is essential. Concept-based searching using LSI has been applied to the eDiscovery process by leading providers as early as 2003.

Challenges to LSI

Early challenges to LSI focused on scalability and performance. LSI requires relatively high computational performance and memory in comparison to other information retrieval techniques. However, with the implementation of modern high-speed processors and the availability of inexpensive memory, these considerations have been largely overcome. Real-world applications involving more than 30 million documents that were fully processed through the matrix and SVD computations are common in some LSI applications. A fully scalable (unlimited number of documents, online training) implementation of LSI is contained in the open source gensim software package.

Another challenge to LSI has been the alleged difficulty in determining the optimal number of dimensions to use for performing the SVD. As a general rule, fewer dimensions allow for broader comparisons of the concepts contained in a collection of text, while a higher number of dimensions enable more specific (or more relevant) comparisons of concepts. The actual number of dimensions that can be used is limited by the number of documents in the collection. Research has demonstrated that around 300 dimensions will usually provide the best results with moderate-sized document collections (hundreds of thousands of documents) and perhaps 400 dimensions for larger document collections (millions of documents). However, recent studies indicate that 50-1000 dimensions are suitable depending on the size and nature of the document collection. Checking the proportion of variance retained, similar to PCA or factor analysis, to determine the optimal dimensionality is not suitable for LSI. Using a synonym test or prediction of missing words are two possible methods to find the correct dimensionality. When LSI topics are used as features in supervised learning methods, one can use prediction error measurements to find the ideal dimensionality.

See also

• Coh-Metrix
• Compound term processing
• Distributional semantics
• Explicit semantic analysis
• Latent semantic mapping
• Latent semantic structure indexing
• Principal components analysis
• Probabilistic latent semantic analysis
• Spamdexing
• Word vector
• Topic model
  • Latent Dirichlet allocation

Further reading

• "Introduction to Latent Semantic Analysis". Discourse Processes 25 (2–3): 259–284. 1998. doi:10.1080/01638539809545028. http://lsa.colorado.edu/papers/dp1.LSAintro.pdf. 
• Deerwester, Scott; Dumais, Susan T.; Furnas, George W.; Landauer, Thomas K.; Harshman, Richard (1990). "Indexing by Latent Semantic Analysis". Journal of the American Society for Information Science 41 (6): 391–407. doi:10.1002/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9. http://lsi.research.telcordia.com/lsi/papers/JASIS90.pdf.  Original article where the model was first exposed.
• Berry, Michael; Dumais, Susan T.; O'Brien, Gavin W. (1995). Using Linear Algebra for Intelligent Information Retrieval. http://citeseer.ist.psu.edu/berry95using.html.  (PDF) . Illustration of the application of LSA to document retrieval.
• Chicco, D; Masseroli, M (2015). "Software suite for gene and protein annotation prediction and similarity search". IEEE/ACM Transactions on Computational Biology and Bioinformatics 12 (4): 837–843. doi:10.1109/TCBB.2014.2382127. PMID 26357324. https://doi.org/10.1109/TCBB.2014.2382127. 
• "Latent Semantic Analysis". InfoVis. http://iv.slis.indiana.edu/sw/lsa.html. 
• Fridolin Wild (November 23, 2005). "An Open Source LSA Package for R". CRAN. http://cran.at.r-project.org/web/packages/lsa/index.html. 
• Thomas Landauer, Susan T. Dumais. "A Solution to Plato's Problem: The Latent Semantic Analysis Theory of Acquisition, Induction, and Representation of Knowledge". http://www.welchco.com/02/14/01/60/96/02/2901.HTM. 

External links

Articles on LSA

• Latent Semantic Analysis, a scholarpedia article on LSA written by Tom Landauer, one of the creators of LSA.

Talks and demonstrations

• LSA Overview, talk by Prof. Thomas Hofmann describing LSA, its applications in Information Retrieval, and its connections to probabilistic latent semantic analysis.
• Complete LSA sample code in C# for Windows. The demo code includes enumeration of text files, filtering stop words, stemming, making a document-term matrix and SVD.

Implementations

Due to its cross-domain applications in Information Retrieval, Natural Language Processing (NLP), Cognitive Science and Computational Linguistics, LSA has been implemented to support many different kinds of applications.

• Sense Clusters, an Information Retrieval-oriented perl implementation of LSA
• S-Space Package, a Computational Linguistics and Cognitive Science-oriented Java implementation of LSA
• Semantic Vectors applies Random Projection, LSA, and Reflective Random Indexing to Lucene term-document matrices
• Infomap Project, an NLP-oriented C implementation of LSA (superseded by semanticvectors project)
• Text to Matrix Generator, A MATLAB Toolbox for generating term-document matrices from text collections, with support for LSA
• Gensim contains a Python implementation of LSA for matrices larger than RAM.