An Earley-type recognizer for dependency grammar

The paper is a first attempt to fill a gap in the dependency literature, by providing a mathematical result on the complexity of recognition with a dependency grammar. The paper describes an improved Earley-type recognizer with a complexity O(IGl2n3). The improvement is due to a precompilation of the dependency rules into parse tables, that determine the conditions of applicability of two primary actions, predict and scan, used in recognition.

• Type: Conference
• Year: 1996
• Where: COLING
• Authors: Vincenzo Lombardo, Leonardo Lesmo
• Keywords: COLING 1996, COLING 2008, Dependency Grammar, Dependency Literature, Improved Earley-type Recognizer