lSearch power (almost the same?)
–full regular
expression power within nodes,
–Boolean expressions
over nodes
–Multiple
simultaneous inter-node constraints on one node
–Syntactic relations:
dominance, siblings, lin. Precedence
–Underspecification:
e.g. direct vs. indirect dominance
–POS & category
searches,
–Word searches
lOutput of searches can be formatted in various ways
lDetailed help and manuals
lFull Penn Treebank support
lWork on zipped files (saves space)
–
l