Results 241 to 250 of about 83,145 (295)
Iconicity and generative grammar [PDF]
Language, 1992 A theme running through much of the functionalist literature in linguistics is that grammatical structure, to a considerable degree, has an 'iconic' motivation. This theme can be distilled into three rather distinct claims: (1) iconic principles govern speakers' choices of structurally available options in discourse; (2) structural options that reflect
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
General formulation of formal grammars
Information Sciences, 1972Abstract By extracting the basic properties common to the formal grammars appeared in existing literatures, we develop a general formulation of formal grammars. We define a pseudo grammar and derive from it the well-known probabilistic, fuzzy grammars and so on.
Masaharu Mizumoto +2 more
openaire +2 more sources
On Generalization of Attribute Grammars
Systems and Computers in Japan, 1996AbstractAn attribute grammar is a formal system consisting of a context‐free grammar together with semantic rules, which enables us to describe not only the syntax but also the semantics of language. The limited framework of attribute grammar, however, is not conducive to expansion of the system and the many ambiguous definitions of attribute grammar ...
Takuya Katayama, Yutaka Kikuchi
openaire +2 more sources
Is there a general structure for grammars?
2009 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, 2009Summary form only given. Linguists have proposed dozens of formalisms for grammars and now vision is weighing in with its versions based on its needs. Ulf Grenander has proposed general pattern theory, and has used grammar-like graphical parses of "thoughts" in the style of AI. One wants a natural, simple formalism treating all these cases.
openaire +2 more sources
COORDINATE GRAMMARS REVISITED: GENERALIZED ISOMETRIC GRAMMARS
International Journal of Pattern Recognition and Artificial Intelligence, 1989In a "coordinate grammar", the rewriting rules replace sets of symbols having been given coordinates by sets of symbols whose coordinates are given functions of the coordinates of the original symbols. It was shown in 1972 that coordinate grammars are "too powerful"; even if the rules are all of finite-state types and the functions are all computable ...
openaire +2 more sources
2018
In the earliest stages of transformational-generative grammar, there was no lexicon and the rewrite rules and transformations aimed to generate the correct sequence of morphemes of a sentence. The introduction of the lexicon was based on empirical considerations, but not in the domain of morphology. Chomsky’s Lexicalist Hypothesis places word formation
openaire +2 more sources
In the earliest stages of transformational-generative grammar, there was no lexicon and the rewrite rules and transformations aimed to generate the correct sequence of morphemes of a sentence. The introduction of the lexicon was based on empirical considerations, but not in the domain of morphology. Chomsky’s Lexicalist Hypothesis places word formation
openaire +2 more sources
Analysis and generation grammars
Machine Translation, 1989This paper describes the analysis and generation grammars for English and Japanese as they were employed in the KBMT-89 program. We discuss word order, coordination, subcategorization, morphological rules, rule ordering and bi-directional grammars.
Marion Kee +4 more
openaire +2 more sources
1990
An outline of the origins and the development of generative studies in Italy since the early 1960s until the end of the 1970s.
openaire +2 more sources
An outline of the origins and the development of generative studies in Italy since the early 1960s until the end of the 1970s.
openaire +2 more sources
Generalized forbidding grammars
International Journal of Computer Mathematics, 1990Each production of a generalized forbidding grammar has an associated finite set of words. Such a production can be applied only if none of its associated words is a substring of a given rewritten sentential form. It is shown that these grammars with productions having associated only words consisting of one or two symbols characterize type 0 ...
openaire +2 more sources