Extending definite clause grammars with scoping constructs

摘要: Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used specify phrase structured grammars. It is well known how encode DCGs in Horn clauses. Some linguistic phenomena, such as filler-gap dependencies, are difficult account for a completely satisfactory way using simple grammar. In the literature of logic grammars there been several attempts tackle this problem by making use special arguments added DCG predicates corresponding grammatical symbols. paper we take different line, that dependencies encoding within hereditary Harrop formulas, an extension clauses (proposed elsewhere foundation programming) where implicational goals and universally quantified permitted. Under approach, accounted terms operational semantics underlying reminiscent treatment phenomena Generalized Phrase Structure Grammar (GPSG). The main features involved new formulation mechanisms providing scope constants program along with mild λ-terms λ-conversion. Comments University Pennsylvania Department Computer Information Science Technical Report No. MSCIS-90-20. This technical report available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/519 Extending With Scoping Constructs MS-CIS-90-20 LINC LAB 167 Remo Pareschi Dale Miller Informat ion School Engineering Applied Philadelphia, PA 19104-6389