| 摘要 |
PROBLEM TO BE SOLVED: To perform association based on only properties of two element strings in elastic mapping for associating each element so that two element strings are made similar, and thereby any number of elements are skipped from the association and association results of assuming any correspondence as beginning or end are obtained.SOLUTION: A directed acyclic graph is constituted on a lattice space being a cartesian product of the set of each element, when associating two element strings of lengths I, J. The directed acyclic graph is constituted which comprises directed sides of the number in proportion to IJas a first feature, in a procedure for finding association by the search for the shortest path in the graph using the dynamic programming. As a second feature, the cost of a lattice point being the cost between the elements is set so as to mix the lattice point being set when having to associate the elements and having the cost of a negative value with the lattice point being set when it is not so and having a non-negative cost.SELECTED DRAWING: Figure 6 |
