Incremental processing and design of a parser for Japanese: A dynamic approach

This paper illustrates a parser which processes Japanese sentences in an incremantal fashion based on the Dynamic Syntax framework. In Dynamic Syntax there has basically been no algorithm which optimizes the application of transition rules: as it is, the rules can apply to a current parsing state in an arbitrary way. This paper proposes both partitioned parsing states allowing easier access to some kind of unfixed nodes and an algorithm to apply transition rules for Japanese. The parser proposed in this paper is implemented in Prolog. The parser is able to process not only simple sentences but also relative clause constructions, scrambled sentences and complex (embedded) sentences.