There is a newer version of the record available.

Published December 7, 2021 | Version 1.4.1
Software Open

graphANNIS

  • 1. Humboldt-Universität zu Berlin

Description

Fixed
  • Avoid unnecessary memory allocation when checking if a node has outgoing edges in adjacency lists. This improves search for tokens because the Coverage components are typically adjacency lists, and we need to make sure the token nodes don't have any outgoing edges.
  • Fixed miscalculation of whitespace string capacity which could lead to memory allocation failed error.

Notes

If you use this software, please cite it as below.

Files

korpling/graphANNIS-v1.4.1.zip

Files (2.8 MB)

Name Size Download all
md5:2076baae9ed3f6bf53a7da64bc7b573f
2.8 MB Preview Download

Additional details

Related works