Premium
From functional specification to syntactic structures: systemic grammar and tree adjoining grammar
Author(s) -
Yang Gijoo,
McCoy Kathleen F.,
VijayShanker K.
Publication year - 1991
Publication title -
computational intelligence
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.353
H-Index - 52
eISSN - 1467-8640
pISSN - 0824-7935
DOI - 10.1111/j.1467-8640.1991.tb00395.x
Subject(s) - computer science , rule based machine translation , natural language processing , tree adjoining grammar , utterance , grammar , artificial intelligence , generative grammar , sentence , tree (set theory) , mildly context sensitive grammar formalism , regular tree grammar , generator (circuit theory) , systemic functional grammar , syntax , set (abstract data type) , linguistics , programming language , context free grammar , emergent grammar , mathematics , mathematical analysis , power (physics) , physics , quantum mechanics , philosophy
In this paper we provide an implementation strategy to map a functional specification of an utterance into a syntactically well‐formed sentence. We do this by integrating the functional and the syntactic perspectives on language, which we take to be exemplified by systemic grammars and tree adjoining grammars (TAGs) respectively. From systemic grammars we borrow the use of networks of choices to classify the set of possible constructions. The choices expressed in an input are mapped by our generator to a syntactic structure as defined by a TAG. We argue that the TAG structures can be appropriate structural units of realization in an implementation of a generator based on systemic grammar and also that a systemic grammar provides an effective means of deciding between various syntactic possibilities expressed in a TAG grammar. We have developed a generation strategy which takes advantage of what both paradigms offer to generation, without compromising either.