Feature Structure Formalisms: Mathematical And ComputationalFoundations For Linguistic Theory
{'Code': '05020400', 'Directorate': {'Abbreviation': 'CSE', 'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'Abbreviation': 'IIS', 'LongName': 'Div Of Information & Intelligent Systems'}}
{'SignBlockName': 'name not available', 'PO_EMAI': None, 'PO_PHON': None}
In the past several years, the mathematical objects known as               feature structures have been employed by numerous research                      traditions in theoretical and computational linguistics                         (collectively referred to as "unification-based grammar") for                   modeling a wide range of phenomena in the domain of natural                     language.  The principal investigator will explore the thesis that              the formalism of feature structures, appropriately extended, is                 capable of serving as the foundation for mathematically precise and             computationally tractable theories of natural language structure                that have determinate empirical consequences.  The researcher would             then apply such extensions to the formalization of explicit                     "principle-based" linguistic theories and to the construction of                practical NLP programs, focussing upon such centrally important                 linguistic phenomena as word order, binding, long-distance                      dependencies ("A-bar movement"), and discourse structure.                            Extensions to be investigated include, inter alia, the                     following:  (1) different varieties of negative constraints                     (classical negation, intuitionistic negation, and apartness);                   (2) different varieties of type regiments (via the logic, via                   structural constraints on graphs, via sorting of algebraic models)              and associated inheritance schemes (inclusion polymorphism);                    (3) realization of such notions as list value and set value                     (parametric polymorphism); (4) predicates other than equality (e.g.             inequality, append, subset, union) and "building-in" of equational              theories (generalized unification); (5) methods for introducing                 recursion; (6) infinitary methods (e.g. "functional uncertainty);               and (7) dynamic interpretation.
[{'FirstName': 'Carl', 'LastName': 'Pollard', 'PI_MID_INIT': 'J', 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Carl J Pollard', 'EmailAddress': 'pollard@ling.ohio-state.edu', 'NSF_ID': '000287662', 'StartDate': '01/01/1989', 'EndDate': None, 'RoleCode': 'Principal Investigator'}, {'FirstName': 'Michael', 'LastName': 'Moshier', 'PI_MID_INIT': 'A', 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Michael A Moshier', 'EmailAddress': 'moshier@chapman.edu', 'NSF_ID': '000445027', 'StartDate': '01/01/1989', 'EndDate': None, 'RoleCode': 'Co-Principal Investigator'}]
{'Name': 'Carnegie-Mellon University', 'CityName': 'PITTSBURGH', 'ZipCode': '152133815', 'PhoneNumber': '4122688746', 'StreetAddress': '5000 FORBES AVE', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'Pennsylvania', 'StateCode': 'PA', 'CONGRESSDISTRICT': '12', 'CONGRESS_DISTRICT_ORG': 'PA12', 'ORG_UEI_NUM': 'U3NKNFLNQ613', 'ORG_LGL_BUS_NAME': 'CARNEGIE MELLON UNIVERSITY', 'ORG_PRNT_UEI_NUM': 'U3NKNFLNQ613'}
{'Name': None, 'CityName': None, 'StateCode': None, 'ZipCode': None, 'StreetAddress': None, 'CountryCode': None, 'CountryName': None, 'StateName': None, 'CountryFlag': None, 'CONGRESSDISTRICT': None, 'CONGRESS_DISTRICT_PERF': '""'}
{'Code': '683500', 'Text': 'KNOWLEDGE & DATABASE SYSTEMS'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1988&All=true', 'xml': '8806913.xml'}