Abstract
The computational complexity of a formal process for the construction of term classes is examined. While the process is proved to be difficult computatlonally, heumstic methods are ap- plied Experimental results are obtained to illustrate the maximum possible improvement in system performance of retrieval using the formal construction over simple term retrieval