|Dependency Syntax Analysis Using Grammar Induction and a Lexical Categories Precedence System
|Year of Publication
|Calvo H, Gambino O, Gelbukh A, Inui K
|Computational Linguistics and Intelligent Text Processing
|Lecture Notes in Computer Science
|Berlin / Heidelberg
The unsupervised approach for syntactic analysis tries to discover the structure of the text using only raw text. In this paper we explore this approach using Grammar Inference Algorithms. Despite of still having room for improvement, our approach tries to minimize the effect of the current limitations of some grammar inductors by adding morphological information before the grammar induction process, and a novel system for converting a shallow parse to dependencies, which reconstructs information about inductor’s undiscovered heads by means of a lexical categories precedence system. The performance of our parser, which needs no syntactic tagged resources or rules, trained with a small corpus, is 10% below to that of commercial semi-supervised dependency analyzers for Spanish, and comparable to the state of the art for English.