Semantics for coordinated substitution grammars as implemented in Prolog

Larson, T J

Title: Semantics for coordinated substitution grammars as implemented in Prolog

Full Record
Other Related Research

Abstract

A solution is provided by the coordinate substitution grammars (CSubGs), a form of two-level grammar in which indices and their corresponding rules comprise a meta-level grammar used to instantiate rules in the base grammatical form. Through the use of these indices, all syntactic coordination can be concisely and descriptively represented in the grammar. It is demonstrate that the CSubGs can generate the recursively enumerable sets, although they can be constrained to generate only the context-free or indexed languages. A program was developed to translate the grammar rules into Prolog clauses, as is done with definite clause grammars. The remainder of the problem, determining how CSubGs and their indices can affect the natural-language semantics in a Prolog implementation, is investigated by studying grammars for various English-language constructs.

Authors:: Larson, T J

Publication Date:: Thu Jan 01 00:00:00 EST 1987

Research Org.:: Northwestern Univ., Evanston, IL (USA)

OSTI Identifier:: 6673900

Resource Type:: Thesis/Dissertation

Resource Relation:: Other Information: Thesis (Ph. D.)

Country of Publication:: United States

Language:: English

Subject:: 99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; NATURAL LANGUAGE; PROGRAMMING LANGUAGES; PROLOG; IMPLEMENTATION; COMPUTER CODES; DATA BASE MANAGEMENT; MANAGEMENT; 990300* - Information Handling; 990220 - Computers, Computerized Models, & Computer Programs- (1987-1989)

Citation Formats


                    Larson, T J. Semantics for coordinated substitution grammars as implemented in Prolog.  United States: N. p., 1987. 
        Web.

Copy to clipboard


                    Larson, T J. Semantics for coordinated substitution grammars as implemented in Prolog.  United States.

Copy to clipboard


                    Larson, T J. 1987.  
        "Semantics for coordinated substitution grammars as implemented in Prolog".  United States.

Copy to clipboard


                    
@article{osti_6673900,

  title        = {Semantics for coordinated substitution grammars as implemented in Prolog},

  author       = {Larson, T J},

  abstractNote = {A solution is provided by the coordinate substitution grammars (CSubGs), a form of two-level grammar in which indices and their corresponding rules comprise a meta-level grammar used to instantiate rules in the base grammatical form. Through the use of these indices, all syntactic coordination can be concisely and descriptively represented in the grammar. It is demonstrate that the CSubGs can generate the recursively enumerable sets, although they can be constrained to generate only the context-free or indexed languages. A program was developed to translate the grammar rules into Prolog clauses, as is done with definite clause grammars. The remainder of the problem, determining how CSubGs and their indices can affect the natural-language semantics in a Prolog implementation, is investigated by studying grammars for various English-language constructs.},

  doi          = {},

  url          = {https://www.osti.gov/biblio/6673900},
  journal      = {},
number       = ,

  volume       = ,

  place        = {United States},

  year         = {Thu Jan 01 00:00:00 EST 1987},

  month        = {Thu Jan 01 00:00:00 EST 1987}

}

Copy to clipboard

Thesis/Dissertation:

Other availability

Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this thesis or dissertation.

Save / Share:

Export Metadata

Save to My Library

Similar records in OSTI.GOV collections:

Prolog implementation of lexical functional grammar as a base for a natural language processing system

Book Frey, W; Reyle, U

The authors present a system which constructs a database out of a narrative natural language text. Firstly they give a detailed description of the PROLOG implementation of the parser which is based on the theory of lexical functional grammar (LFG). They show that PROLOG provides an efficient tool for LFG implementation. Secondly, they postulate some requirements a semantic representation has to fulfil in order to be able to analyse whole texts. They show how kamps theory meets these requirements by analysing sample discourses involving anaphoric nps. 4 references.
Compiling circular attribute grammars into Prolog

Journal Article Arbab, B - IBM J. Res. Dev.; (United States)

This paper describes an algorithm for compiling attribute grammars into Prolog. The attribute grammars may include inherited and synthesized attributes and contain recursive (circular) definitions. The semantics of the recursive definitions is defined in terms of a fixed-point finding function. The generated Prolog code stands in direct relation to its attribute grammar, where logical variables play the role of synthesized or inherited attributes. Thus an effective method for the execution of recursive attribute grammars has been defined and applied.
https://doi.org/10.1147/rd.303.0294
Relating sentences and semantic networks with procedural logic

Journal Article Simmons, R; Chester, D - Commun. ACM; (United States)

A system of symmetric clausal logic axioms is shown to transform a thirteen-sentence narrative about a v-2 rocket flight into semantic case relations. The same axioms translate the case relations into english sentences. An approach to defining schemas in clausal logic is presented and applied in the form of a mini-flight schema to two paragraphs of the text to compute a partitioning of the semantic network into the causal organization of a flight. Properties of rule symmetry and network condensibility are noted to be of importance for natural language processing. Because of the conciseness of the logic interpreter and themore »« less
https://doi.org/10.1145/358589.358602
Two-level grammar: an implementable metalanguage for consistent and complementary language specifications

Thesis/Dissertation Edupuganty, B

This work introduces two-level grammar (TLG) as a programming language from giving consistent and complementary definitions of programming languages in an implementable manner. It is shown that TLG is a functional programming language. Advantages of using the TLG as a programming language are readability and strong typing of function domains. To execute TLG specifications directly, algorithms for sequential and data flow models of interpretation of TLG's are given. TLG allows the closest to programming in natural language the author has seen,and hence TLG programs are self-documenting. With the above advantages, TLG is an elegant executable metalanguage. To demonstrate the capabilitymore »« less
Generalized augmented transition network grammars for generation from semantic networks

Journal Article Shapiro, S - Am. J. Comput. Ling.; (United States)

The augmented transition network (ATN) is a formalism for writing parsing grammars which has been much used in artificial intelligence and computational linguistics. A few researchers have also used ATNs for writing grammars for generating sentences. Previously, however, either generation ATNs did not have the same semantics as parsing ATNs, or they required an auxiliary mechanism to determine the syntactic structure of the sentence to be generated. This paper reports a generalization of the ATN formalism which allows ATN grammars to be written to parse labelled directed graphs. Specifically, an ATN grammar can be written to parse a semantic networkmore »« less

Similar Records