Thus,the two strings can be considered as congruent only if all functions words and grammatical morphemes are disregarded. The definition of congruent strings would then have to be reformulated as follows:Congruent strings are such strings which consist of the same number of lexical words,representing equivalent grammatical categories,arranged in the same linear order and underlying semantically equivalent sentences .
đang được dịch, vui lòng đợi..
