Formal languages
Marcus contextual grammars: modularity and leftmost derivation
Mathematical aspects of natural and formal languages
Contextual grammars and natural languages
Handbook of formal languages, vol. 2
On computational complexity of contextual languages
Theoretical Computer Science - Special issue: formal language theory
Natural computation for natural language
Fundamenta Informaticae
On representing recursively enumerable languages by internal contextual languages
Theoretical Computer Science
Indexed Grammars—An Extension of Context-Free Grammars
Journal of the ACM (JACM)
Programmed Grammars and Classes of Formal Languages
Journal of the ACM (JACM)
On the nonexistence of a phrase structure grammar for ALGOL 60
Communications of the ACM
Marcus Contextual Grammars
Handbook of Formal Languages
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Mathematical Theory of L Systems
Mathematical Theory of L Systems
Introduction to Formal Language Theory
Introduction to Formal Language Theory
On two recent attempts to show that English is not a CFL
Computational Linguistics - Special issue on mathematical properties of grammatical formalisms
Sorted dependency insertion grammars
Theoretical Computer Science - Algebraic methods in language processing
On Total Contextual Grammars with Restricted Choice
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Complete Testing from a Stream X-Machine Specification
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Iterative Learning of Simple External Contextual Languages
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Adaptable Grammars for Non-Context-Free Languages
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
On Insertion Grammars with Maximum Parallel Derivation
Fundamenta Informaticae
On the Relative Expressive Power of Contextual Grammars with Maximal and Depth-First Derivations
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Automatic generation of computeranimation: using AI for movie animation
Automatic generation of computeranimation: using AI for movie animation
An efficient online parser for contextual grammars with at most context-free selectors
CICLing'03 Proceedings of the 4th international conference on Computational linguistics and intelligent text processing
Iterative learning of simple external contextual languages
Theoretical Computer Science
Trees as contexts in formal language generation
FinTAL'06 Proceedings of the 5th international conference on Advances in Natural Language Processing
Contextual hypergraph grammars – a new approach to the generation of hypergraph languages
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
On Insertion Grammars with Maximum Parallel Derivation
Fundamenta Informaticae
On Total Contextual Grammars with Restricted Choice
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Complete Testing from a Stream X-Machine Specification
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Hi-index | 0.00 |
The paper discusses some classes of contextual grammars---mainly those with "maximal use of selectors"---giving some arguments that these grammars can be considered a good model for natural language syntax.A contextual grammar produces a language starting from a finite set of words and interatively adding contexts to the currently generated words, according to a selection procedure: each context has associated with it a selector, a set of words; the context is adjoined to any occurrence of such a selector in the word to be derived. In grammars with maximal use of selectors, a context is adjoined only to selectros for which no superword is a selector. Maximality can be defined either locally or globally (with respect to all selectors in the grammar). The obtained families of languages are incomparable with that of Chomsky context-free languages (and with other families of languages that contain linear languages and that are not "too large"; see Section 5) and have a series of properties supporting the assertion that these grammars are a possible adequate model for the syntax of natural languages. They are able to straightforwardly describe all the usual restrictions appearing in natural (and artificial) languages, which lead to the non-context-freeness of these languages: reduplication, crossed dependencies, and multiple agreements; however, there are center-embedded constructions that cannot be covered by these grammars.While these assertions concern only the weak generative capacity of contextual grammars, some ideas are also proposed for associating a structure to the generated words, in the form of a tree, or of a dependence relation (as considered in descrpitive linguistics and also similar to that in link grammars).