Pour voir les autres types de publications sur ce sujet consultez le lien suivant : Grammatical formalisms.

Articles de revues sur le sujet « Grammatical formalisms »

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les 50 meilleurs articles de revues pour votre recherche sur le sujet « Grammatical formalisms ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Parcourez les articles de revues sur diverses disciplines et organisez correctement votre bibliographie.

1

Carlson, Lauri, and Krister Linden. "Unification as a Grammatical Tool." Nordic Journal of Linguistics 10, no. 2 (1987): 111–36. http://dx.doi.org/10.1017/s033258650000161x.

Texte intégral
Résumé :
The present paper is an introduction to unification as a formalism for writing grammars for natural languages. The paper is structured as follows. Section 1 briefly describes the history and the current scene of unification based grammar formalisms. Sections 2–3 describe the basic design of current formalisms. Section 4 constitutes a tutorial introduction to a representative unification based grammar formalism, the D–PATR system of Karttunen (1986). Sections 5—6 consider extensions of the unification formalism and its limitations. Section 7 examines implementation questions and addresses the q
Styles APA, Harvard, Vancouver, ISO, etc.
2

Keller, Bill. "Formalisms for grammatical knowledge representation." Artificial Intelligence Review 6, no. 4 (1992): 365–81. http://dx.doi.org/10.1007/bf00123690.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

RANTA, AARNE. "Grammatical Framework." Journal of Functional Programming 14, no. 2 (2004): 145–89. http://dx.doi.org/10.1017/s0956796803004738.

Texte intégral
Résumé :
Grammatical Framework (GF) is a special-purpose functional language for defining grammars. It uses a Logical Framework (LF) for a description of abstract syntax, and adds to this a notation for defining concrete syntax. GF grammars themselves are purely declarative, but can be used both for linearizing syntax trees and parsing strings. GF can describe both formal and natural languages. The key notion of this description is a grammatical object, which is not just a string, but a record that contains all information on inflection and inherent grammatical features such as number and gender in nat
Styles APA, Harvard, Vancouver, ISO, etc.
4

BARKALOVA, PETYA. "ГРАМАТИЧЕСКИ ФОРМАЛИЗМИ В ПОМОЩ НА ГРАМАТИКОГРАФИЯТА / GRAMMATICAL FORMALISMS IN AID OF GRAMMATICOGRAPHY". Journal of Bulgarian Language 68, PR (2021): 224–49. http://dx.doi.org/10.47810/bl.68.21.pr.15.

Texte intégral
Résumé :
This paper presents some of the results of a larger study dedicated to the path of grammatical knowledge from the ancient Greek-Byzantine grammatical treatises to the Eastern Orthodox Slavic world, to the Bulgarian grammatical tradition from the Na-tional Revival period. The focus is on the syntactic element of the grammatical description. A formal notation of the sentence sections in the grammars of Avram Mrazović, Yuriy Venelin and Ivan Bogorov is enclosed to the end of comparing the “art and craft of writing grammars”. Grammatical formalisms have proved to be a reliable tool in the analytic
Styles APA, Harvard, Vancouver, ISO, etc.
5

SHEA, KRISTINA, and JONATHAN CAGAN. "Languages and semantics of grammatical discrete structures." Artificial Intelligence for Engineering Design, Analysis and Manufacturing 13, no. 4 (1999): 241–51. http://dx.doi.org/10.1017/s0890060499134012.

Texte intégral
Résumé :
Applying grammatical formalisms to engineering problems requires consideration of spatial, functional, and behavioral design attributes. This paper explores structural design languages and semantics for the generation of feasible and purposeful discrete structures. In an application of shape annealing, a combination of grammatical design generation and search, to the generation of discrete structures, rule syntax, and semantics are used to model desired relations between structural form and function as well as control design generation. Explicit domain knowledge is placed within the grammar th
Styles APA, Harvard, Vancouver, ISO, etc.
6

Laporte, Éric. "Reduction of lexical ambiguity." Ambiguity 24, no. 1 (2001): 67–103. http://dx.doi.org/10.1075/li.24.1.05lap.

Texte intégral
Résumé :
Summary We examine various issues faced during the elaboration of lexical disambiguators, e.g. issues related with linguistic analyses underlying disambiguators, and we exemplify these issues with grammatical constraints. We also examine computational problems and show how they are connected with linguistic problems: the influence of the granularity of tagsets, the definition of realistic and useful objectives, and the construction of the data required for the reduction of ambiguity. We show why a formalism is required for automatic ambiguity reduction, we analyse its function and we present a
Styles APA, Harvard, Vancouver, ISO, etc.
7

Frank, Robert, and Tim Hunter. "Variation in mild context-sensitivity." Formal Language Theory and its Relevance for Linguistic Analysis 3, no. 2 (2021): 181–214. http://dx.doi.org/10.1075/elt.00033.fra.

Texte intégral
Résumé :
Abstract Aravind Joshi famously hypothesized that natural language syntax was characterized (in part) by mildly context-sensitive generative power. Subsequent work in mathematical linguistics over the past three decades has revealed surprising convergences among a wide variety of grammatical formalisms, all of which can be said to be mildly context-sensitive. But this convergence is not absolute. Not all mildly context-sensitive formalisms can generate exactly the same stringsets (i.e. they are not all weakly equivalent), and even when two formalisms can both generate a certain stringset, ther
Styles APA, Harvard, Vancouver, ISO, etc.
8

GARGOURI, BILEL, MOHAMED JMAIEL, and ABDELMAJID BEN HAMADOU. "An approach to the formal specification of lingware." Natural Language Engineering 9, no. 3 (2003): 211–30. http://dx.doi.org/10.1017/s1351324902003030.

Texte intégral
Résumé :
This paper has two purposes. First, it suggests a formal approach for specifying and verifying lingware. This approach is based on a unified notation of the main existing formalisms for describing linguistic knowledge (i.e. Formal Grammars, Unification Grammars, HPSG, etc.) on the one hand, and the integration of data and processing on the other. Accordingly, a lingware specification includes all related aspects in a unified framework. This facilitates the development of a lingware system, since one has to follow a single development process instead of two separate ones. Secondly, it presents
Styles APA, Harvard, Vancouver, ISO, etc.
9

Wintner, Shuly, and Uzzi Ornan. "Syntactic Analysis of Hebrew Sentences." Natural Language Engineering 1, no. 3 (1995): 261–88. http://dx.doi.org/10.1017/s1351324900000206.

Texte intégral
Résumé :
AbstractDue to recent developments in the area of computational formalisms for linguistic representation, the task of designing a parser for a specified natural language is now shifted to the problem of designing its grammar in certain formal ways. This paper describes the results of a project whose aim was to design a formal grammar for modern Hebrew. Such a formal grammar has never been developed before. Since most of the work on grammatical formalisms was done without regarding Hebrew (and other Semitic languages as well), we had to choose a formalism that would best fit the specific needs
Styles APA, Harvard, Vancouver, ISO, etc.
10

Wedekind, Jürgen, and Ronald M. Kaplan. "Tractable Lexical-Functional Grammar." Computational Linguistics 46, no. 3 (2020): 515–69. http://dx.doi.org/10.1162/coli_a_00384.

Texte intégral
Résumé :
The formalism for Lexical-Functional Grammar (LFG) was introduced in the 1980s as one of the first constraint-based grammatical formalisms for natural language. It has led to substantial contributions to the linguistic literature and to the construction of large-scale descriptions of particular languages. Investigations of its mathematical properties have shown that, without further restrictions, the recognition, emptiness, and generation problems are undecidable, and that they are intractable in the worst case even with commonly applied restrictions. However, grammars of real languages appear
Styles APA, Harvard, Vancouver, ISO, etc.
11

Koseska-Toszewa, Violetta, and Antoni Mazurkiewicz. "Constructing catalogue of temporal situations." Cognitive Studies | Études cognitives, no. 10 (November 24, 2015): 71–109. http://dx.doi.org/10.11649/cs.2010.004.

Texte intégral
Résumé :
Constructing catalogue of temporal situationsThe paper is aiming to create a common basis for description, comparing, and analysis natural languages. As a subject of comparison we have chosen temporal structures of some languages. For such a choice there exists a perfect tool, describing basic temporal phenomena, namely an ordering of states and events in time, certainty and uncertainty, independency of histories of separate objects, necessity and possibility. This tool is supported by the Petri nets formalism, which seems to be well suited for expressing the above mentioned phenomena. Petri n
Styles APA, Harvard, Vancouver, ISO, etc.
12

Wedekind, Jürgen, and Ronald M. Kaplan. "LFG Generation by Grammar Specialization." Computational Linguistics 38, no. 4 (2012): 867–915. http://dx.doi.org/10.1162/coli_a_00113.

Texte intégral
Résumé :
This article describes an approach to Lexical-Functional Grammar (LFG) generation that is based on the fact that the set of strings that an LFG grammar relates to a particular acyclic f-structure is a context-free language. We present an algorithm that produces for an arbitrary LFG grammar and an arbitrary acyclic input f-structure a context-free grammar describing exactly the set of strings that the given LFG grammar associates with that f-structure. The individual sentences are then available through a standard context-free generator operating on that grammar. The context-free grammar is con
Styles APA, Harvard, Vancouver, ISO, etc.
13

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.

Texte intégral
Résumé :
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
Styles APA, Harvard, Vancouver, ISO, etc.
14

Pastra, Katerina, and Yiannis Aloimonos. "The minimalist grammar of action." Philosophical Transactions of the Royal Society B: Biological Sciences 367, no. 1585 (2012): 103–17. http://dx.doi.org/10.1098/rstb.2011.0123.

Texte intégral
Résumé :
Language and action have been found to share a common neural basis and in particular a common ‘syntax’, an analogous hierarchical and compositional organization. While language structure analysis has led to the formulation of different grammatical formalisms and associated discriminative or generative computational models, the structure of action is still elusive and so are the related computational models. However, structuring action has important implications on action learning and generalization, in both human cognition research and computation. In this study, we present a biologically insp
Styles APA, Harvard, Vancouver, ISO, etc.
15

Mastora, Anna, Manolis Peponakis, and Sarantos Kapidakis. "SKOS concepts and natural language concepts: An analysis of latent relationships in KOSs." Journal of Information Science 43, no. 4 (2016): 492–508. http://dx.doi.org/10.1177/0165551516648108.

Texte intégral
Résumé :
The vehicle to represent Knowledge Organisation Systems (KOSs) in the environment of the Semantic Web and linked data is the Simple Knowledge Organisation System (SKOS). SKOS provides a way to assign a Uniform Resource Identifier (URI) to each concept, and this URI functions as a surrogate for the concept. This fact makes of main concern the need to clarify the URIs’ ontological meaning. The aim of this study is to investigate the relationship between the ontological substance of KOS concepts and concepts revealed through the grammatical and syntactic formalisms of natural language. For this p
Styles APA, Harvard, Vancouver, ISO, etc.
16

Zhang, Yue, and Stephen Clark. "Discriminative Syntax-Based Word Ordering for Text Generation." Computational Linguistics 41, no. 3 (2015): 503–38. http://dx.doi.org/10.1162/coli_a_00229.

Texte intégral
Résumé :
Word ordering is a fundamental problem in text generation. In this article, we study word ordering using a syntax-based approach and a discriminative model. Two grammar formalisms are considered: Combinatory Categorial Grammar (CCG) and dependency grammar. Given the search for a likely string and syntactic analysis, the search space is massive, making discriminative training challenging. We develop a learning-guided search framework, based on best-first search, and investigate several alternative training algorithms. The framework we present is flexible in that it allows constraints to be impo
Styles APA, Harvard, Vancouver, ISO, etc.
17

Zhang, Xun, Yantao Du, Weiwei Sun, and Xiaojun Wan. "Transition-Based Parsing for Deep Dependency Structures." Computational Linguistics 42, no. 3 (2016): 353–89. http://dx.doi.org/10.1162/coli_a_00252.

Texte intégral
Résumé :
Derivations under different grammar formalisms allow extraction of various dependency structures. Particularly, bilexical deep dependency structures beyond surface tree representation can be derived from linguistic analysis grounded by CCG, LFG, and HPSG. Traditionally, these dependency structures are obtained as a by-product of grammar-guided parsers. In this article, we study the alternative data-driven, transition-based approach, which has achieved great success for tree parsing, to build general dependency graphs. We integrate existing tree parsing techniques and present two new transition
Styles APA, Harvard, Vancouver, ISO, etc.
18

NEDERHOF, MARK-JAN. "Efficient generation of random sentences." Natural Language Engineering 2, no. 1 (1996): 1–13. http://dx.doi.org/10.1017/s1351324996001234.

Texte intégral
Résumé :
We discuss the random generation of strings using the grammatical formalism AGFL. This formalism consists of context-free grammars extended with a parameter mechanism, where the parameters range over a finite domain. Our approach consists in static analysis of the combinations of parameter values with which derivations can be constructed. After this analysis, generation of sentences can be performed without backtracking.
Styles APA, Harvard, Vancouver, ISO, etc.
19

Gamallo Otero, Pablo, and Isaac González López. "A grammatical formalism based on patterns of Part of Speech tags." International Journal of Corpus Linguistics 16, no. 1 (2011): 45–71. http://dx.doi.org/10.1075/ijcl.16.1.03gam.

Texte intégral
Résumé :
In this paper, we describe a grammatical formalism, called DepPattern, to write dependency grammars using patterns of Part of Speech (PoS) tags augmented with lexical and morphological information. The formalism inherits ideas from Sinclair’s work and Pattern Grammar. To properly analyze semi-fixed idiomatic expressions, DepPattern distinguishes between open-choice and idiomatic rules. A grammar is defined as a set of lexical-syntactic rules at different levels of abstraction. In addition, a compiler was implemented so as to generate deterministic and robust parsers from DepPattern grammars. T
Styles APA, Harvard, Vancouver, ISO, etc.
20

Mahmood, Aymen Adil. "Formalism: Noam Chomsky and his Generative Grammar." Journal of Tikrit University for Humanities 30, no. 1, 1 (2023): 1–17. http://dx.doi.org/10.25130/jtuh.30.1.1.2023.22.

Texte intégral
Résumé :
For six decades generative concept dominated syntactic theory. The work on generative rules cannot simplify the concepts of the normative principles of the rules, but rather that the subject matter of the rules be considered normative. Grammar is a way to express phrases in their correct form. Grammar rules are accurate by the way they are formulated in a specific type that does not include generative grammar. The term "generative" is directly related to Noam Chomsky's tradition of grammatical research. This term and its formalities and terminology have been studied extensively within the Chom
Styles APA, Harvard, Vancouver, ISO, etc.
21

Rambow, Owen, K. Vijay-Shanker, and David Weir. "D-Tree Substitution Grammars." Computational Linguistics 27, no. 1 (2001): 87–121. http://dx.doi.org/10.1162/089120101300346813.

Texte intégral
Résumé :
There is considerable interest among computational linguists in lexicalized grammatical frameworks; lexicalized tree adjoining grammar (LTAG) is one widely studied example. In this paper, we investigate how derivations in LTAG can be viewed not as manipulations of trees but as manipulations of tree descriptions. Changing the way the lexicalized formalism is viewed raises questions as to the desirability of certain aspects of the formalism. We present a new formalism, d-tree substitution grammar (DSG). Derivations in DSG involve the composition of d-trees, special kinds of tree descriptions. Tr
Styles APA, Harvard, Vancouver, ISO, etc.
22

Yao, Jian, Qiwang Huang, and Weiping Wang. "Adaptive CGFs Based on Grammatical Evolution." Mathematical Problems in Engineering 2015 (2015): 1–11. http://dx.doi.org/10.1155/2015/197306.

Texte intégral
Résumé :
Computer generated forces (CGFs) play blue or red units in military simulations for personnel training and weapon systems evaluation. Traditionally, CGFs are controlled through rule-based scripts, despite the doctrine-driven behavior of CGFs being rigid and predictable. Furthermore, CGFs are often tricked by trainees or fail to adapt to new situations (e.g., changes in battle field or update in weapon systems), and, in most cases, the subject matter experts (SMEs) review and redesign a large amount of CGF scripts for new scenarios or training tasks, which is both challenging and time-consuming
Styles APA, Harvard, Vancouver, ISO, etc.
23

Barlow, Michael. "Corpora for Theory and Practice." International Journal of Corpus Linguistics 1, no. 1 (1996): 1–37. http://dx.doi.org/10.1075/ijcl.1.1.03bar.

Texte intégral
Résumé :
In this paper intuition-based studies of reflexive forms such as myself are contrasted with a corpus-based investigation of actual usage of reflexives. The examination of reflexives in English in several corpora reveals a variety of patterns, which are analysed within a schema-based approach to grammar (Barlow and Kemmer 1994). This approach follows the cognitive/functional tradition of grammatical analysis in viewing all grammatical units as composed of form-meaning pairings. The paper demonstrates that a schema-based approach is well-suited to the task of describing the major and minor patte
Styles APA, Harvard, Vancouver, ISO, etc.
24

Desclés, Jean-Pierre. "La linguistique peut-elle sortir de son état pré-galiléen ?" Neophilologica 2019 33 (November 10, 2021): 1–23. http://dx.doi.org/10.31261/neo.2021.33.17.

Texte intégral
Résumé :
The future of linguistics implies a better definition of concepts, especially in the semantic analysis. The notion of operator plays an important role in several areas of linguistics, for instance categorical grammars and representations of the meanings of grammatical categories. The general topology makes it possible to mathematize the grammatical concepts (time, aspects, modalities, enunciative operations) by means of operators. Curry’s Combinatorial Logic is an adequate formalism for composing and transforming operators at different levels of analysis that connect the semiotic expressions o
Styles APA, Harvard, Vancouver, ISO, etc.
25

SORACE, ANTONELLA. "Language and cognition in bilingual production: the real work still lies ahead." Bilingualism: Language and Cognition 19, no. 5 (2016): 895–96. http://dx.doi.org/10.1017/s1366728916000110.

Texte intégral
Résumé :
Goldrick, Putnam and Schwarz (Goldrick, Putnam & Schwarz) argue that code-mixing in bilingual production involves not only combining forms from both languages but also – crucially – integrating grammatical principles with gradient mental representations. They further propose an analysis of a particular case of intrasentential code mixing – doubling constructions – framed within the formalism of Gradient Symbolic Computation. This formalism, in their view, is better suited to accounting for code mixing than other generative language models because it allows the weighting of constraints both
Styles APA, Harvard, Vancouver, ISO, etc.
26

Kilborn, Kerry, and Ann Cooreman. "Sentence interpretation strategies in adult Dutch–English bilinguals." Applied Psycholinguistics 8, no. 4 (1987): 415–31. http://dx.doi.org/10.1017/s0142716400000394.

Texte intégral
Résumé :
ABSTRACTThis study is concerned with the probabilistic nature of processing strategies in bilingual speakers of Dutch and English. We used a sentence interpretation task designed to set up various “coalitions” and “competitions” among a restricted set of grammatical entities (i.e., word order, animacy, agreement). Performance in English paralleled that in Dutch in large measure, but where it diverged it approached performance on similar tasks by English monolinguals (Bates et al., 1982). These findings are interpreted on the basis of the “competition model,” a probabilistic theory of grammatic
Styles APA, Harvard, Vancouver, ISO, etc.
27

GOLDRICK, MATTHEW, MICHAEL PUTNAM, and LARA SCHWARZ. "Coactivation in bilingual grammars: A computational account of code mixing." Bilingualism: Language and Cognition 19, no. 5 (2016): 857–76. http://dx.doi.org/10.1017/s1366728915000802.

Texte intégral
Résumé :
A large body of research into bilingualism has revealed that language processing is fundamentally non-selective; there is simultaneous, graded co-activation of mental representations from both of the speakers’ languages. An equally deep tradition of research into code switching/mixing has revealed the important role that grammatical principles play in determining the nature of bilingual speech. We propose to integrate these two traditions within the formalism of Gradient Symbolic Computation. This allows us to formalize the integration of grammatical principles with gradient mental representat
Styles APA, Harvard, Vancouver, ISO, etc.
28

CHRISTIANSEN, HENNING. "CHR grammars." Theory and Practice of Logic Programming 5, no. 4-5 (2005): 467–501. http://dx.doi.org/10.1017/s1471068405002395.

Texte intégral
Résumé :
A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom-up parsers with an inherent treatment of ambiguity and a high flexibility to model various linguistic phenomena. The formalism extends previous logic programming based grammars with a form of context-sensitive rules and the possibility to include extra-grammatical hypotheses in both head and body of grammar rules. Among the applications are straightforward implementations of Assumption Grammars and abduction under i
Styles APA, Harvard, Vancouver, ISO, etc.
29

FERRUCCI, FILOMENA, and GIULIANA VITIELLO. "GRAMMATICAL INFERENCE FOR THE AUTOMATIC GENERATION OF VISUAL LANGUAGES." International Journal of Software Engineering and Knowledge Engineering 09, no. 04 (1999): 467–93. http://dx.doi.org/10.1142/s0218194099000267.

Texte intégral
Résumé :
In this paper we address the problem of the automatic generation of visual languages from a sample set of visual sentences. We present an improvement of the inference module of the VLG system which was originally conceived for the generation of iconic languages [11]. With this extension any kind of visual languages, like diagrams and forms, can be considered. To this aim, we present an inference algorithm for the class of Boundary SR grammars. These grammars are a subclass of the SR grammars with the interesting property of confluence, which extends the concept of context-freeness to the case
Styles APA, Harvard, Vancouver, ISO, etc.
30

Giachos, Ioannis, Eleni Batzaki, Evangelos C. Papakitsos, Stavros Kaminaris, and Nikolaos Laskaris. "A Natural Language Generation Algorithm for Greek by Using Hole Semantics and a Systemic Grammatical Formalism." Journal of Computer Science Research 5, no. 4 (2023): 27–37. http://dx.doi.org/10.30564/jcsr.v5i4.6067.

Texte intégral
Résumé :
This work is about the progress of previous related work based on an experiment to improve the intelligence of robotic systems, with the aim of achieving more linguistic communication capabilities between humans and robots. In this paper, the authors attempt an algorithmic approach to natural language generation through hole semantics and by applying the OMAS-III computational model as a grammatical formalism. In the original work, a technical language is used, while in the later works, this has been replaced by a limited Greek natural language dictionary. This particular effort was made to gi
Styles APA, Harvard, Vancouver, ISO, etc.
31

GULLBERG, MARIANNE, and M. CARMEN PARAFITA COUTO. "An integrated perspective on code-mixing patterns beyond doubling?" Bilingualism: Language and Cognition 19, no. 5 (2016): 885–86. http://dx.doi.org/10.1017/s1366728916000080.

Texte intégral
Résumé :
Code-mixing (CM) is a striking example of how two languages are active simultaneously in bilingual production. Gradient Symbolic Computation (GSC) proposes a formalism to account for the systematicity of CM patterns by integrating psycholinguistic notions of bilingual co-activation with generativist accounts of grammar. We applaud the attempt to bridge research traditions and all efforts to capture the systematicity of variation, and the interaction between processing and grammatical constraints in bilingual production. However, the descriptive and predictive scope of the current proposal rema
Styles APA, Harvard, Vancouver, ISO, etc.
32

Fried, Mirjam. "Construction Grammar as a tool for diachronic analysis." Constructions and Frames 1, no. 2 (2009): 261–90. http://dx.doi.org/10.1075/cf.1.2.04fri.

Texte intégral
Résumé :
Through a discourse-grounded internal reconstruction that aims at capturing the emergence of grammatical structure, the study examines the development of the subjective epistemic particle jestli ‘[in-my-opinion-] maybe’ in conversational Czech. Through internal reconstruction, the change (syntactic complementizer > speaker-centered epistemic contextualizer > subjective epistemic particle) is presented as a metonymy-based conventionalization of a pragmatic meaning implied by certain tokens of indirect Y/N questions into a new modal meaning. Taking a Construction Grammar approach, so far l
Styles APA, Harvard, Vancouver, ISO, etc.
33

Griffiths, Joshua M. "Competing repair strategies for word-final obstruent-liquid clusters in northern metropolitan French." Journal of French Language Studies 32, no. 1 (2021): 1–24. http://dx.doi.org/10.1017/s0959269520000319.

Texte intégral
Résumé :
ABSTRACTFrench licenses word-final obstruent-liquid clusters (table /tabl/; souffre /sufʁ/). These clusters may be realised faithfully resulting in an apparent violation of the sonority sequencing principle (Clements, 1990). Yet, the clusters can also be repaired in one of two ways: (1) through the reduction of the cluster (i.e. [tab]) or (2) through the epenthesis of a schwa vowel, resyllabifying the cluster into the onset position (i.e. [ta.blə].) In this article, I investigate which factors condition the realisation of word-final obstruent-liquid clusters. The results are formalised in Maxi
Styles APA, Harvard, Vancouver, ISO, etc.
34

Gabor, Mateusz, Wojciech Wieczorek, and Olgierd Unold. "Split-Based Algorithm for Weighted Context-Free Grammar Induction." Applied Sciences 11, no. 3 (2021): 1030. http://dx.doi.org/10.3390/app11031030.

Texte intégral
Résumé :
The split-based method in a weighted context-free grammar (WCFG) induction was formalised and verified on a comprehensive set of context-free languages. WCFG is learned using a novel grammatical inference method. The proposed method learns WCFG from both positive and negative samples, whereas the weights of rules are estimated using a novel Inside–Outside Contrastive Estimation algorithm. The results showed that our approach outperforms in terms of F1 scores of other state-of-the-art methods.
Styles APA, Harvard, Vancouver, ISO, etc.
35

Paxson, James J. "Personification's Gender." Rhetorica 16, no. 2 (1998): 149–79. http://dx.doi.org/10.1525/rh.1998.16.2.149.

Texte intégral
Résumé :
Abstract: The fact that classical and early medieval allegorical personifications were exclusively female has long perplexed literary scholars and rhetoricians. Although arguments have been made about this gendering using grammatical formalism for the most part, an examination of rhetoric's own deep structure—that is, the discursive metaphors it has always employed to talk about tropes and figures—promises to better articulate the gendered bases of the figure. Using analytical tactics drawn from Paul de Man's discussions of prosopopeia, this essay re-examines some of the rhetorical record alon
Styles APA, Harvard, Vancouver, ISO, etc.
36

Kostic, Aleksandar, Svetlana Ilic, and Petar Milin. "Probability estimate and the optimal text size." Psihologija 41, no. 1 (2008): 35–51. http://dx.doi.org/10.2298/psi0801035k.

Texte intégral
Résumé :
Reliable language corpus implies a text sample of size n that provides stable probability distributions of linguistic phenomena. The question is what is the minimal (i.e. the optimal) text size at which probabilities of linguistic phenomena become stable. Specifically, we were interested in probabilities of grammatical forms. We started with an a priori assumption that text size of 1.000.000 words is sufficient to provide stable probability distributions. Text of this size we treated as a "quasi-population". Probability distribution derived from the "quasi-population" was then correlated with
Styles APA, Harvard, Vancouver, ISO, etc.
37

Butuc, Petru. "Defining Aspects of the Logical Subject into the Sentence." Philologia, no. 2(314) (August 2021): 76–83. http://dx.doi.org/10.52505/1857-4300.2021.2(314).08.

Texte intégral
Résumé :
Although linguistics, the science of language, has reached a high level of development, anyway in syntax there are still many unsolved problems. A very important problem is the one that identifies the parts of the sentences. Therefore, because of inconsistent application of principles, at the analysis of language acts, at the syntactic level, sometimes the extreme structural-grammatical formalism is reached, which, as a result, superimpose parts of sentences over parts of speech, the criterion which conducts to a morphological interpretation of syntax. Such a syntactical analysis is useless, b
Styles APA, Harvard, Vancouver, ISO, etc.
38

Hyman, Larry M., and Armindo Ngunga. "On the non-universality of tonal association ‘conventions’: evidence from Ciyao." Phonology 11, no. 1 (1994): 25–68. http://dx.doi.org/10.1017/s0952675700001834.

Texte intégral
Résumé :
One of the major aims of linguistic theory is to determine what is universal vs. language-specific within grammatical systems. In phonology, for example, a number of universals have been proposed and incorporated into the various subtheories that deal with segmental and prosodic aspects of sound systems. In his original autosegmental theory, for instance, Goldsmith (1976) provided a formalism and a set of principles embodying a number of universal claims about how different tiers may link to each other. Most of the support for this theory came from the study of tone: tones (Ts) were said to re
Styles APA, Harvard, Vancouver, ISO, etc.
39

Underwood, Nancy L. "A Typed Feature-based Grammar of Danish." Nordic Journal of Linguistics 20, no. 1 (1997): 31–62. http://dx.doi.org/10.1017/s0332586500004005.

Texte intégral
Résumé :
This paper presents an overview of the first broad coverage grammatical description of Danish in a Typed Feature Structure (TFS) based unification formalism inspired by HPSG. These linguistic specifications encompass phenomena within inflectional morphology, phrase structure and predicate argument structure, and have been developed with a view to implementation. The emphasis on implementability and re-usability of the specifications has led to the adoption of a rather leaner formal framework than that underlying HPSG. However, the paper shows that the adoption of such a framework does not lead
Styles APA, Harvard, Vancouver, ISO, etc.
40

ARNDT, TIMOTHY, SHI-KUO CHANG, and ANGELA GUERCIO. "FORMAL SPECIFICATION AND PROTOTYPING OF MULTIMEDIA APPLICATIONS." International Journal of Software Engineering and Knowledge Engineering 10, no. 04 (2000): 377–409. http://dx.doi.org/10.1142/s0218194000000250.

Texte intégral
Résumé :
Multimedia systems incorporating hyperlinks and user interaction can be prototyped using TAOML, an extension of HTML. TAOML is used to define a Teleaction Object (TAO) which is a multimedia object with associated hypergraph structure and knowledge structure The hypergraph structure supports the effective presentation and efficient communication of multimedia information. In this paper, a formal specification methodology for TAOs using Symbol Relation (SR) grammars is described. An attributed SR grammar is then introduced in order to associate knowledge with the TAO. The limitations to achieve
Styles APA, Harvard, Vancouver, ISO, etc.
41

Connors, Robert J. "The Erasure of the Sentence." College Composition & Communication 52, no. 1 (2000): 96–128. http://dx.doi.org/10.58680/ccc20001409.

Texte intégral
Résumé :
This article examines the sentence-based pedagogies that arose in composition during the 1960s and 1970s—the generative rhetoric of Francis Christensen, imitation exercises, and sentence-combining—and attempts to discern why these three pedagogies have been so completely elided within contemporary composition studies. The usefulness of these sentence-based rhetorics was never disproved, but a growing wave of anti-formalism, anti-behaviorism, and anti-empiricism within English-based composition studies after 1980 doomed them to a marginality under which they still exist today. The result of thi
Styles APA, Harvard, Vancouver, ISO, etc.
42

Harris, R. Allen. "Linguistics, Technical Writing, and Generalized Phrase Structure Grammar." Journal of Technical Writing and Communication 18, no. 3 (1988): 227–40. http://dx.doi.org/10.2190/wtlt-qky6-lw4v-w2bd.

Texte intégral
Résumé :
Linguistics has been largely misunderstood in writing pedagogy. After Chomsky's revolution, it was widely touted as a panacea; now it is widely flogged as a pariah. Both attitudes are extreme. It has a number of applications in the writing classroom, and it is particularly ripe for technical writing students, who have more sophistication with formalism than their humanities counterparts. Moreover, although few scholars outside of linguistics are aware of it, Transformational Grammar is virtually obsolete; most grammatical models are organized around principled aversions to the transformation,
Styles APA, Harvard, Vancouver, ISO, etc.
43

Purgina, Marina, Maxim Mozgovoy, and John Blake. "WordBricks: Mobile Technology and Visual Grammar Formalism for Gamification of Natural Language Grammar Acquisition." Journal of Educational Computing Research 58, no. 1 (2019): 126–59. http://dx.doi.org/10.1177/0735633119833010.

Texte intégral
Résumé :
Gamification of language learning is a clear trend of recent years. Widespread use of smartphones and the rise of mobile gaming as a popular leisure activity contribute to the popularity of gamification, as application developers can rely on an unprecedented reach of their products and expect acceptance of game-like elements by the users. In terms of content, however, most mobile apps implement traditional language learning activities, such as reading, listening, translating, and solving quizzes. This article discusses gamification of learning natural language grammar with a mobile app WordBri
Styles APA, Harvard, Vancouver, ISO, etc.
44

Desclés, Jean-Pierre. "Vers un Calcul des Significations dans l’Analyse des Langues." Revista de Filosofia Moderna e Contemporânea 8, no. 1 (2020): 21–71. http://dx.doi.org/10.26512/rfmc.v8i1.31016.

Texte intégral
Résumé :
L’article présente des réflexions épistémologiques sur le programme de recherche qui a pour objet l’étude de l’activité de langage exprimée par les langues, activité qui ne se ramène pas à la simple communication et à l’expression de la pensée. Il présente certains concepts importants de la théorie de l’énonciation en les articulant avec des schèmes sémantico-cognitifs, qui représentent les significations d’unités grammaticales et lexicales, et qui sont engendrés, dans le formalisme de la Logique Combinatoire de Curry, par des compositions et des transformations d’opérateurs primitifs ancrés s
Styles APA, Harvard, Vancouver, ISO, etc.
45

Sigurd, Bengt. "Using Referent Grammar (RG) in Computer Analysis, Generation and Translation of Sentences." Nordic Journal of Linguistics 11, no. 1-2 (1988): 129–50. http://dx.doi.org/10.1017/s0332586500001785.

Texte intégral
Résumé :
The paper presents Referent Grammar (RG), a version of generalized phrase structure grammar. RG uses descriptive labels for defective categories (categories tacking a constituent) instead of slash expressions and needs no null (empty, zero) categories. RG uses both functional and categorial representations and the grammar rules, written in the Prolog DCG formalism, relate these two levels. The functional representations of RG include referent variables (numbers) with noun phrases which makes it possible to keep track of the referents within the sentences and in the text. Relative clauses can b
Styles APA, Harvard, Vancouver, ISO, etc.
46

Putnam, Michael T., and Robert Klosinski. "The good, the bad, and the gradient." Linguistic Approaches to Bilingualism 10, no. 1 (2017): 5–34. http://dx.doi.org/10.1075/lab.16008.put.

Texte intégral
Résumé :
Abstract Although formal analyses of code-switching have enjoyed some success in determining which structures and interfaces are more fertile environments for switches than others, research exposing recalcitrant counter-examples to proposed constraints and axioms responsible for governing code-switching is abound. We advance the claim here that sub-optimal representations, i.e., losers , stand to reveal important information regarding the interaction of grammatical principles and processing strategies of bilingual speakers and that any comprehensive analysis of code-switching phenomena should
Styles APA, Harvard, Vancouver, ISO, etc.
47

Delmas, Claude. "“Commence + to - infinitives” in G. Stein’s discourse." Recherches anglaises et nord-américaines 44, no. 1 (2011): 67–79. http://dx.doi.org/10.3406/ranam.2011.1407.

Texte intégral
Résumé :
Cette contribution a pour objet d’étude des énoncés contenant des occurrences du verbe anglais commence au prétérit suivi de la complémentation infinitive en to. Elle se donne pour visée de montrer dans quelle mesure se vérifient les hypothèses communes proposées dans la littérature pour expliquer quelques facettes du fonctionnement du verbe retenu et sa complémentation. L’étude tente de montrer en quoi le formalisme du verbe commence implique la relation co-énonciative en rupture. Certains des concepts utilisés sont empruntés à la théorie des «modes de discours» de C. Smith et plus particuliè
Styles APA, Harvard, Vancouver, ISO, etc.
48

Opaliński, Krzysztof, and Patrycja Potoniec. "KORPUS POLSZCZYZNY XVI WIEKU." Poradnik Językowy, no. 8/2020(777) (October 28, 2020): 17–31. http://dx.doi.org/10.33896/porj.2020.8.2.

Texte intégral
Résumé :
The original purpose of creating the corpus of the 16th Polish language was to preserve the material basis of Słownik polszczyzny XVI wieku (Dictionary of the 16th-Century Polish Language) (SPXVI) comprising 272 texts transliterated in accordance with standardised principles, which is of great value. The project described here consists in creating an online base of the resources and using a part of it as a germ of a language corpus with texts designated with morphosyntactic markers. The works adopted XML encoding in the TEI (Text Encoding Initiative) formalism, version P5, adjusted to a 16th-c
Styles APA, Harvard, Vancouver, ISO, etc.
49

Schleifer, Ronald. "The semiotics of sensation: A. J. Greimas and the experience of meaning." Semiotica 2017, no. 214 (2017): 173–92. http://dx.doi.org/10.1515/sem-2016-0182.

Texte intégral
Résumé :
AbstractIt has been the life-long ambition of A. J. Greimas to analyze the nature of meaning, and in his work he has consistently described meaning as a felt experience, what he calls the “feeling of understanding.” This essay examines the Greimassian investigation of meaning as experiential – which is to say sensational – as well as cognitive by analyzing, by means of Greimas’s “semiotic square,” P. M. S. Hacker’s recent exploration of the relationship between sensation and cognition undertaken in terms of the semantics of ordinary-language philosophy. That is, the essay subjects what it call
Styles APA, Harvard, Vancouver, ISO, etc.
50

Roszko, Danuta, and Roman Roszko. "Projekcja znaczeń w wielojęzycznych korpusach wraz z przykładami jej zastosowania w badaniach korpusowych nad językiem polskim." Slavica Wratislaviensia 175 (September 6, 2022): 25–36. http://dx.doi.org/10.19195/0137-1150.175.2.

Texte intégral
Résumé :
The Institute of Slavic Studies of the Polish Academy of Sciences, as part of the CLARIN-PL consortium, is engaged in the creation of multilingual corpora of Slavic and Baltic languages. Some of the planned corpora have already been made available in the dSpace CLARIN-PL repository and in the KonText online browser. One of these corpora is the Polish–Lithuanian corpus, which in this article serves to illustrate the possibilities of applying CLARIN-PL corpora in research into the Polish language. The Lithuanian language has an archaic structure in comparison with Polish. Lexemes are characteris
Styles APA, Harvard, Vancouver, ISO, etc.
Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!