Replies: 1 comment 1 reply
-
Finding and filtering token can take some time because several conditions must be true ('annis:tok' label, no outgoing coverage edges). For this specific query graphANNIS already triggers an optimization that generates candidates for the source node by getting all nodes from the "dep" component (indicated by the
Thus a label on the source node would probably not help that much, because there would be almost as many nodes with this label as nodes in the "dep" component. I checked if the implementation of the graph storage for the dependency component is already optimal and found an interesting part of the statistic:
The maximal path length |
Beta Was this translation helpful? Give feedback.
-
If I have to search for all tokens with a syntactic label such as "AuxC", is the query
tok ->dep[dep_fnc="AuxC"] tok
the only possible one? It works, but it seems that there is overhead due to the nature of the query. Should one maybe consider modeling those syntactic labels also as<feat>
?Beta Was this translation helpful? Give feedback.
All reactions