Abstract
Large scale language resources are key materials for practical natural language processing. The most common language resource is a dictionary which plays an important role in lexical processing. On the other hand many syntactic processing systems are based on context free grammars of phrase structure. CFG rules take complementary position of lexical data resource. In general the rules are absolute and difficult to get exact image in the analysis system. These properties make the syntactic analysis difficult to understand the total behavior when the size of rules grows. In this paper reduced type cooccurrence relations are collected from real text as a unique language resource of the Japanese kakari-uke dependency analysis. The data is a simple binary relation format of phrase dependency. It is extracted automatically using a syntactic analysis. The prototype system with eight thousand of the reduced cooccurrence relations showed eighty percent accuracy in kakari-uke dependency analysis of editorial articles. The system provides learning and incremental facility for the cooccurrency relation database.
