Увійти

Готові списки джерел за темами / Grammar / Статті в журналах

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Grammar.

Статті в журналах з теми "Grammar"

Автор: Grafiati

Опубліковано: 4 червня 2021

Оновлено: 25 липня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Grammar".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.

1

মিস্ত্রী, প্রমথ. "সংস্কৃত ব্যাকরণে পাণিনীয় সংস্করণ". Arts Faculty Journal 13, № 18 (2024): 43–62. http://dx.doi.org/10.62296/kop20241318004.

Повний текст джерела

Анотація:

The structure of every language on grammar. For this, grammer is called the constitution of language. While the constitution contains the laws and regulations of a country, the grammar contains the laws and regulations of the language. Grammer identifies the rules of varios elements of language (sandhi, prefixes, suffixes, case, samās etc). The Paninian version of Sanskrit grammar has the same function. Here Panini has simultaneously highlighted the constitution and the grammar both of the Vedic and Sanskrit languages. Our topic is the Paninian version of Sanskrit grammar. However, from this e

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Nitay, Dolav, Dana Fisman, and Michal Ziv-Ukelson. "Learning of Structurally Unambiguous Probabilistic Grammars." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 10 (2021): 9170–78. http://dx.doi.org/10.1609/aaai.v35i10.17107.

Повний текст джерела

Анотація:

The problem of identifying a probabilistic context free grammar has two aspects: the first is determining the grammar's topology (the rules of the grammar) and the second is estimating probabilistic weights for each rule. Given the hardness results for learning context-free grammars in general, and probabilistic grammars in particular, most of the literature has concentrated on the second problem. In this work we address the first problem. We restrict attention to structurally unambiguous weighted context-free grammars (SUWCFG) and provide a query learning algorithm for strucuturally unambiguo

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Hartwell, Patrick. "Grammar, Grammars, and the Teaching of Grammar." College English 47, no. 2 (1985): 105. http://dx.doi.org/10.2307/376562.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Hartwell, Patrick. "Grammar, Grammars, and the Teaching of Grammar." College English 47, no. 2 (1985): 105–27. http://dx.doi.org/10.58680/ce198513293.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Koupil, Ondřej. "Jungmann a čeští gramatici." Acta Musei Nationalis Pragae – Historia litterarum 69, no. 1-2 (2024): 5–18. http://dx.doi.org/10.37520/amnpsc.2024.002.

Повний текст джерела

Анотація:

The study deals with Josef Jungmannʼs relation to grammar. Part I shows that Jungmann switched from the term mluvník, the purist equivalent of the Latin word grammatica (‘grammarʼ), to the term mluvnice, which had been mainly promoted by Václav Hanka. Part II examines the inspirational sources of Jungmannʼs views on the Czech language (Kopitar, Jahn) and shows that Jungmann changed from a reformer of Czech orthography into an authority opposing changes in Czech orthography. He focused on lexicography and fully recognised the authority of Josef Dobrovský in the field of Czech grammar. Part III

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Rice, Keren. "A typology of good grammars." Perspectives on Grammar Writing 30, no. 2 (2006): 385–415. http://dx.doi.org/10.1075/sl.30.2.10ric.

Повний текст джерела

Анотація:

Writing a grammar is an exhilarating and exhausting experience. All grammars must meet high expectations. This paper reports on a study of qualities sought in grammars based on a survey of reviews of grammars. The study reveals that linguists expect a grammar to be comprehensive, clear, and accessible to all. It should also contain careful argumentation and a wealth of data that is appropriate, authentic, and meticulously checked. Writers of grammars must ask themselves a variety of questions before they begin, including what the goal of the grammar is, who the audience for the grammar is, how

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Li and, Xin, Linda C. Schmidt, Weidong He,, Lixing Li, and, and Yuanmei Qian. "Transformation of an EGT Grammar: New Grammar, New Designs." Journal of Mechanical Design 126, no. 4 (2004): 753–56. http://dx.doi.org/10.1115/1.1758256.

Повний текст джерела

Анотація:

True design with grammars lies in the creation of the grammar rules, not in the application of the rules to generate design alternatives. Existing grammars can be modified to describe new languages of designs [1–4]. Studying an epicyclic gear train graph grammar leads to purposeful relaxation of grammar rules and subsequent discovery of new designs. A revised new EGT grammar is presented, which is designed to generate a wider selection of valid EGTs.

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Kolln, Martha. "A Comment on "Grammar, Grammars, and the Teaching of Grammar"." College English 47, no. 8 (1985): 874. http://dx.doi.org/10.2307/376626.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Williams, Joe, Richard D. Cureton, Carole Moses, and Edward A. Vavra. "Four Comments on "Grammar, Grammars, and the Teaching of Grammar"." College English 47, no. 6 (1985): 641. http://dx.doi.org/10.2307/377166.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Huckin, Thomas N. "A Comment on "Grammar, Grammars, and the Teaching of Grammar"." College English 48, no. 4 (1986): 397. http://dx.doi.org/10.2307/377267.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Ozaki, Satoru. "A phonotactic-tonotactic grammar for Tokyo Japanese that clusters by lexical strata offers a good trade-off between model size and likelihood." Proceedings of the Linguistic Society of America 9, no. 1 (2024): 5725. http://dx.doi.org/10.3765/plsa.v9i1.5725.

Повний текст джерела

Анотація:

The Japanese lexicon is typically classified into at least three etymological strata: native, Sino-Japanese and foreign words. In Tokyo Japanese, nouns from different strata are known to have different phonotactic as well as tonotactic properties. Should one analyze Tokyo Japanese nouns using a non-clustering grammar that generates all nouns using the same phonological grammar, or should one analyze them using a clustering grammar that generates nouns from different strata using different grammars? In this study, I address this question from a probabilistic and a model selection perspective: t

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Ham, Sanda. "Croatian Shtokavian grammar books." St open 1 (2020): 1–21. http://dx.doi.org/10.48188/so.1.10.

Повний текст джерела

Анотація:

This paper describes the criteria for the systematic periodization of Croatian grammar books. These criteria are exclusively linguistic and take into account the phonological and morphological structure described in these grammar books; where the grammar books contain a dictionary, the lexical organization has been taken into consideration as well. Based on these criteria, all Croatian grammar books may be systematized into four periods: I. 1604 – 1836 (old Croatian grammars), II. 1836 – 1899 (Croatian grammars from the Illyrian Movement to the end of the 19th century, with two parallel subgro

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Andersen, Vibeke. "Nye tiltag i grammatikundervisningen." HERMES - Journal of Language and Communication in Business 15, no. 29 (2017): 187. http://dx.doi.org/10.7146/hjlcb.v15i29.25703.

Повний текст джерела

Анотація:

The author discusses the disadvantages of traditional grammar teaching from a didactic and learning perspective. Traditional grammar teaching is typically based on a theoretical introduction by means of system-orientated grammars, followed by product-orientated training. Due to the disadvantages of traditional grammar teaching, the author suggests replacing system-orientated grammars with holistic grammars and product-orientated training with comprehension-orientated training. A holistic grammar integrates systemic and pragmatic linguistic description with a view to making grammar relevant and

Стилі APA, Harvard, Vancouver, ISO та ін.

14

KUKLUK, JACEK P., LAWRENCE B. HOLDER, and DIANE J. COOK. "INFERENCE OF EDGE REPLACEMENT GRAPH GRAMMARS." International Journal on Artificial Intelligence Tools 17, no. 03 (2008): 539–54. http://dx.doi.org/10.1142/s0218213008004047.

Повний текст джерела

Анотація:

We describe an algorithm and experiments for inference of edge replacement graph grammars. This method generates candidate recursive graph grammar productions based on isomorphic subgraphs which overlap by two nodes. If there is no edge between the two overlapping nodes, the method generates a recursive graph grammar production with a virtual edge. We guide the search for the graph grammar based on the size of the grammar and the portion of the graph described by the grammar. We show experiments where we generate graphs from known graph grammars, use our method to infer the grammar from the ge

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Fong, Wan Heng, Aqilahfarhana Abdul Rahman, Nor Haniza Sarmin, and Sherzod Turaev. "Static Watson-Crick Context-Free Grammars." International Journal of Online and Biomedical Engineering (iJOE) 15, no. 10 (2019): 65. http://dx.doi.org/10.3991/ijoe.v15i10.10878.

Повний текст джерела

Анотація:

Sticker systems and Watson-Crick automata are two modellings of DNA molecules in DNA computing. A sticker system is a computational model which is coded with single and double-stranded DNA molecules; while Watson-Crick automata is the automata counterpart of sticker system which represents the biological properties of DNA. Both of these models use the feature of Watson-Crick complementarity in DNA computing. Previously, the grammar counterpart of the Watson-Crick automata have been introduced, known as Watson-Crick grammars which are classified into three classes: Watson-Crick regular grammars

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Reichardt, Johannes. "Deterministic grammars and grammar morphisms." Acta Informatica 23, no. 5 (1986): 567–83. http://dx.doi.org/10.1007/bf00288470.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Siouffi, Gilles. "Grammaire françoise. French Grammar." French Studies 69, no. 4 (2015): 576. http://dx.doi.org/10.1093/fs/knv183.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

18

LAROCHE, P., M. NIVAT, and A. SAOUDI. "CONTEXT-SENSITIVITY OF PUZZLE GRAMMARS." International Journal of Pattern Recognition and Artificial Intelligence 08, no. 02 (1994): 525–42. http://dx.doi.org/10.1142/s0218001494000279.

Повний текст джерела

Анотація:

We study some properties of array grammars, called puzzle grammars, introduced in Ref. 7. We give a new method, using puzzle grammar, for generating the set of rectangles. We prove that the emptiness problem for puzzle grammar is undecidable. We show that the non-overlapping problem for puzzle grammar is decidable.

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Abdul Rahman, Aqilahfarhana, Wan Heng Fong, Nor Haniza Sarmin, Sherzod Turaev, and Nurul Liyana Mohamad Zulkufli. "Static Watson-Crick regular grammar." Malaysian Journal of Fundamental and Applied Sciences 14 (October 25, 2018): 457–62. http://dx.doi.org/10.11113/mjfas.v14n0.1282.

Повний текст джерела

Анотація:

DNA computing, or more generally, molecular computing, is a recent development at the interface of computer science and molecular biology. In DNA computing, many computational models have been proposed in the framework of formal language theory and automata such as Watson-Crick grammars and sticker systems. A Watson-Crick grammar is a grammar model that generates double stranded strings, whereas a sticker system is a DNA computing model of the ligation and annealing operations over DNA strands using the Watson-Crick complementarity to form a complete double stranded DNA sequence. Most of the p

Стилі APA, Harvard, Vancouver, ISO та ін.

20

LEE, EDWARD T., SHANG-YONG ZHU, and PENG-CHING CHU. "GENERATING RECTANGLES USING TWO-DIMENSIONAL GRAMMARS WITH TIME AND SPACE COMPLEXITY ANALYSES." International Journal of Pattern Recognition and Artificial Intelligence 03, no. 03n04 (1989): 321–32. http://dx.doi.org/10.1142/s0218001489000267.

Повний текст джерела

Анотація:

A two-dimensional grammar for generating all possible rectangles is presented and illustrated by examples. The time and space complexity analyses of this grammar together with a parallel context-free array grammar and a free grammar are also presented. Generating pictures using two-dimensional grammars appear to be a fertile field for further study. The study of two-dimensional grammars has useful applications in region filling. pattern recognition. robotics, pictorial information system design and related areas.

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Handzhiyski, Nikolay, and Elena Somova. "Tunnel Parsing with Ambiguous Grammars." Cybernetics and Information Technologies 23, no. 2 (2023): 34–53. http://dx.doi.org/10.2478/cait-2023-0012.

Повний текст джерела

Анотація:

Abstract The article proposes an addition to the tunnel parsing algorithm that enables it to parse grammars having countable repetitions and configurations of grammar elements generating empty words without refactoring the grammar. The equivalency of trees built by the use of ambiguous grammar is discussed. The class of the ε-ambiguous grammars is defined as a subclass of the ambiguous grammars relative to these trees. The ε-deterministic grammars are then defined as a subclass of the ε-ambiguous grammars. A technique for linearly parsing on the basis of non-left recursive ε-deterministic gram

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Smolej, Mojca. "Forgotten Memory of Numerous Synchronous Grammar Editions?" Ars & Humanitas 13, no. 1 (2019): 97–110. http://dx.doi.org/10.4312/ars.13.1.97-110.

Повний текст джерела

Анотація:

The contribution focuses on the historical overview of the publication of Slovenian grammars and on the emergence of the “one-grammar” state of affairs in grammatography. The turning point in writing and publishing grammar books is 1854. It was then that Anton Janežič’s Slovenska slovnica s kratkim pregledom slovenskega slovstva ter z malim cirilskim in glagoliškim berilom za Slovence was published and introduced to grammar writing, at least on the level of grammatography, the concept of monopoly and with it the primacy of the one and only grammar. Janežič’s grammar maintained its influence un

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Smolej, Mojca. "Forgotten Memory of Numerous Synchronous Grammar Editions?" Ars & Humanitas 13, no. 1 (2019): 97–110. http://dx.doi.org/10.4312/ah.13.1.97-110.

Повний текст джерела

Анотація:

The contribution focuses on the historical overview of the publication of Slovenian grammars and on the emergence of the “one-grammar” state of affairs in grammatography. The turning point in writing and publishing grammar books is 1854. It was then that Anton Janežič’s Slovenska slovnica s kratkim pregledom slovenskega slovstva ter z malim cirilskim in glagoliškim berilom za Slovence was published and introduced to grammar writing, at least on the level of grammatography, the concept of monopoly and with it the primacy of the one and only grammar. Janežič’s grammar maintained its influence un

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Imssalem, Nuwara. "Teaching Grammar Pedagogically and Communicatively." International Journal of Arabic-English Studies 7, no. 1 (2006): 179–90. http://dx.doi.org/10.33806/ijaes2000.7.1.11.

Повний текст джерела

Анотація:

Pedagogical grammars have always been a mirror reflection of descriptive grammars. This situation has led to different degrees of emphasis placed on grammar in language teaching. The position of grammar in language teaching has swung from grammar driven audio-lingual methods to communicative approaches which consider grammar as something peripheral. The purpose of this paper is to outline briefly the historical development which has led to this situation and suggest 'a framework for teaching new grammatical items pedagogically and communicatively..

Стилі APA, Harvard, Vancouver, ISO та ін.

25

Su, Hang, and Naixing Wei. "“I’m really sorry about what I said”." Pragmatics. Quarterly Publication of the International Pragmatics Association (IPrA) 28, no. 3 (2018): 439–62. http://dx.doi.org/10.1075/prag.17005.su.

Повний текст джерела

Анотація:

Abstract This paper extends the concept of local grammar to speech act studies, focusing specifically on apologising in English. It aims primarily to demonstrate the usefulness of a local grammar approach to account for speech acts and ultimately to contribute to the on-going development of corpus pragmatics. Apology expressions in a corpus of scripted TV conversations are first automatically extracted and then manually examined in order to make sure that all remaining instances have the illocutionary force of apologising and thus qualify for further analysis. The subsequent local grammar anal

Стилі APA, Harvard, Vancouver, ISO та ін.

26

BELAJ, Branimir, and Goran TANACKOVIĆ FALETAR. "TO WHAT EXTENT ARE CONSTRUCTION GRAMMARS A UNI-TARY THEORETICAL MODEL?" Lingua Montenegrina 9, no. 1 (2012): 51–84. https://doi.org/10.46584/lm.v9i1.264.

Повний текст джерела

Анотація:

The topic of this paper are the cognitive linguistic approaches to grammar which can be covered by the term construction grammars. In the first part of the paper construction grammars are situated within the framework of functional approaches to grammar. This is followed by the discussion of how they square with the basic tenets of the so-called traditional functionalism, that is, functional grammars, and how they compare to generative grammar. The second part of the paper focuses on the analysis of the different construction grammars themselves, and proposes their classification into constru

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Assist. Inst. Ahmed Hamid Abdulrazzaq. "Generative Phonology Models of Universal Grammar: Constraint-Based Optimality Theory as Opposed to the Rule-Based SPE Model." ALUSTATH JOURNAL FOR HUMAN AND SOCIAL SCIENCES 62, no. 2 (2023): 428–37. http://dx.doi.org/10.36473/ujhss.v62i2.2069.

Повний текст джерела

Анотація:

Current linguistic theory presumes languages to be essentially similar because individuals have a genetic inclination to acquire language. Linguists strive to create a model of this abstract universal grammar that captures the core commonalities among different languages while allowing room for all the subtle differences that naturally occur in human speech. This all-encompassing theory of universal grammar would accurately distinguish between possible grammars and impossible grammars. This paper examines the main tenets of the two major generative phonology models of universal grammar: SPE’s

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Strobbe, Tiemen, Sara Eloy, Pieter Pauwels, Ruben Verstraeten, Ronald De Meyer, and Jan Van Campenhout. "A graph-theoretic implementation of the Rabo-de-Bacalhau transformation grammar." Artificial Intelligence for Engineering Design, Analysis and Manufacturing 30, no. 2 (2016): 138–58. http://dx.doi.org/10.1017/s0890060416000032.

Повний текст джерела

Анотація:

AbstractShape grammars are rule-based formalisms for the specification of shape languages. Most of the existing shape grammars are developed on paper and have not been implemented computationally thus far. Nevertheless, the computer implementation of shape grammar is an important research question, not only to automate design analysis and generation, but also to extend the impact of shape grammars toward design practice and computer-aided design tools. In this paper, we investigate the implementation of shape grammars on a computer system, using a graph-theoretic representation. In particular,

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Teichmann, Markus. "Regular Approximation of Weighted Linear Context-Free Tree Languages." International Journal of Foundations of Computer Science 28, no. 05 (2017): 523–42. http://dx.doi.org/10.1142/s0129054117400056.

Повний текст джерела

Анотація:

We show how to train a weighted regular tree grammar such that it best approximates a weighted linear context-free tree grammar concerning the Kullback–Leibler divergence between both grammars. Furthermore, we construct a regular tree grammar that approximates the tree language induced by a context-free tree grammar.

Стилі APA, Harvard, Vancouver, ISO та ін.

30

McCORMACK, JAY P., and JONATHAN CAGAN. "Designing inner hood panels through a shape grammar based framework." Artificial Intelligence for Engineering Design, Analysis and Manufacturing 16, no. 4 (2002): 273–90. http://dx.doi.org/10.1017/s089006040216402x.

Повний текст джерела

Анотація:

A framework for a design tool based on shape grammars is presented as an effective means for supporting the early stages of design. The framework uses a shape grammar interpreter to implement parametric shape grammars, allowing the grammar to be used interactively by a designer or optimization routine. A shape grammar to design inner hood panels of vehicles is introduced as an example of a parametric engineering shape grammar, and it is used with the framework to create standard and novel designs made possible by rules that take advantage of shape emergence.

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Steels, Luc. "Basics of Fluid Construction Grammar." Constructions and Frames 9, no. 2 (2017): 178–225. http://dx.doi.org/10.1075/cf.00002.ste.

Повний текст джерела

Анотація:

Abstract Fluid Construction Grammar (FCG) is a fully operational computational platform for developing grammars from a constructional perspective. It contains mechanisms for representing grammars and for using them in computational experiments and applications in language understanding, production and learning. FCG can be used by grammar writers who want to test whether their grammar fragments are complete and coherent for the domain they are investigating (for example verb phrases) or who are working in a team and have to share grammar fragments with others. It can be used by computational li

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Carlucci, Lorenzo, John Case, and Sanjay Jain. "Learning correction grammars." Journal of Symbolic Logic 74, no. 2 (2009): 489–516. http://dx.doi.org/10.2178/jsl/1243948324.

Повний текст джерела

Анотація:

AbstractWe investigate a new paradigm in the context of learning in the limit, namely, learningcorrection grammarsfor classes ofcomputably enumerable (c.e.)languages. Knowing a language may feature a representation of it in terms oftwogrammars. The second grammar is used to make corrections to the first grammar. Such a pair of grammars can be seen as a single description of (or grammar for) the language. We call such grammarscorrection grammars. Correction grammars capture the observable fact that peopledocorrect their linguistic utterances during their usual linguistic activities.We show that

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Payne, Thomas E. "A grammar as a communicative act." Perspectives on Grammar Writing 30, no. 2 (2006): 367–83. http://dx.doi.org/10.1075/sl.30.2.09pay.

Повний текст джерела

Анотація:

A descriptive grammar is a document that is intended to communicate important and complex patterns of knowledge within a speech community. Previous conceptions of linguistic grammars have emphasized a metaphor in which the internal grammar of a language is perceived as a “machine” that transforms thoughts into language structure. Written grammars were conceived as schematic representations of such machines. The present paper argues for a different metaphor. Because a grammar is primarily an act of communication, a good grammar possesses qualities known to hold of other communicative acts. The

Стилі APA, Harvard, Vancouver, ISO та ін.

34

DEVRIESE, DOMINIQUE, and FRANK PIESSENS. "Finally tagless observable recursion for an abstract grammar model." Journal of Functional Programming 22, no. 6 (2012): 757–96. http://dx.doi.org/10.1017/s0956796812000226.

Повний текст джерела

Анотація:

AbstractWe define a finally tagless, shallow embedding of a typed grammar language. In order to avoid the limitations of traditional parser combinator libraries (no bottom-up parsing, no full grammar analysis or transformation), we require object-language recursion to be observable in the meta-language. Since existing proposals for recursive constructs are not fully satisfactory, we propose new finally tagless primitive recursive constructs to solve the problem. To do this in a well-typed way, we require considerable infrastructure, for which we reuse techniques from the multirec generic progr

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Sygal, Yael, and Shuly Wintner. "Towards Modular Development of Typed Unification Grammars." Computational Linguistics 37, no. 1 (2011): 29–74. http://dx.doi.org/10.1162/coli_a_00035.

Повний текст джерела

Анотація:

Development of large-scale grammars for natural languages is a complicated endeavor: Grammars are developed collaboratively by teams of linguists, computational linguists, and computer scientists, in a process very similar to the development of large-scale software. Grammars are written in grammatical formalisms that resemble very-high-level programming languages, and are thus very similar to computer programs. Yet grammar engineering is still in its infancy: Few grammar development environments support sophisticated modularized grammar development, in the form of distribution of the grammar d

Стилі APA, Harvard, Vancouver, ISO та ін.

36

Khan, Sumbul, and Scott C. Chase. "Strategic style change using grammar transformations." Artificial Intelligence for Engineering Design, Analysis and Manufacturing 30, no. 4 (2016): 488–506. http://dx.doi.org/10.1017/s0890060416000135.

Повний текст джерела

Анотація:

AbstractNew styles can be created by modifying existing ones. In order to formalize style change using grammars, style has to be formally defined in the design language of a grammar. Previous studies in the use of grammars for style change do not give explicit rationale for transformation. How would designers decide which rules to modify in a grammar to generate necessary changes in style(s) of designs? This paper addresses the aforementioned issues by presenting a framework for strategic style change using goal-driven grammar transformations. The framework employs a style description scheme c

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Zwartjes, Otto. "The description of the indigenous languages of Portuguese America by the Jesuits during the colonial period." Historiographia Linguistica 29, no. 1-2 (2002): 19–70. http://dx.doi.org/10.1075/hl.29.1.06zwa.

Повний текст джерела

Анотація:

Summary The paper explores three grammars of two indigenous languages of Brazil written in Portuguese during the colonial period: two grammars of the Tupi language composed by José Anchieta (1534–1597) in 1595 and Luís Figueira (1575–1643) in 1621 (2nd ed., 1687), and one grammar of the Kiriri language, written by Luis Vincêncio Mamiani (1652–1730) in 1699. Although most studies agree that these grammars were based on a Latin framework, they usually do not specify which grammar in particular served as a model. It is known, however, that the Latin grammar by Manuel Álvares (1526–1582), first pu

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Novotný, Miroslav. "Reducing Operators for Generalized Grammars." Fundamenta Informaticae 13, no. 3 (1990): 237–44. http://dx.doi.org/10.3233/fi-1990-13302.

Повний текст джерела

Анотація:

Theory of reducing operators elaborated for pure generalized grammars in [5] is transferred to normed generalized grammars. There exists a reducing operator ρ such that. for any normed generalized grammar G the normed generalized grammars G, ρ(G) generate the same languages; furthemore: ρ(G) is a normed grammar if and only if there exists a normed grammar G ′ such that G and G ′ generate the same language and G ′ is in a certain sense smaller than or equal to G. The reducing operator ρ is used to characterize the so called harmonic languages.

Стилі APA, Harvard, Vancouver, ISO та ін.

39

NAKAMURA, AKIRA, and KUNIO AIZAWA. "RELATIONSHIPS BETWEEN COORDINATE GRAMMARS AND PATH CONTROLLED GRAPH GRAMMARS." International Journal of Pattern Recognition and Artificial Intelligence 03, no. 03n04 (1989): 445–58. http://dx.doi.org/10.1142/s0218001489000334.

Повний текст джерела

Анотація:

We define a graph grammar called node-replacement graph grammar with path controlled embedding (nPCE grammars) which use a sequence of edges instead of the single edge to embed a newly replaced graph into the host graph, then show some relationships between two-dimensional "coordinate grammars" and nPCE grammars. We also suggest an extension of PCE grammars to describe "disconnected coordinate languages".

Стилі APA, Harvard, Vancouver, ISO та ін.

40

Gong, Qingyu, Jingzhu Li, Tong Liu, and Na Wang. "Generating urban fabric in the orthogonal or non-orthogonal urban landscape." Environment and Planning B: Urban Analytics and City Science 47, no. 1 (2018): 25–44. http://dx.doi.org/10.1177/2399808318761667.

Повний текст джерела

Анотація:

Urban designers find it virtually impossible to (re)construct self-organising urban fabric formed by a synthesis of various builders. Here we show how generic, bottom-up grammars represent historic urban fabric in a unique context, and how shape rules are embedded in the evolutionary context. This paper generalises and formalises a context-free grammar and a context-sensitive grammar to describe and design two broadly categorised (i.e. orthogonal and non-orthogonal) urban patterns. Both grammars are constructive and employ morphological parameters to govern the patterning towards a desired for

Стилі APA, Harvard, Vancouver, ISO та ін.

41

Crepinsek, Matej, Tomaz Kosar, Marjan Mernik, Julien Cervelle, Rémi Forax, and Gilles Roussel. "On automata and language based grammar metrics." Computer Science and Information Systems 7, no. 2 (2010): 309–29. http://dx.doi.org/10.2298/csis1002309c.

Повний текст джерела

Анотація:

Grammar metrics have been introduced to measure the quality and the complexity of the formal grammars. The aim of this paper is to explore the meaning of these notions and to experiment, on several grammars of domain specific languages and of general-purpose languages, existing grammar metrics together with the new metrics that are based on grammar LR automaton and on the language recognized. We discuss the results of this experiment and focus on the comparison between grammars of domain specific languages as well as of general-purpose languages and on the evolution of the metrics between seve

Стилі APA, Harvard, Vancouver, ISO та ін.

42

AKUMBU, Pius. "Reflections on a community-based approach to writing grammars of endangered African languages." STUDIES IN AFRICAN LANGUAGES AND CULTURES, no. 54 (December 10, 2020): 71–96. http://dx.doi.org/10.32690/salc54.3.

Повний текст джерела

Анотація:

Increasingly, there have been proposals for grammar writers to take into account the realities and needs of the community in order to produce grammars that can serve the interests of the native speakers (e.g. Kadanya 2006, Rehg 2014). Obviously, a grammar of an endangered language should, among other things, lead to the maintenance and/or revitalization of the language. However, grammars that are comprehensive and clear (Noonan 2007, Payne 2014, Rice 2006), and yet focus on and meet the needs of the target community, are still rare. This paper provides a reflection, from a community linguist’s

Стилі APA, Harvard, Vancouver, ISO та ін.

43

DASSOW, JÜRGEN, RUDOLF FREUND, and GHEORGHE PĂUN. "COOPERATING ARRAY GRAMMAR SYSTEMS." International Journal of Pattern Recognition and Artificial Intelligence 09, no. 06 (1995): 1029–53. http://dx.doi.org/10.1142/s0218001495000420.

Повний текст джерела

Анотація:

The aim of this paper is to elaborate the power of cooperation in generating pictures by array grammars. As it is expected, the generative capacity of cooperating array grammar systems (with a fixed number, with a number greater than a given threshold, or with the maximal number of derivation steps in each component when it is enabled) is strictly greater than that of context-free array grammars. Yet the same result is also obtained in the case of systems with regular components, which contradicts the corresponding result for string grammar systems. In fact, some more results for array grammar

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Königseder, Corinna, and Kristina Shea. "Systematic rule analysis of generative design grammars." Artificial Intelligence for Engineering Design, Analysis and Manufacturing 28, no. 3 (2014): 227–38. http://dx.doi.org/10.1017/s0890060414000195.

Повний текст джерела

Анотація:

AbstractThe use of generative design grammars for computational design synthesis has been shown to be successful in many application areas. The development of advanced search and optimization strategies to guide the computational synthesis process is an active research area with great improvements in the last decades. The development of the grammar rules, however, often resembles an art rather than a science. Poor grammars drive the need for problem specific and sophisticated search and optimization algorithms that guide the synthesis process toward valid and optimized designs in a reasonable

Стилі APA, Harvard, Vancouver, ISO та ін.

45

Zwartjes, Otto. "The description of the indigenous languages of Portuguese America by the jesuits during the colonial period: The impact of the latin grammar of Manuel Álvares." Historiographia Linguistica International Journal for the History of the Language Sciences 29, no. 1-2 (2002): 19–70. http://dx.doi.org/10.1075/hl.29.1-2.06zwa.

Повний текст джерела

Анотація:

SUMMARY The paper explores three grammars of two indigenous languages of Brazil written in Portuguese during the colonial period: two grammars of the Tupi language composed by José Anchieta (1534–1597) in 1595 and Luís Figueira (1575–1643) in 1621 (2nd ed., 1687), and one grammar of the Kiriri language, written by Luis Vincêncio Mamiani (1652–1730) in 1699. Although most studies agree that these grammars were based on a Latin framework, they usually do not specify which grammar in particular served as a model. It is known, however, that the Latin grammar by Manuel Álvares (1526–1582), first pu

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Meduna, Aleksander, and Petr Vurm. "Multisequential Grammars with Homogeneous Selectors." Fundamenta Informaticae 48, no. 1 (2001): 55–60. https://doi.org/10.3233/fun-2001-48104.

Повний текст джерела

Анотація:

This paper deals with selective substitution grammars. It concentrates on multisequential grammars with homogeneous selectors that have all their activated parts identical. The present paper reduces the number and size of selectors in these grammars. Indeed, it demonstrates that for every phrase-structure grammar, there exists an equivalent multisequential grammar having two homogeneous selectors, either of which has only two activated parts.

Стилі APA, Harvard, Vancouver, ISO та ін.

47

Hoisl, Frank, and Kristina Shea. "An interactive, visual approach to developing and applying parametric three-dimensional spatial grammars." Artificial Intelligence for Engineering Design, Analysis and Manufacturing 25, no. 4 (2011): 333–56. http://dx.doi.org/10.1017/s0890060411000205.

Повний текст джерела

Анотація:

AbstractSpatial grammars are rule based, generative systems for the specification of formal languages. Set and shape grammar formulations of spatial grammars enable the definition of spatial design languages and the creation of alternative designs. Since the introduction of the underlying formalism, they have been successfully applied to different domains including visual arts, architecture, and engineering. Although many spatial grammars exist on paper, only a few, limited spatial grammar systems have been computationally implemented to date; this is especially true for three-dimensional (3-D

Стилі APA, Harvard, Vancouver, ISO та ін.

48

KLEMPIEN-HINRICHS, RENATE. "Normal forms for context-free node-rewriting hypergraph grammars." Mathematical Structures in Computer Science 12, no. 2 (2002): 135–48. http://dx.doi.org/10.1017/s0960129501003528.

Повний текст джерела

Анотація:

Confluent node-rewriting hypergraph grammars represent the most comprehensive known method for defining sets of hypergraphs in a recursive way. For a large natural subclass of these grammars, we show that the maximal rank of hyperedges indispensable for generating some set of hypergraphs equals the maximal rank of the hyperedges occurring in the hypergraphs of that set. Moreover, if such a grammar generates a set of graphs, one can construct from that grammar a C-edNCE graph grammar generating the same set of graphs.

Стилі APA, Harvard, Vancouver, ISO та ін.

49

Tzakosta, Marina, and Anthi Revithiadou. "A Grammar Inclusion Hypothesis of child language variation." Journal of Greek Linguistics 7, no. 1 (2006): 49–70. http://dx.doi.org/10.1075/jgl.7.04tza.

Повний текст джерела

Анотація:

AbstractThis paper examines variation in language development based on production data from three Greek-speaking children. Variation suggests that children employ more than one grammar during the acquisition process. This naturally raises the question of how ‘unwanted’ grammars gradually give way to the one that relates to the adult/target grammar. To account for variation, we implement partial ordering (Anttila 1997a, 1997b) to Tzakosta’s (2004) Multiple Parallel Grammars model of language development. More specifically, we propose that, in the intermediate stage of acquisition, constraint pe

Стилі APA, Harvard, Vancouver, ISO та ін.

50

Knight, Terry. "Computing with Emergence." Environment and Planning B: Planning and Design 30, no. 1 (2003): 125–55. http://dx.doi.org/10.1068/b12914.

Повний текст джерела

Анотація:

The concept of emergence has its roots in 19th-century philosophy. Today it is central to many computational systems which retain the hallmarks of emergence laid out much earlier. The role of emergence in creative design and its unique embodiment in shape grammars have been emphasized by March, Stiny, and others. Shape grammars generate emergent shapes—shapes not predefined in a grammar. Emergent shapes are not only the output of a shape grammar computation; they can be the input for further computation. The history of emergence and its characterization in shape grammars are discussed here. Di

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!