There exist very efficient algorithms to perform the SVD process on sparse matrices, allowing us to perform this operation on large corpora in a very limited time and with reduced memory requirements.
6 we can define the domain kernel to estimate the domain similarity between the contexts of the words to be disambiguated.