Hi! I was wondering which parsing algorithm is currently used by the LKB. Is it a strict unification-based search, or does it use some version of Earley, or even Tomita's Algorithm? I'm sure that's documented somewhere, but I couldn't find it, so please excuse my laziness in simply asking. Thanks! Richard