MDL-based DCG Induction for NP Identification

MDL-based DCG Induction for NP Identification Miles Osborne Alfa Informatica, University of Groningen, NL osborne@let.rug.nl Abstract We introduce a learner capable of automatically extend- ing large, manually written natural language Definite Clause Grammars with missing syntactic rules. It is based upon the Minimum Description Length princi- ple, and can be trained upon either just raw text, or else raw text additionally annotated with parsed cor- pora. As a demonstration of the learner, we show how full Noun Phrases (NPs that might contain pre or post- modifying phrases and might also be recursively nested) can be identified in raw text. Preliminary results ob- tained by varying the amount of syntactic information in the training set suggests that raw text is less useful than additional NP bracketing information. However, using all syntactic information in the training set does not produce a significant improvement over just brack- eting information. 1 Introduction Identification of Noun Phrases (NPs) in free text has been tackled in a number of ways (for example, [25, 9, 2]). Usually however, only relatively simple NPs, such as 'base' NPs (NPs that do not contain nested NPs or postmodifying clauses) are recovered. The motiva- tion for this decision seems to be pragmatic, driven in part by a lack of technology capable of parsing large quantities of free text. With the advent of broad cover- age grammars (for example [15] and attendant efficient parsers [11], however, we need not make this restriction: we now can identify 'full' NPs, NPs that might contain pre and/or post-modifying complements, in free text. Full NPs m'e more interesting than base NPs to esti- mate: • They are (at least) context free, unlike base NPs which are finite state. They can contain pre- and post-modifying phrases, and so proper identifica- tion can in the worst case imply full-scale pars- ing/grammar learning. • Recursive nesting of NPs means that each nominal head needs to be associated with each NP. Base NPs simply group all potential heads together in a flat structure. As a (partial) response to these challenges, we iden- tify full NPs by treating the task as a special case of full-scale sentential Definite Clause Grammar (DCG) learning. Our approach is based upon the Minimum Description Length (MDL) principle. Here, we do not explain MDL, but instead refer the reader to the liter- ature (for example, see [26, 27, 29, 12, 22]). Although a DCG learning approach to NP identification is far more computationally demanding than any other NP learning technique reported, it does provide a useful test-bed for exploring some of the (syntactic) factors involved with NP identification. By contrast, other ap- proaches at NP identification more usually only con- sider lexical/part-of-speech influences. In this paper, we consider, from an estimation per- spective, how dependent NPs are upon their (surround- ing) syntactic context. We varied the information con- tent of the training set and measured the effect this had upon NP identification accuracy. Results suggest that: • Use of any syntactic information, in addition" to raw …

Content truncated to 500 words