A Tabular Method of Finding the Optimal Word String together with its Dependency Structure.
Kazuhiko Ozeki · 1998
This paper describes a tabular method of finding the word string, together with its dependency structure, that has the maximum preference score in a given series of word sets. The technique, which originated in the problem of constraining the process of Japanese speech recognition by linguistic knowledge, is potentially applicable to parsing and disambiguation of various natural languages. The preference score of a word string is defined by taking syntax, semantics, and reliability of each word into consideration. A set of recurrence equations is derived based on the principle of Dynamic Programming, which leads to an algorithm to solve the combinatorial optimization problem. In the algorithm, searching for the optimal word string proceeds concurrently with parsing of the string, looking up and filling in two triangular tables. 1 INTRODUCTION Let us consider, for example, a speech recognizer that accepts spoken sentences uttered with clear pauses between consecutive words. It outputs...