J08-1003 software transforms the output of the f-structure annotation algorithm into the multi-word
J08-1003 Bank . Multi-Word Expressions The f-structure annotation algorithm analyzes the internal
J05-3003 with which they co-occur . The f-structure annotation algorithm was extended with only
J05-3003 first ensure the quality of the f-structure annotations . The results of two different
J08-1003 parsers in the pipeline parsing and f-structure annotation architecture . The f-structures
J08-1003 using sophisticated automatic LFG f-structure annotation methodologies with surprising
J08-1003 the Penn-II Treebank with our f-structure annotation algorithm . We then evaluate
C96-1032 annotations similar to the usual f-structure annotations . 7 Statements about " mor -
J08-1003 constructions such as Figure 2 , the f-structure annotation algorithm analyzes say as the
J08-1003 is Bikel + Tags . The automatic f-structure annotation algorithm will exploit Penn-II
J08-1003 that , once again , the automatic f-structure annotation algorithm is not able to identify
J08-1003 developed to evaluate the automatic f-structure annotation algorithm . We parse the 105
J08-1003 labels and these are used by the f-structure annotation algorithm . We evaluate the f-structure
J05-3003 the traces in terms of index = i f-structure annotations ( Figure 3 ) . Passive movement
J05-3003 lexical-functional grammar ( LFG ) f-structure annotation algorithm for the Penn-II and
J08-1003 , we outline the automatic LFG f-structure annotation algorithm and the pipeline parsing
J08-1003 regard as to whether or not the f-structure annotation algorithm could ever generate
J08-1003 This is because the automatic f-structure annotation algorithm is cautious to the
J08-1003 parsers ( Collins 1999 ) as the f-structure annotation algorithm is designed for Penn-II
J08-1003 information for the automatic f-structure annotation algorithm ( Section 2.2 ) . These
hide detail