PPT Slide

• Similarity Matching ?

• Check word distances in declarations and constraints pairwise:

Matchmaking Process: Simple Example (cont’d)

• No ontological descriptions (concepts) are attached to words.

Similarity value of two specifications:

Average of sum of similarity computations

among all pairs of declarations and constraints.

Similarity of IntegerSort and GenericSort = 0.9785

Sim(E ,E ) = 1- ( ( wd(w,w’)) / | S(E ) ? S(E )| )

?

(w,w’) in S(Ei) x S(Ej)

i

i

j

j

Let E , E be variable declarations or constraints, S(E) set of words in E.

j

i

Value exceeds given threshold. Thus, proceed with

Previous slide

Next slide

Back to first slide

View graphic version