Parallel Processing

In terms of both speed and mem- ory consumption, graph unification remains the most expensive com- ponent of unification-based gram- mar parsing. We present a tech- nique to reduce the …...

We present an incremental dependency parser which derives predictions about the upcoming structure in a parse-as-you- type mode. Drawing on the inherent strong anytime property of the underlying transformation-based approach, …...