Singular value decomposition of linguistic symbol-array

This paper is motivated by the fact that the application of the linguistic symbol-array is popular in artificial intelligence techniques. Sometimes their use is restricted by their exponential complexity, like in fuzzy logic algorithms. The main goals of this paper are two fold: one is to define a general form of the most widely applied linguistic symbol based relations; and the second is to define a storage-space complexity reduction algorithm to the general form. The key idea of this paper is supported by the fuzzy reduction approach based on singular value decomposition