In this paper we introduce an example-based method for exploring dependency treebanks that is based on principles of vector symbolic architectures.It leverages key properties of this framework to provide fast and flexible search capabilities, since all combinations of query parameters can be compared with a given parse tree in parallel via a single vector operation.The framework also allows for graded similarity and the natural integration of various kinds of information, such as word embeddings.After some background on the framework and an explanation of our implementation, we provide a few examples of the system's output and draw comparisons to similar applications.