论文信息 - A Scale of Context Sensitive Languages: Applications to Natural Language

A Scale of Context Sensitive Languages: Applications to Natural Language

The classes of languages Ti are defined, i being a natural number, for which it is proved that Ti is a proper subset of T i+1, and a proper subset of context-sensitive languages, if Ti is the set of all context-free languages and Ti+1 is the set of all possible translations from Ti by means of a so-called linear deterministic pushdown store transducer; the formal mechanism is close enough to the so-called functional generative description, which has already been applied to large subsets of natural languages.

Martin Plátek | Petr Sgall

[1] P. Stanley Peters,et al. On Restricting the Base Component of Transformational Grammars , 1971, Inf. Control..

[2] D. G. Hays. Dependency Theory: A Formalism and Some Observations , 1964 .

[3] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .

[4] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[5] Petr Sgall,et al. A functional approach to syntax: in generative description of language , 1969, Mathematical linguistics and automatic language processing.

[6] Petr Sgall,et al. Topic and focus in transformational grammar , 1975 .

[7] Arnim von Stechow,et al. Functional generative grammar in Prague , 1974 .

[8] P. Sgall,et al. Topic, focus and generative semantics , 1973 .

[9] Maurice Gross,et al. On the Equivalence of Models of Language used in the Fields of Mechanical Translation and Information Retrieval , 1964, EARLYMT.