Proposes an efficient dictionary access method for morphological analysis of oriental languages by extending Aho and Corasick's (1990) pattern matching machine. The proposed method is a simple and efficient algorithm to find all possible substrings in an input sentence and during a single pass. It stores the relations of grammatical connectivity of adjacent words into the output functions. Therefore, the costs of checking connections between the adjacent words can be reduced by using the connectivity relations. Furthermore, the method of constructing the grammatical connectivity relations is described. Finally, the proposed method is verified by theoretical analysis and an experimental estimation is supported by a computer simulation with a 100,000-word dictionary. From the simulation results, it turns out that the proposed method is 49.9% faster (in CPU time) than the traditional trie approach. In addition, the number of candidates for checking connections was 25.5% less than that of the original morphological analysis.