<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="tabory-1963-specifications">
    <titleInfo>
        <title>Specifications for generative grammars used in language data processing</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Robert</namePart>
        <namePart type="family">Tabory</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>1963-25-26 aug</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the Annual meeting of the Association for Machine Translation and Computational Linguistics</title>
        </titleInfo>
        <originInfo>
            <place>
                <placeTerm type="text">Denver, Colorado</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>It becomes more and more evident that successful pragmatics (i.e. automatic recognition and production procedures for sentences) cannot be performed without previously written generative grammars for the languages involved, using an underlying meta-theoretical framework proposed by the present school of mathematical linguistics. Two aspects of grammar writing are examined: 1. A taxonomy over the non-terminal vocabulary, using a subscripting system for signs and fitting into the more general string taxonomy of phrase structure components. The resulting more complex lexical organization is studied. 2. A command syntax for phrase structure components limiting the full, not necessarily needed generative power of these grammars. The proposed restrictions correspond to a priori linguistic intuition. Applicational order and location of the rules is studied. Finally, the recognitional power and generative capacity of a computer are examined, the machine being structured according to a Newell-Shaw-Simon list system. It is well known that pushdown stores are particular cases of list structures, that context-free grammars are particular cases of phrase structure grammars and that pushdown stores are the generative devices for context-free grammars.</abstract>
    <identifier type="citekey">tabory-1963-specifications</identifier>
    <location>
        <url>https://aclanthology.org/1963.earlymt-1.31</url>
    </location>
    <part>
        <date>1963-25-26 aug</date>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Specifications for generative grammars used in language data processing
%A Tabory, Robert
%S Proceedings of the Annual meeting of the Association for Machine Translation and Computational Linguistics
%D 1963
%8 25 26 aug
%C Denver, Colorado
%F tabory-1963-specifications
%X It becomes more and more evident that successful pragmatics (i.e. automatic recognition and production procedures for sentences) cannot be performed without previously written generative grammars for the languages involved, using an underlying meta-theoretical framework proposed by the present school of mathematical linguistics. Two aspects of grammar writing are examined: 1. A taxonomy over the non-terminal vocabulary, using a subscripting system for signs and fitting into the more general string taxonomy of phrase structure components. The resulting more complex lexical organization is studied. 2. A command syntax for phrase structure components limiting the full, not necessarily needed generative power of these grammars. The proposed restrictions correspond to a priori linguistic intuition. Applicational order and location of the rules is studied. Finally, the recognitional power and generative capacity of a computer are examined, the machine being structured according to a Newell-Shaw-Simon list system. It is well known that pushdown stores are particular cases of list structures, that context-free grammars are particular cases of phrase structure grammars and that pushdown stores are the generative devices for context-free grammars.
%U https://aclanthology.org/1963.earlymt-1.31

Markdown (Informal)

[Specifications for generative grammars used in language data processing](https://aclanthology.org/1963.earlymt-1.31) (Tabory, EarlyMT 1963)

• Specifications for generative grammars used in language data processing (Tabory, EarlyMT 1963)

ACL

• Robert Tabory. 1963. Specifications for generative grammars used in language data processing. In Proceedings of the Annual meeting of the Association for Machine Translation and Computational Linguistics, Denver, Colorado.