The following terms are used in the software itself and in its supplementing paperwork.
Feature. Unordered set of B-rep faces. This set does not have any intrinsic meaning. The meaning of a feature is entirely defined by its application.
Find vs Recognize. Finder algorithms only return the boundary elements which satisfy some searching criteria. In contrast, the recognizers enrich the corresponding persistent data structures (e.g., AAG) with the corresponding attributes.
Imperative plotter is an abstract canvas used to draw immediately the geometric primitives operated by an algorithm. The concept is pretty much the same as using "cout" stream in C++ to dump text. Here, graphical primitives are used instead of text characters.
RR-architecture. The Recognizer/Rule architecture of feature recognition.