Se connecter

Bibliographies thématiques / Grammatical formalisms

Sommaire

Articles de revues

Littérature scientifique sur le sujet « Grammatical formalisms »

Auteur : Grafiati

Publié le 20 avril 2024

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

Choisissez une source :

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques 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.

Articles de revues sur le sujet "Grammatical formalisms"

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.

Plus de sources

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!