The head words can be automatically extracted using a heuristic table lookup in the manner described by Magerman ( 1994 ) .
natural language parsing as statistical pattern recognition
David Magerman
For example , ( wrote a book in three days , attach-verb ) would be annotated as ( wrote , book , in , days , verb ) . The head words can be automatically extracted using a heuristic table lookup in the manner described by Magerman ( 1994 ) . For this learning problem , the supervision is the one-bit information of whether p should attach to v or to n .
The head words can be automatically extracted using a heuristic table lookup in the manner described by @@CITATION .