The result as a family of grammars that encoded bundles of syntactic information (eg [category: noun; person: third; definite: positive]) rather than single, atomic categories (eg noun, verb). These grammars could give far more discriminating analyses of sentences, but there were some prices to pay. The main point is that bundles of features need far more complicated methods of matching in search algorithms, and it is from this that these grammars get their family name of Unification Grammar. The matching of bundles of features can be achieved by the use of unification.
There are several grammars that can use unification as their main information combining operation. Of these, Generalised Phrase Structure Grammar (GPSG) was at one time very popular, but Lexical Functional Grammar (LFG) is probably the most widely used of these formalisms.