GBNP provides GAP algorithms for computing Gröbner bases of non-commutative polynomials with coefficients from a field implemented in GAP, and some variations, such as a weighted and truncated version and a tracing facility.

The word algorithm is interpreted loosely: in general one cannot expect such an algorithm to terminate, as it would imply solvability of the word problem for finitely presented (semi)groups.