We are trying to develop an application that finds similar bug-records from our bug database so as to to help engineers to fix them by leveraging similar experiences.
It's not a suitable way If search the database directly by key words because too many will be found in one hand, if provide more key words in another hand then too few or nothing will be found. And the results are not accurate after all.
The result can be good if we tried to see an *entire bug record* as a vector point in space and find its nearest neighbors in the space. This experiment is done by using Orange3 data mining to vectorize the bug-records into Bag of Words array and then get Distances between each other and then get nearest neighbors of a certain bug.