SYSTEM AND METHOD FOR GENERATING WEIGHTED FINITE STATE AUTOMATON INDICATING GRAMMAR

摘要

PPROBLEM TO BE SOLVED: To provide a method and a system for generating weighted finite state automaton indicating grammar. PSOLUTION: A finite state transducer is generated from a rule of context freegrammar, a dependence relation graph is generated from a finite state transducer and the automaton is generated based on strongly connected components in the dependency relation graph. Topology which defines some states and uses an active symbol of a nonterminal symbol of the context freegrammar as a label among the states is defined. The topology is expanded by replacing transition, a starting state and an end state of the transition with the automaton including the symbol to be used as a label for the transition as the states. The topology is sufficiently expanded according as the topology is required for recognizing a special input string. PCOPYRIGHT: (C)2004,JPO