Extending Definite Clause Grammars with Scoping Constructs Remo Pareschi ECRC Arabellastrasse D Munich West Germany de

Remo Pareschi

Description

Niveau: Supérieur
Extending Definite Clause Grammars with Scoping Constructs Remo Pareschi ECRC, Arabellastrasse 17 D-8000 Munich 81, West Germany Dale Miller Computer and Information Science University of Pennsylvania Philadelphia, PA 19104–6389 USA Abstract Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs in Horn clauses. Some linguistic phe- nomena, such as filler-gap dependencies, are difficult to account for in a completely satisfactory way using simple phrase structured grammar. In the literature of logic grammars there have been several attempts to tackle this problem by making use of special arguments added to the DCG pred- icates corresponding to the grammatical symbols. In this paper we take a different line, in that we account for filler-gap dependencies by encoding DCGs within hereditary Harrop formulas, an extension of Horn clauses (pro- posed elsewhere as a foundation for logic programming) where implicational goals and universally quantified goals are permitted. Under this approach, filler-gap dependencies can be accounted for in terms of the operational se- mantics underlying hereditary Harrop formulas, in a way reminiscent of the treatment of such phenomena in Generalized Phrase Structure Grammar (GPSG). The main features involved in this new formulation of DCGs are mechanisms for providing scope to constants and program clauses along with a mild use of ?-terms and ?-conversion.

• higher-order extension


• dependencies can


• order unification


• logic grammars


• goal


• over ?


• free variable


• harrop


• hereditary harrop


• horn clause

Sujets

• Free variables and bound variables
• Horn clause

Informations

• Publié par: chaeh
• Nombre de lectures: 10
• Langue: English

Extrait

Extending DefiniteClauseGrammars withScopingConstructs RemoPareschi ECRC,Arabellastrasse17 D-8000Munich81,WestGermany [e-mail] DaleMiller ComputerandInformationScience UniversityofPennsylvania Philadelphia,PA19104–6389USA [e-mail] Abstract DefiniteClauseGrammars(DCGs)haveprovedvaluabletocomputational linguistssincetheycanbeusedtospecifyphrasestructuredgrammars.It iswellknownhowtoencodeDCGsinHornclauses.Somelinguisticphe- nomena,suchasfiller-gapdependencies,aredifficulttoaccountforina completelysatisfactorywayusingsimplephrasestructuredgrammar.In theliteratureoflogicgrammarstherehavebeenseveralattemptstotackle thisproblembymakinguseofspecialargumentsaddedtotheDCGpred- icatescorrespondingtothegrammaticalsymbols.Inthispaperwetake adifferentline,inthatweaccountforfiller-gapdependenciesbyencoding DCGswithinhereditaryHarropformulas,anextensionofHornclauses(pro- posedelsewhereasafoundationforlogicprogramming)whereimplicational goalsanduniversallyquantifiedgoalsarepermitted.Underthisapproach, filler-gapdependenciescanbeaccountedforintermsoftheoperationalse- manticsunderlyinghereditaryHarropformulas,inawayreminiscentofthe treatmentofsuchphenomenainGeneralizedPhraseStructureGrammar (GPSG).ThemainfeaturesinvolvedinthisnewformulationofDCGsare mechanismsforprovidingscopetoconstantsandprogramclausesalongwith amilduseofλ-termsandλ-conversion. 1Introduction Logicprogrammingandnaturallanguageprocessinghaveinthepastbeen fruitfullyindebtedtoeachother.Indeed,Prologwasbornintheearly seventiesasaresultofAlainColmerauer’seffortstocreateaprogramming environmentsuitablebothfornaturallanguageprocessinganddeductive question-answering.IntheearlyeightiesPereiraandWarren[26]gavea 1