Matched terms is an automatic function in CodeFinder. The program does automatic matrix determination by matching all terms searches to the first term in the list, called the main term. Previously, you had to open the tree of results and count the number of matches to conclude which were the best matrices for further inspection.
Now the program shows the number of matched terms in brackets in the search results list. You can just scroll through 1000 finds of the main term and look for the 5-10 best, which have the greatest number of matches. In a couple of minutes, you are clued into the best possibilities. Then display the matrix for each, and examine them for your word pairs that are close together or crossing. That gives you the best matrix. This function shaves hours of work from the codes research process.
The number of matches is shown in brackets. Just expand the width of the window and scroll through looking for the highest number of matches.