Home Linguistics & Semiotics Concept lattice formalisms of Hébert’s “semic analysis” and “analysis by classification”
Article Open Access

Concept lattice formalisms of Hébert’s “semic analysis” and “analysis by classification”

  • Michael D. Fowler EMAIL logo
Published/Copyright: November 13, 2024

Abstract

In this article we provide a mathematical frame to the generation of class taxonomies suggested by Hébert in his analysis of the poem <<Quelle affaire!>> (‘A Sorry Business!’) by Gilles Vigneault (b. 1928) as well as a formalization of the structure of semic isotopies in his reading of The golden ship by Émile Nelligan (1879–1941). We also examine the characteristics of inter- and intra-semic molecules at work within Réne Magritte’s painting La clef des songes. Our mathematical frame is Ganter and Wille’s extension of lattice theory called formal concept analysis, for which we explore various formalisms and constructs that allow us to reason on semic structures.

1 Introduction

In Louis Hébert’s (2020) recent book An Introduction to Applied Semiotics, the author explores structural semiotics from the perspective of the Paris school, in particular, the groundwork laid by François Rastier (1997, 2016 and A. J. Greimas (1983, 1987. Hébert provides well-considered introductions to a number of analytic methods, two of which we will focus on in the article – namely, semic analysis and analysis through classification. Both of these analytic methods are applied in numerous textual contexts by Hébert, though both methods emerge from the subtle distinctions and indirect definitions he gives in regard to classes, types, tokens and elements, in addition to how Rastier and Greimas conceived of the relation between a seme, isotopy and molecule. We begin by providing an overview of these terms and their usage.

1.1 Nomenclature

1.1.1 Semes

Greimas and Courtés (1979: 278) define a seme as the “‘minimal unit’ of meaning” that is located on the “content plane” and corresponds to the pheme, the unit on the “expression plane.” Like the constitution of phonemes as comprised of phemes, so too, semes (which we denote /seme/) are the components of sememes. But a seme itself is not autonomous or “atomistic,” instead it “exists only because of the differential gap that opposes it to other semes” (Greimas and Courtés 1979: 278). This theoretical position is as much indebted to Saussure (1983), as to Greimas’ recognition of how Levi-Strauss uses constitutive units for identifying signifieds in myths in the following form:

(1) A n o n A B n o n B .

Here, Greimas mirrors the notion of Levi-Strauss (1955) that “greater constitutive units” can be framed in terms of “distinctive features.” That is to say that semes themselves follow this type of structure of opposition and form what Greimas calls semic categories (Greimas 1987: 16). These semic categories constitute the content plane, and therefore are considered anterior to the individual semes themselves. But there is also structure here too, which becomes fully formed and visualized through the semiotic square (Greimas and Rastier 1968: 88) via the utility of the relations of contradiction (), contrariety (⟷) and implication (⤏) between semes:

(2)

What is fundamental then to the semiotic square is homologation, or what Greimas and Courtés (1979: 144) consider “a rigorous formulation of reasoning by analogy” that they denote as A: B: A′: B′, which is a generalization of the case of the semiotic square as: s 1 : s 2 : : s ̄ 1 : s ̄ 2 .

In terms of classifying semic categories themselves, Greimas and Courtés offer the following:

An examination of different semic categories allows us to distinguish several classes: (a) figurative semes (or exteroceptive semes) are entities on the content plane of natural languages, corresponding to elements of the expression plane of the semiotics of the natural world, i.e., corresponding to the articulations of the sensory classes, to the perceptible qualities of the world; (b) abstract semes (or interoceptive semes) are content entities that refer to no exteriority, but which, on the contrary, are used to categorize the world and to give it meaning: for example, the categories relation/term, object/process; (c) thymic semes (or proprioceptive semes) connote semic microsystems according to the category euphoria/dysphoria, thus setting them up as axiological systems. (Greimas and Courtés 1979: 279)

Hébert (2020: 145–146) also specifies that semes can be thought of as generic, for which the corresponding sememe belongs to a semantic class as a semantic paradigm, made up of sememes. There are three types of generic semes, those that are microgeneric, mesogeneric and macrogeneric, for which all three correlate to the three semantic classes that Rastier (1997) contextualizes within the domain of his interpretive semantics. These semantic classes are taxemes, or the minimal classes by which sememes are distinguished, domains, which are connected to social contexts and human endeavors (e.g., dictionaries, scientific disciplines, etc.), and dimensions, or those most general classes of oppositions (e.g., animate vs. inanimate). Hébert give the example of the taxeme //tableware// and its three sememes, each of which

contains the microgeneric seme /tableware/ and is distinguished from the other sememes of the same taxeme by a specific seme: /for piercing/ in ‘fork,’ /for cutting/ in ‘knife’ and /for containing/ in ‘spoon.’ Since this taxeme comes under the domain //food//, the three sememes also contain the mesogeneric seme /food/. (Hébert 2020: 146)

Unlike a generic seme, the specific semes highlighted by Hébert (2020: 145) are ones that distinguish a sememe from all other sememes of the same class. Hébert also distinguishes between inherent semes and afferent semes. In the case of the former, an inherent seme is one that belongs to a sememe’s type and is actualized by default unless it is part of a virtualized structure. For example, ‘albino crow’ contains the inherent seme /black/ in the type of the sememe ‘crow’ that is virtualized because of ‘albino.’ Thus the seme /white/ here is actualized. Hébert notes that afferent semes are “present only in the sememe’s token, that is, only by contextual indication” (Hébert 2020: 146). Thus if a seme is present in a context it is normally associated to, it is actualized, and if it is missing it is virtualized.

1.1.2 Isotopies and molecules

Greimas (1983: 81) describes an isotopy (denoted /isotopy/) as emerging from a syntagm, that is, a grouping of at least two semic figures. As Hébert (2020: 147) suggests, the sentence “I only use a knife for picking up peas” contains the (mesogeneric) isotopy /food/, which indexes the sememes ‘knife’ and ‘peas.’ In addition, it virtualizes the inherent specific seme /for cutting/ in ‘knife’ and actualizes the afferent seme /for picking up/. An isotopy can thus be extended over “two morphemes, two words, a paragraph, or a whole text” (Rastier 2016: 497). Thus given a pair of generic isotopies, that is, ones that correspond to one of the three semantic classes of taxeme, domain and dimension, we have what Rastier (1997: 35) identifies a semic molecule, or “the recurrence of groupings of relatively stable specific semes.” In Figure 1 we give Rastier’s diagram of the relation between these generic isotopies, and how their constituent sememes are covered by a semic molecule.

Figure 1: 

Rastier’s (1997: 36) diagram of the relation between themes, generic isotopies and a semic molecule.
Figure 1:

Rastier’s (1997: 36) diagram of the relation between themes, generic isotopies and a semic molecule.

1.1.3 Classes, types, tokens and elements

In Ronald Schleifer’s introduction to Greimas’ Structural Semantics, he describes the assumption that for any process for which meaning is the translation of a sign into another system of signs, there must be present a corresponding system of elements. It should thus be possible to order these elements into classes (which we denote //class//) according to their possibilities of combination in addition to constructing a “general and exhaustive calculus of the possible combinations.” (Greimas 1983: xvi)

Hébert too describes a class as “not an individual entity, but rather an inventory of one or more properties, optionally accompanied by rules for evaluating the membership of the element.” (Hébert 2020: 11) For example, the semantic class //time of the day// contains the signifieds ‘day’ and ‘night.’ Regarding the evaluation of membership to a semantic class, there is a similar notion in mathematical set theories such as NBG (von Neumann-Bernays-Gödel set theory) and ZFC (Zermelo-Fraenkel-Choice set theory) of the application of an axiom of choice on non-empty sets that allows for the construction of equivalence classes to describe elements from the union of these non-empty sets. In its most general form this is expressed as a selector function on a collection X of nonempty sets, such that for every set A ∈ X, f(A) is an element of A:

(3) X X f : X X A X ( f ( A ) A ) .

Such a selector function is what Hébert utilizes to distinguish between a genre of poetry (as a type) and a collection of say ‘nature’ poems (as a class):

Strictly speaking, a type is not a class because rather than containing, or bringing together the token units (the poems) governed by it, it generates them. We will distinguish between a class’s extension (or enumeration) and its intension (or comprehension). (Hébert 2020: 11)

An element is a member of a particular class found in its extension and satisfies an equivalence relation that is congruent to a selector function. Hébert considers a token as “more or less [a] complete manifestation of a model or type, such as a particular sonnet that is more or less regular” (Hébert 2020: 11). This causes some confusion as to the difference between a token and an element, as the token seems to not operate within the same set-theoretic universe of discourse as a class and its choice function. Hébert draws attention to this fact when he describes typing as an act of categorization in which “a token is subsumed under a type, related to it, and recognized as its emanation or manifestation” (Hébert 2020: 11). This neatly mirrors the difference between set theories and type theories in mathematics, where a type theory is merely a set of rules of inference to describe any term as a type and allow for operations and expected variable values while a set theory has both rules and axioms, or logical statements that are accepted to be true.

1.2 Motivation

Our motivation for this article is what we perceive as parallelisms between the analytic methods and conceptual frameworks of structural semiotics as espoused by Greimas (1983), Rastier (1997) and Hébert (2007, 2020, to the mathematics of extended lattice theory and “formal concept analysis” forwarded by Ganter and Wille (1999). In order to ground the connection between these fields, we examine the work of Hébert using his framework of “semic analysis” and “analysis by classification,” which directly emerges from Rastier’s interpretive semantics and Greimas’ notion of semic categories.

For Wille (2005: 9), the mathematization of real-world concepts to discover underlying structures and their accompanying semantics through lattice constructions is a promising inter-disciplinary field because it has the potential to “activate implicit conceptions and experiences concerning the underlying domains.” The mathematization of concepts thus points towards subjective theories which “contain implicit and explicit assumptions about objects and events, their conditions and causes, their characteristics, relations and functions” (Wille 2005: 8). This approach neatly mirrors what Rastier (1997: 5) asserts about objectivity in semiotic analysis, in which “meaning has no existence of its own beyond its utterance and its interpretation” Marrone (2022: 22). similarly notes that semiotic analysis ultimately seeks “to reconstruct the hierarchy of underlying layers” in subjective experiences. In our estimation, this is facilitated directly through imposed selector functions that seek to articulate, collate and render meaning in texts or images via associations between elements of a set.

To these ends, we firstly provide a mathematical frame to the generation of class taxonomies suggested by Hébert (2007: 167–169) in his analysis of the poem <<Quelle affaire!>> (“A Sorry Business!”) by Gilles Vigneault. We also provide a formalization of the structure of semic isotopies through his reading of The golden ship by Émile Nelligan (Hébert 2020: 157–160) as well as the characteristics of inter- and intra-semic molecules at work within Réne Magritte’s painting La clef des songes (Hébert 2020: 160–168). Through these examples, we introduce relative mathematical formalisms in order to provide a systematic description of the approach of structural semiotics to the conceptualization of a seme as the minimal unit of meaning, and how semes form the basis for larger emergent forms.

2 Analysis by classification

For Hébert, the cognitive act of analysis by classification is one that operates in a similar manner to the selector function we outlined in Equation (3). That is to say that the classifying agent chooses which feature(s) the elements must have in order to be part of the class, the values these features must take, and the rules for evaluating and determining membership (Hébert 2020: 205). In his Dispositifs pour l’analyse des textes et des images (Hébert 2007), an earlier edition to An Introduction to Applied Semiotics, he provides a sample analysis of the poem <<Quelle affaire!>> (“A Sorry Business!”) (Vigneault 1998) (Figure 2) by the Quebec poet Gilles Vigneault (b. 1928). The poem reflects on a highly charged environmental and political affair during the 1980s in which the actress Brigitte Bardot visited the Canadian ice floes with a camera crew to denounce the hunting of baby seals and the seal fur trade. The successful campaign’s ramifications saw new policies that caused a sharp decrease in the harvesting of baby seals that caused an overall increase in the seal population which in turn affected fish numbers, and thus the livelihood of local fishing communities.

Figure 2: 
The poem <<Quelle affaire!>> (“A Sorry Business!”) by Gilles Vigneault (1998: 147–148), translated by Hébert (2007: 167).
Figure 2:

The poem <<Quelle affaire!>> (“A Sorry Business!”) by Gilles Vigneault (1998: 147–148), translated by Hébert (2007: 167).

Hébert proposes a tree diagram (Figure 3) based in essence on what Greimas (1983: 123) identifies as the “simple opposition of immanence and manifestation.” The diagram presents a differentiation between a class (unshaded node) as an intension, and an element (shaded node) as its extension. The tree is intended to also allow for the identification of monadic and polyadic classification structures. Hébert thinks of these as the difference between an element possessing a single class (monadic), or adhering to many classes (dyadic, triadic, n-adic) (Hébert 2007: 166).

Figure 3: 

Hébert’s (2007: 168) two disconnected finite rooted trees as a visualization of “Thematized classification in << Quelle affaire!>>.”
Figure 3:

Hébert’s (2007: 168) two disconnected finite rooted trees as a visualization of “Thematized classification in << Quelle affaire!>>.”

But we can also think of Hébert’s monadic and polyadic structures firstly within the realm of mathematical graph theory, and of finite directed graphs. This re-contextualization allows us to utilize the notion of a path. That is, given a finite directed graph (G, R), we call a path a finite sequence a 0, …a n (n ≥ 1) of elements (vertices) in G for which (a i , a i+1) ∈ R for all i, such that 0 ≤ i ≤ n. This allows us to subsequently introduce the notion of a finite rooted tree (Makinson 2020: 226).

Definition 2.1:

(Finite rooted tree): We define a finite rooted tree as the directed graph T = (G, R), where G is a set of vertices and R is a two place relation (a i , a i+1) over G. We call the root of G an element a, in which ∀x ∈ G such that a ≠ x, there is a unique path from a to x, but no path from a to itself.

Hébert’s monadic and polyadic structures are thus equivalent to the link-height in a finite rooted tree. That is to say that when we set the root to level 0, a monodic classification is a child of link-height 1, and a polyadic classification is a chid of link-height that is greater than 1. Consider the following directed graphs A (left) and B (right) that represent unlabelled finite rooted trees from Hébert’s example in Figure 3:

(4)

Here, Hébert’s tokens or elements are the colored vertices or leaves of the finite rooted trees, such that for both A and B we have link-heights of greater than 1 from leaf to root: that is, a polyadic structure. But in terms of what Hébert calls monoclassification and polyclassification, he argues that

one can distinguish between a ‘vertical’ polyclassification, which includes one or more encompassing classes (wolf < canines (subclass) < mammal (class)), and a ‘horizontal’ polyclassification, which is made at the same level of generality (human > werewolf < canines). The object being analyzed and/or the type of classification used in the act and/or the analysis of this act may allow for only single classifications of a single unit, or may admit multiple classifications. (Hébert 2007: 166)

Here, we can understand the distinction Hébert makes between a monoclassification and a polyclassification as the difference between a finite rooted tree and a complete lattice.

Definition 2.2:

(Complete Lattice): An ordered set L ( L , ) is a lattice, if for any two elements x and y in L, the supremum (greatest element) x ∨ y, and the infimum (least element) x ∧ y always exist. L is called a complete lattice, if the supremum ⋁X, and the infinum ⋀X exist for any subset X of L. Every complete lattice L has a greatest element, ⋁L, or the unit element, 1 L , and a least element 0 L , the zero element.

Remark 1:

We see in (4) that a finite rooted tree is a structure in which each node of the tree has exactly one parent, and thus no two diverging paths ever meet – Hébert’s monoclassification. In contrast, a complete lattice is a structure in which any two nodes can be traced to greatest element or least element, which equates to what Hébert calls a polyclassification and the notion of classes and subclasses. Consider the following complete lattice A′:

for which we see that the least upper bound or join between the elements i and k is the element τ, while the greatest lower bound or meet is the zero element. In fact for any two elements in A′ there always can be found a meet or join in the form of two paths converging at the infimum 0 A or supremum 1 A .

(5)

In the following sections we will introduce the mathematics of lattice theory in order to move from finite rooted trees to ordered concept lattices. The advantage of this recontextualization is that we can succinctly express semiotic notions such as Hébert’s monoclassification and polyclassification using binary tables and their accompanying concept lattices, concept/subconcept relations, preconcepts constructions as well as attribute dependencies and attribute implications.

2.1 Formal concept analysis

Formal concept analysis (FCA) is a branch of mathematics pioneered by Rudolph Wille (1982) as a means in which to extend lattice theory. As Ganter and Wille (1999) contend, the basic notions of FCA center on a formal context and its formal concepts. These notions were developed in order to develop a system for formalizing “knowledge discovery” within any domain (Stumme et al. 1998: 451). FCA is a direct mathematization of ‘conventional’ concept through lexical fields such that concepts themselves are considered

cognitive acts and knowledge units potentially independent of language. Only if they are used to give meaning to linguistic expressions, they become so-called word concepts which are conventualized and incorporated. The meanings of words for an individuum presuppose conceptual knowledge of that individuum which turns linguistic expressions into signs for those concepts. (Wille 2005: 6)

Like Hébert’s recognition of the importance of considering how an intension of a term determines its extension, FCA provides a formalized method in which to study what Hébert calls classes and sub-classes, though in FCA these are known as superconcepts and subconcepts. Indeed the superconcept/subconcept relation in FCA was primarily influenced by how Frege (1952) identified the dual relationship between intension and extension and how each generates the other such that “the extension is the class of things in the world for which the intension is a true description” (Wilson and Keil 2001: 177). Below we introduce FCA through a number of standard definitions (Ganter and Wille 1999).

Definition 2.3:

(Formal Context): A formal context, denoted K , is a triple, (G, M, I), and consists of two disjoint sets; G, a set of objects, and M, a set of attributes as well as an incidence relation, I. An object g that has an attribute m, is denoted as gIm or (g, m) ∈ I.

Definition 2.4:

(Subcontext): If K ( G , M , I ) is a formal context, and if H ⊆ G and N ⊆ M, then K n ( H , N , I , H × N ) is a subcontext of K .

Definition 2.5:

(Apposition): Two formal contexts, K 1 ( G , M 1 , I 1 ) and K 2 ( G , M 2 , I 2 ) , contain the same set of objects, G, such that M 1 ∩ M 2 = . The apposition of K 1 and K 2 is denoted as K σ , such that:

(6) K 1 | K 2 ( G , M ̇ 1 M ̇ 2 , I ̇ 1 I ̇ 2 ) ,

for which M ̇ j { j } × M j and I ̇ j { ( ( j , g ) , ( j , m ) ) | ( g , m ) I j } for j ∈ {1, 2}.

Let us first consider the formal context K σ K 1 | K 2 given in Figure 4. Here we use Hébert’s elements, or leaves from his finite rooted trees of << Quelle affaire!>> in Figure 3 to construct G, a set of objects for which a “×” in the binary table of K σ indicates a incidence relation to a set of attributes M that correspond to what Hébert calls a collection of classes. In order to formalize the incidence relation of gIm in K σ , we relabel the classes so that they reflect in a similar manner how Greimas and Courtés (1979: 29–30) discuss classemes as “those semes which are recurrent in the discourse and which guarantee its isotopy.”

Figure 4: 
The formal context 




K


σ




${\mathbb{K}}_{\sigma }$



 as the apposition of formal contexts 




K


1




${\mathbb{K}}_{1}$



 and 




K


2




${\mathbb{K}}_{2}$



, whose objects and attributes are sourced from Hébert’s (2007: 168) two disconnected finite rooted trees that visualize the “Thematized classification in << Quelle affaire!>>” (c.f. Figure 3). The dashed line indicates the articulation of M
1 and M
2 such that M
1\coloneq {is an actant, is from culture, is a predator, is a person, preys on seals, preys on fish, is an anti-predator}, and M
2\coloneq {is from nature, is an animal, is terrestrial, is aquatic, is a fresh water habitat, lives in fresh water, lives in salt water, is prey, is a seal, is a fish}.
Figure 4:

The formal context K σ as the apposition of formal contexts K 1 and K 2 , whose objects and attributes are sourced from Hébert’s (2007: 168) two disconnected finite rooted trees that visualize the “Thematized classification in << Quelle affaire!>>” (c.f. Figure 3). The dashed line indicates the articulation of M 1 and M 2 such that M 1\coloneq {is an actant, is from culture, is a predator, is a person, preys on seals, preys on fish, is an anti-predator}, and M 2\coloneq {is from nature, is an animal, is terrestrial, is aquatic, is a fresh water habitat, lives in fresh water, lives in salt water, is prey, is a seal, is a fish}.

We construct K σ through two contexts K 1 and K 2 that share the object set G, though split Hébert’s classes into M 1 and M 2 such that M 1 ∩ M 2 = . This follows Hébert’s two original disjunct finite rooted trees as classifications of the oppositional classes: //culture// and //nature//. From K σ and its subcontexts K 1 and K 2 we can see that subsets of objects may share attributes and thus be considered formalized structures that form “cognitive acts and knowledge units potentially independent of language” (Wille 2005: 6). These units are called formal concepts and given some units may be contained in other units, leads to the notion of a partial order on a context and a hierarchy of concepts.

Definition 2.6:

(Formal Concept): A pair (A, B), with A ⊆ G and B ⊆ M, is a formal concept of a formal context, K . We call A the extent, and B the intent of the formal concept, such that A  = B and B  = A. The set of all formal concepts of the formal context K is notated as B ( G , M , I ) , for which we define the incidence relation as I = { A × B | ( A , B ) B ( G , M , I ) } .

Remark 2:

Given A ⊆ G, the derivation operator yields:

(7) A : = { m M | g A : g I m } ,

or the set of attributes common to the objects in A, while the operator yields:

(8) B : = { g G | m B : g I m } ,

which is the set of objects which have all attributes in B given B ⊆ M. Thus (A ↑↓ , A ) and (B , B ↓↑ ) are always concepts, and A ↑↓ is the smallest extent containing A. A context K thus always contains both a set of all extents, denoted U ( G , M , I ) and set of all intents I ( G , M , I ) . The intersection of intents is always another intent such that given an index set T, for each t ∈ T and A t  ⊆ G, then

(9) t T A t = t T A t ,

which is also true of attributes and the intersection of extents.

Definition 2.7:

(Superconcept/Subconcept): Given a pair of formal concepts, (A 1, B 1) and (A 2, B 2), we say (A 1, B 1) is a subconcept of (A 2, B 2) if A 1 ⊆ A 2 or dually (B 2 ⊆ B 1). This is formalized as the relation: (A 1, B 1) ≤ (A 2, B 2): ⇔A 1 ⊆ A 2(⇔B 1 ⊇ B 2). The pair (A 2, B 2) is thus a superconcept of (A 1, B 1). The set of all formal concepts of K , together with the order relation, ≤, is a concept lattice which is denoted as B ̲ ( K ) .

From our formal context K σ , consider the following two concepts, c 1 and c 2 found in the set of all formal concepts B ( K 1 ) :

(10) c 1 { baby seal, seal } , { preys on fish, is a predator, is an actant } ,

(11) c 2 { hunter, fisherman, baby seal, seal } , { is a predator, is an actant } .

We can see that given c 1 contains objects that are a subset of the objects of c 2 , we say that c 1 c 2 , or that c 1 is a subconcept of c 2 . This is more readily seen through a Hasse diagram found in Figure 5, and Figure 6. Here we can visualize the order (≤) on B ( K n ) that generates B ̲ ( K n ) . We find that the edges of a diagram that connect objects (whose labels are shaded and sit below vertices) to other vertices, some of which contain attributes (whose labels sit above vertices). The concept c 1 has an intent (upwards connecting edges) that we can denote using the derivation operator as:

(12) { baby seal, seal } { preys on fish, is a predator, is an actant } ,

while for c 2 this is:

(13) { hunter, fisherman, baby seal, seal } { is a predator, is an actant } ,

given that the vertices where all objects of c 2 meet through upwards paths are the attribute vertices {is a predator} and {is an actant}. Indeed, given that B ̲ ( K σ ) is isomorphic to a complete lattice L (Definition 2.2) through Ganter and Wille’s (1999: 20–21) proof of their basic theorem on concept lattices via the mappings γ ͞ : G L and μ ͞ : M L , we see there exists two types of concepts: object concepts and attribute concepts.

Figure 5: 
Hasse diagram of 




B

̲


(



K


1



)



$\underline{\mathfrak{B}}\left({\mathbb{K}}_{1}\right)$



.
Figure 5:

Hasse diagram of B ̲ ( K 1 ) .

Figure 6: 
Hasse diagram of 




B

̲


(



K


2



)



$\underline{\mathfrak{B}}\left({\mathbb{K}}_{2}\right)$



.
Figure 6:

Hasse diagram of B ̲ ( K 2 ) .

Definition 2.8:

(Object Concept/Attribute Concept): Let g be the object intent {m ∈ M} | {gIm} given g ∈ G, and m be the attribute extent {g ∈ G | gIm} given m ∈ M. The object concept (g ↑↓ , g ) is written as γ{g} and the attribute concept (m , m ↓↑ ) as μ{m}. Given the condition: gImγ{g} ≤ μ{m} we can also assert A = {g ∈ G | γ{g} ≤ (A, B)}, and B = {m ∈ M | (A, B) ≥ μ{m}}

There is then some relation between what Hébert (2007: 166) calls monoclassification and polyclassification within his finite rooted trees to object concepts and attribute concepts within a complete concept lattice. Consider the following concepts from B ̲ ( K 2 ) (Figure 6):

(14) γ { Newf’ ndland } : = ( Newf’ndland, land, stone, sand , { is terrestrial, is from nature } ) ,

(15) μ { is terrestrial } : = ( Natashquan, Newf’ ndland, land, stone, sand , { is terrestrial } ) .

What Hébert calls monoclassifications are concepts in the form μ{m}≔(m , m ↓↑ ) that have the smallest (empty) intents and largest extents: e.g., μ{is an actant} in B ̲ ( K 1 ) and μ { is from nature } , μ { is terrestrial } B ̲ ( K 2 ) . Duly, polyclassifications are any concepts that are subconcepts of these superconcepts such that | A | > 1 for a concept in the form (A, B).

In the case of the concepts γ{Newf’ndland}, γ{land}, γ{stone}, γ{sand}, we also have what Hébert (2007: 169) identifies as the isotopy /mineral/ given their intent has the attributes {is terrestrial, is from nature}. Similarly, what Hébert (2007: 169) identifies in << Quelle affaire!>> as the significance of the text “lady walking on the ice floe” as a mediating term to the oppositional semes /land/ and /sea/ is expressed in B ̲ ( K 2 ) through the superconcept/subconcept relation of μ{is from nature} ≤ (G, G ), where {land, sea} ∈ γ{is from nature}, and {lady} is an element of the concept with the largest extent (G, G ), or the supremum.

2.1.1 Nested lattices

Hébert also identifies in Vigneault’s poem the potential of classification to compare human predation and seal predation, and the parallel “between the recursivity of predations (man hunts the seal who hunts the fish) and the recursivity in the transmission of information (fish A tells B who tells C, ‘and so on down the line’)” (Hébert 2007: 169). In order to examine this aspect within the context of FCA we can firstly look more closely at the relation between the sub-lattices B ̲ ( K 1 ) and B ̲ ( K 2 ) in terms of G, and in respect to the complete lattice formed from K σ . This is achieved this through a tensor product of B ̲ ( K 1 ) and B ̲ ( K 1 ) which Ganter and Wille (1999) proved is isomorphic to a direct product of formal contexts, which is to say more generally that:

(16) B ̲ t T K t t T B ̲ ( K t ) .

Definition 2.9:

(Direct Product): The direct product of two formal contexts, K 1 ( G 1 , M 1 , I ) and K 2 ( G 2 , M 2 , I 2 ) produces the formal context K 1 × K 2 ( G 1 × G 2 , M 1 × M 2 , ) in which (g 1, g 2)▿(m 1, m 2): ⇔((g 1, m 1) ∈ I 1 ∧ (g 2, m 2) ∈ I 2).

Definition 2.10:

(Tensor Product): The tensor product of two complete lattices L 1 and L 2 is the formal concept lattice of the direct product of their contexts, that is, L 1 L 2 B ̲ ( L 1 × L 2 , L 1 × L 2 , ) such that (x 1, x 2)▿(y 1, y 2): ⇔(x 1, ≤ y 1) ∧ (x 2 ≤ y 2).

In Figure 7 we give the Hasse diagram of the tensor product of the two complete sublattices of B ̲ ( K σ ) such that the diagram expresses B ̲ ( G , M 1 , I G × M 1 ) as the outer lattice, for which each vertex contains B ̲ ( G , M 2 , I G × M 2 ) . In order to show which objects and their associated intents in K 2 intersect with K 1 , we shade these nodes and omit labels (c.f. with Figure 6).

Figure 7: 






B

̲


(



K


1



)

⊗


B

̲


(



K


2



)



$\underline{\mathfrak{B}}\left({\mathbb{K}}_{1}\right)\otimes \underline{\mathfrak{B}}\left({\mathbb{K}}_{2}\right)$



.
Figure 7:

B ̲ ( K 1 ) B ̲ ( K 2 ) .

The resultant tensor product of sublattices gives a clear indication as to the nature of Hébert’s oppositional construct of finite rooted trees based on the nature/culture distinction and the recursivity of predations. We can see this firstly through the fact that the intent (colored vertices) of the object subset {baby seal, seal} (//nature//) in B ̲ ( K 1 ) is part of the extent of the concept μ{preys on fish} in B ̲ ( K 2 ) , and that this concept has the object {fisherman} (//culture//) in its extent. This gives the relation: γ{fisherman} ≤ μ{preys on fish}, which further shows that both γ{fisherman} and γ{baby seal, seal} have the attribute {is a predator} in their intents. We also see from B ̲ ( K 2 ) and the vertices in B ̲ ( K 1 ) B ̲ ( K 2 ) described by the attributes {is an actant} and {preys on fish}, that both the objects {baby seal, seal} and the subset of objects that contains the species of fish, {smelt, sole, …, bullhead}, intersect in their intent at {is prey, is an animal, is aquatic, is from nature}. While in B ̲ ( K 2 ) both these object subsets are equal in terms of |{g} | (the cardinality of their intents), within B ̲ ( K 1 ) B ̲ ( K 2 ) because {smelt, sole, … ,bullhead}  = {is an actant}, and {baby seal, seal}  = {preys on fish, is a predator, is an actant}, we can think of γ{baby seal, seal} as more specific, and thus a key theme in << Quelle affaire!>>.

3 Semic analysis

In addition to FCA’s parallels to Hébert’s “analysis by classification,” we can also use it to visualize aspects of Rastier’s (1997) “semic analysis.” Rastier first proposed the approach within his theoretical framework of interpretive semantics, for which it can be described as the identification in a text or an image of semes and how they form larger collections as isotopies and molecules. Semic analysis thus seeks to determine not only the structures of such isotopies, but how semes relate to each other and iterate themselves to form molecules. Hébert (2020: 144) notes that semic analysis is a second generation synthesis of “European structural semantics as developed in the wake of Bréal and Saussure, then Hjelmslev, Greimas, Coseriu and Pottier.”

Hébert develops a particular methodology for semic analysis that allows Rastier’s larger theoretical framework to be easily applied to source texts. The method centers on the creation of various types of tables: heuristic semic tables, analytical semic tables and comprehensive semic tables. We focus on the analytical semic table, an example found below:

(17)

The table is primarily used in order to record actualizations of a given seme in a text that is intrinsic, or of interest for analysis.

If we reduce an analytical semic table further and ignore the Justification column as an annotation, then we have a mapping to a context K given that semes can be considered as m ∈ M and signifieds as g ∈ G for which a Boolean as gIm indicates a signified g has as attribute an m. Consider the context K 3 and a visualization of its complete concept lattice in Figure 9.

The context K 3 is a mapping from an analytical semic table Hébert (2020: 159–160) uses for an application of semic analysis on the isotopy /navigation/ in the poem The golden ship from 1899 by Émile Nelligan (Figure 8). Our context K 3 is clarified, that is to say that for any object g, h ∈ G for which g  = h , it always follows that g = h, and duly m  = n implies m = n such that (m, n) ∈ M. Our clarified context K 3 thus gives object equivalences, that is, signifiers are grouped according to a shared intent.

Figure 8: 
The poem The golden ship by Émile Nelligan (1960).
Figure 8:

The poem The golden ship by Émile Nelligan (1960).

The concept lattice B ̲ ( K 3 ) describes a structure we associate to the classification of semes Hébert gives regarding the isotopy /navigation/. Consider the following six formal concepts as significant semic structures that delineate intent and extent-relative concepts:

(18) c 1 : = ( G , { / n a v i g a t i o n / } ) ,

(19) c 2 : = ( vint, azure, treasures, Gulf, depths, Cypine , actualized seme, afferent seme, / n a v i g a t i o n / ) ,

(20) c 3 : = ( sunk, saliors, masts, seas, prow, reef, ocean, shipwreck, keel, Ship, flancs, ship, siren, t e m p e ̂ t e , actualized seme, inherent seme, / n a v i g a t i o n / ) ,

(21) c 4 : = ( G \ { a b y s s } , actualized seme, / n a v i g a t i o n / ) ,

(22) c 5 : = ( a b y s s , / n a v i g a t i o n / ) ,

(23) c 6 : = ( , M ) .

The largest concept c 1 is the isotopy itself as a descriptor of all objects (signifiers), with subconcepts below it that contain various subsets, while the smallest concept c 5 contains the single object {abyss} such that c 5 c 1 . The lattice provides what Greimas and Courtés (1979: 163) identify as the minimal context for an isotopy through a “joining together of at least two semic figures.” In B ̲ ( K 3 ) these figures are embodied in the afferent/inherent semic axis of c 2 c 3 and their intersection at {actualized seme, /navigation/}, which is what Hébert (2020: 146) notes as the “activation” of the context given there are no neutralizations or virtualizations present in the poem.

3.1 Preconcept lattices

We can further consider the example of the generalization of formal concepts as preconcepts. These smaller structures are subconcepts, and allow for the identification of the smallest semantic units associated to sentences (line combinations). Burgmann and Wille (2006: 80) first described preconcepts as a means in which to “mathematize the notion of a ‘preconcept’ which is used in Piaget’s cognitive psychology to explain the developmental stage between the stage of senso-motoric intelligence and the stage of operational intelligence.”

Definition 3.1:

(Preconcept lattice): We define a preconcept of a formal context (G, M, I) as the pair (A, B) such that A ⊆ G, and B ⊆ M, and A ⊆ B (⇔ A  ⊇ B), which is thus a generalization of the definition of a formal concept given in Definition 2.6. The set of all preconcepts of a formal context (G, M, I) is denoted by V ( G , M , I ) . Preconcepts are naturally ordered through

(24) ( A 1 , B 1 ) ( A 2 , B 2 ) A 1 A 2 B 1 B 2 ,

for which the ordered set of V ̲ ( G , M , I ) ( V ( G , M , I ) , ) is a complete lattice called the preconcept lattice such that:

(25) t T ( A t , B t ) = t t A t , t T B t and t T ( A t , B t ) = t t A t , t T B t ,

for all ( A t , B t ) V ( G , M , I ) ( t T ) .

Given that preconcepts are smaller units of meaning according to the condition A ⊆ B (⇔ A  ⊇ B), we firstly apply an operator V on K 3 from The golden ship in order to generate all preconcepts. We call V ( K ) ) a derived formal context such that:

(26) V ( K ) ( G ̇ M , G ̇ M , I ( \ G × M ) ) .

Wille (2004: 5) has previously proved that

(27) V ̲ ( G , M , I ) B ̲ ( G ̇ M , G ̇ M , I ( \ G × M ) ) .

That is, a complete protoconcept lattice is isomorphic to the lattice of a derived context.

Consider then the derived context V ( K 3 ) we provide in Figure 11. What we will call the atoms of its corresponding preconcept lattice B ̲ ( V ( K 3 ) ) given in Figure 10 are defined more generally as the preconcepts (, M \{m}) such that m ∈ M as well as the preconcepts ({g}, M) such that g ∈ G and {g}  = M. The coatoms are duly the preconcepts (G \{g}, ) such that g ∈ G as well as the preconcepts (G, {m}) such that m ∈ M and {m}  = G (Burgmann and Wille 2006: 81). We call the set of all atoms in a complete lattice J and the set of all coatoms M .

There exist preconcepts that are the images of subsets of J and M because atoms and coatoms are described through set complements. We indicate these images through the condition on a complete lattice L, where a is an element of A J ( L ) , and b is an element of B M ( L ) such that:

(28) a { x L | x a } ,

(29) b { x L | x b } .

Here, a prototypic object that we denote as ↖ a, is the image of a coatom, or the set complement of a single attribute in M, while a characteristic attribute as ↙ b, is an image of a set complement of a single object in G. Semantically we can think of these elements as the Boolean operations of negation¬” on a formal concept, or an opposition “⌙” (Wille 2004: 2–3):

(30) ¬ ( A , B ) ( G \ A , ( G , \ A ) ) ,

(31)

For example, the concept formed from the attribute ‘↙abyss’ in B ̲ ( V ( K 3 ) ) is equivalent to what Greimas and Courtés (1979: 60–61) call contradiction. Here, they describe ¬/abyss//abyss/ as an assignment of the binary present/absent. Regarding ↖-images, we use the example of ‘ ↖afferent seme,’ which is an opposition of the afferent seme type. Here an apposition is equivalent to what Hébert (2020: 146) describes as the virtualization of a seme: that is, an opposition to its actualization.

But from these conditions we also have subpreconcepts which we understand as representing the smallest units of meaning. Consider the first sentence across lines 1–2 of The golden ship in light of Hébert’s isotopy /navigation/:

There was a fine ship, carved from solid gold

With azure reaching masts, on seas unknown.

Let the set R≔coloneq {azure, ship, masts, seas} be a collection of signifieds in G of which we gave in K 3 (Figure 9a), and which we associate to lines 1–2 of the poem. In B ̲ ( V ( K 3 ) ) , there exists a subpreconcept that we label p 1 in Figure 10 such that

(32) p 1 ( G \ { a b y s s } , inherent seme , afferent seme , / n a v i g a t i o n / , a b y s s , actualized seme ) .

R is embedded in p 1 , such that its intent is the subset {actualized seme, ↙abyss, /navigation/}. As the smallest preconcept formed through R, p 1 is a coatom that semantically implies a type of negation of the signified ‘abyss’ in addition to pertaining to the features of an {actualized seme} and the signified as an element of the seme as isotopy /navigation/ (Figure 10). It is a subpreconcept to the preconcepts formed through the attributes {actualized seme}, { ↙abyss}, {/navigation/}. This shows the isotopy /navigation/ contains two large concepts μ{↙abyss} and μ{actualized seme} as features or preconceptual planes (Figure 11).

Figure 9: 
Formal context 




K


3




${\mathbb{K}}_{3}$



 and corresponding Hasse diagram 




B

̲


(



K


3



)



$\underline{\mathfrak{B}}\left({\mathbb{K}}_{3}\right)$



 of Hébert’s semic analysis of the isotopy /navigation/ from Émile Nelligan’s The golden ship.
Figure 9:

Formal context K 3 and corresponding Hasse diagram B ̲ ( K 3 ) of Hébert’s semic analysis of the isotopy /navigation/ from Émile Nelligan’s The golden ship.

Figure 10: 
Hasse diagram of the preconcept lattice 




B

̲


(

V

(



K


3



)


)



$\underline{\mathfrak{B}}\left(\mathbb{V}\left({\mathbb{K}}_{3}\right)\right)$



.
Figure 10:

Hasse diagram of the preconcept lattice B ̲ ( V ( K 3 ) ) .

Figure 11: 
The derived formal context of 


(
V

(



K


3



)



$\left(\mathbb{V}\left({\mathbb{K}}_{3}\right)$



).
Figure 11:

The derived formal context of ( V ( K 3 ) ).

3.2 Inter- and intra-semiotic isotopies

Hébert (2020: 163) also presents semic analysis through reduced analytical semic tables for tracking isotopies that occur within Réne Magritte’s 1930 oil painting La clef des songes (Key of Dreams). Magritte’s painting (Figure 12) is set out in a 6 × 2 grid in which various commonly encountered objects are depicted with labels that describe other objects that are seemingly unconnected. Hébert utilizes the example as a means to distinguish between the notion of intra-semiotic repetition, that is, when a molecule or semic iteration is for example limited to a text, to that of inter-semiotic repetition, or when a molecule or isotopy can be found activated both within a text and an accompanying image.

Figure 12: 
René Magritte La clef des songes (Key of Dreams), oil on canvas, 1930. The work comprises of 6 images (tokens) each accompanied by a word (signifier). Image 1 (top left): egg; word 1: l’Acacia (Acacia). Image 2 (top right): shoe; word 2: la Lune (moon). Image 3 (middle left): hat; word 3: la Neige (snow). Image 4 (middle right): candle; word 4: le Plafond (ceiling). Image 5 (bottom left): glass; word 5: l’Orage (storm). Image 6 (bottom right): hammer; word 6: le Désert (desert).
Figure 12:

René Magritte La clef des songes (Key of Dreams), oil on canvas, 1930. The work comprises of 6 images (tokens) each accompanied by a word (signifier). Image 1 (top left): egg; word 1: l’Acacia (Acacia). Image 2 (top right): shoe; word 2: la Lune (moon). Image 3 (middle left): hat; word 3: la Neige (snow). Image 4 (middle right): candle; word 4: le Plafond (ceiling). Image 5 (bottom left): glass; word 5: l’Orage (storm). Image 6 (bottom right): hammer; word 6: le Désert (desert).

In order to explore these notions in regards to FCA, we provide a map of Hébert’s semic table to a pair of complete contexts visualized in Figures 13 and 14. These ordered concept lattices demarcate Magritte’s La clef des songes into formal concepts after Hébert’s table for which B ̲ ( K 4 ) maps images (tokens), and B ̲ ( K 5 ) maps words (signifiers).

Figure 13: 
Hasse diagram of 




B

̲


(



K


4



)



$\underline{\mathfrak{B}}\left({\mathbb{K}}_{4}\right)$



.
Figure 13:

Hasse diagram of B ̲ ( K 4 ) .

Figure 14: 
Hasse diagram of 




B

̲


(



K


5



)



$\underline{\mathfrak{B}}\left({\mathbb{K}}_{5}\right)$



.
Figure 14:

Hasse diagram of B ̲ ( K 5 ) .

The Hasse diagrams provide a way in which to quickly locate intra-semiotic isotopies as semic molecules given that according to the definition by Rastier (2016: 499–500), a molecule is simply “a stable grouping of semantic features” that is structured in some way through a collection of semes. As an example consider the following attribute concept in the form (B , B) from B ̲ ( K 4 ) (Figure 13):

(33) { Image  3 ( hat ) , Image  2 ( shoe ) } , { /water protection/, /black/, /clothing/ } ,

which we equate to the semic molecule /water protection/ + /black/ + /clothing/ through its tokens, the images of a hat and a shoe in La clef des songes. The intent of these two tokens yields:

(34) ( { Image  3 ( hat ) , Image  2 ( shoe ) } ) /water protection/, /black/, /clothing/, /hot/, /familiar/, /solid/, /low/, /curved/, /container/, /liquid/, /culture/, /inedible/, /protective/, /concrete/, /inanimate/ .

Similarly in B ̲ ( K 5 ) (Figure 14) we have:

(35) { Word  4  “ceiling”, Word  6  “desert” } , { /container/, /hot/ } ,

with the following intent:

(36) ( { Word  4  “ceiling”, Word  6  “desert” } ) /container/, /hot/, /low/, /solid/, /NA/, /straight/, /inanimate/, /nature/, /brightness/, /concrete/ ) ,

as the semic molecule /container/ + /hot/ with signifiers “ceiling” (la Plafond) and “desert” (le Désert). But given we also have object concepts in the form (A, A ) such as found in (34) and (36) means that for large formal contexts with large intents, we would ideally like to identify subsets of M that are informed through a collection of primary attributes that are dependent on a secondary attribute(s). This would allow for a stricter definition of Rastier’s notion of the stability of a semic molecule through a reduction in the attribute set via a distinction between μ{m} concepts that contain equivalences (i.e., m≅m′ | (m, m′) ∈ M), and γ{g} concepts whose intents may not readily describe complete semic molecules – i.e., there may be other tokens or signifiers that satisfy parts of the attribute subset.

3.3 Attribute dependency formulas

In order to explore inter-semiotic isotopies between B ̲ ( K 4 ) and B ̲ ( K 5 ) we introduce Bĕlohlévek and Sklenár̆’s (2005) attribute-dependency formulas as a method for rule-based attribute reduction and concept exploration within each lattice.

Definition 3.2:

(Attribute-dependency formula): A formal concept (A, B) in (G, M, I) satisfies an attribute dependency formula (ADF), φ in the form mm 1 ⊔⋯ ⊔ m n if m, , m n  ∈ B. We let m be the secondary attribute and m 1, , m n be primary attributes. Given a formal concept ( A , B ) B ̲ ( G , M , I ) , we denote (A, B)⊧φ to mean that (A, B) satisfies φ.

Consider the set C { φ 1 , φ 2 } as a subset of all AFDs, in which we associate φ 1 to B ̲ ( K 4 ) , and φ 2 to B ̲ ( K 5 ) such that:

(37) φ 1 : = / w h i t e / ( / h o t / / l i q u i d / ) ( / l i q u i d / / d a m g e a b l e / ) ,

(38) φ 2 : = / w h i t e / ( /absence of water/ / c o l d / / i n a n i m a t e / )

(39) ( / s o l i d / / f a m i l i a r / ) .

Here, we will to focus on the seme /white/ and the nominated dependent semes as they associate to the tokens (objects) {Image 1 (egg)} and {Image 4 (candle)} in B ̲ ( K 4 ) as well as signifiers {Word 3 ‘snow’ la Neige} and {Word 2 ‘moon’ la Lune} in B ̲ ( K 5 ) . As Bĕlohlévek and Sklenár̆ (2005: 180) note, in general, we can consider expressions within ADFs as terms over B in the form yt(y 1, …y n ). Here, we designate each attribute m ∈ M as a term, in addition to identifying terms through Booleans such as (t 1 ⊔ t 2). For example, we see in (38) that (/solid/ ⊓/familiar/) can be expressed as/concrete/(/solid/ ⊓/familiar/) given {/solid/, /familiar/}  = {/concrete/}.

Because the seme (attribute) /white/ is common to both concept lattices, we use the ADFs above in order to construct a dependency, and thus seek out concepts in both lattices for which given the seme /white/, we also expect in φ 1 the molecule /concrete/(/liquid/ ⊓/damageable/) as well as the molecule /concrete/(/solid/ ⊓/familiar/) in φ 2. We can then express the ADFs as the finite rooted trees T(φ 1):and T(φ 2):

(40)

(41)

We denote the formal contexts built from these trees as K φ 1 and K φ 2 whose attributes are subsets of K 4 + K 5 . Here we mean that for each term t in C there exists a corresponding attribute m in (M 4 ∪ M 5). In order to model concepts that are associated to both tokens and signifiers in Key to Dreams, we glue these two subcontexts through a subposition.

Definition 3.3:

(Subposition): Two formal contexts, K 1 ( G 1 , M , I 1 ) and K 2 ( G 2 , M , I 2 ) , contain the same set of attributes, M, such that G 1 ∩ G 2 = . The subposition of K 1 and K 2 is denoted as K θ , such that:

(42) K θ ( G ̇ 1 G ̇ 2 , M , I ̇ 1 I ̇ 2 ) ,

for which G ̇ j { j } × G j and I ̇ j { ( ( j , g ) , ( j , m ) ) | ( g , m ) I j } for j ∈ {1, 2}.

In Figure 15 we give the clarified context K θ C of the subposition of contexts K φ 1 and  K φ 2 as well as its corresponding concept lattice. The lattice shows both semic molecules that are intra-semiotic and inter-semiotic in Key to Dreams. Consider the following intra-semiotic concept within the set of signifiers in the form (A, B):

(43) c 1 ( Word  2 : ‘moon’  l a    L u n e , Word  3 : ‘snow’  l a    N e i g e , /cold/, /inanimate/, /familiar/, /solid/, /white/, /concrete/ ) ,

and its corresponding intra-semiotic concept within the set of tokens:

(44) c 2 ( Image  4 :  ( candle ) , Image  1 :  ( egg ) , /hot/, /liquid/, /damageable/, /familiar/, /solid/, /white/, / c o n c r e t e / ) .

Figure 15: 
Formal context 




K




θ


C






${\mathbb{K}}_{{\theta }_{\mathcal{C}}}$



 and corresponding Hasse diagram 




B

̲


(



K




θ


C





)



$\underline{\mathfrak{B}}\left({\mathbb{K}}_{{\theta }_{\mathcal{C}}}\right)$



.
Figure 15:

Formal context K θ C and corresponding Hasse diagram B ̲ ( K θ C ) .

These two intra-semiotic isotopies are themselves subconcepts to formal concepts formed at the nodes labelled with the attributes {/inanimate/} and {/damageable/, /liquid/} in B ̲ ( K θ C ) :

(45) c 3 : = ( Image  4 :  ( candle ) , Word  2 : ‘moon’  l a    L u n e , Word  3 : ‘snow’  l a    N e i g e , /inanimate/, /familiar/, /solid/, /white/, /concrete/ ) ,

(46) c 4 : = ( Image  4 :  ( candle ) , Image  1 :  ( egg ) , Word  3 : ‘snow’  l a    N e i g e , /liquid/, /damageable/, /familiar/, /solid/, /white/, / c o n c r e t e / ) .

The formal concepts c 3 and c 4 are thus two inter-semiotic molecules as superconcepts ( c 1 c 3 , and c 2 c 4 ) that cover a subset of signifiers and tokens in Key to Dreams. These two molecules have a greatest lower bound as the subconcept c 0 (Figure 15):

(47) c 0 ( Image  4 :  ( candle ) , Word  3 : ‘snow’  l a    N e i g e , / i n a n i m a t e / , /damageable liquid/, / f a m i l i a r / , / s o l i d / , / w h i t e / , / c o n c r e t e / ) ,

which we contend is the smallest and most generalized expression of the inter-semiotic molecule in Key to Dreams obtained through an ADF restriction on the seme {/white/}.

3.4 Attribute implications

The use of ADFs to assist in constructing subconcept/superconcept relations between molecules also points towards how we can parse implications from a concept lattice in order to establish /seme/ → /seme/ structures that define a semic molecule’s structure.

Definition 3.4:

(Attribute Implication): An implication over M is denoted as X → Y, where X, Y ⊆ M. An implication that is valid in K is denoted as K X Y , if X  ⊆ Y , that is, each object in K that possesses all attributes in X, also possesses all attributes in Y. An implication set, P , is valid in K if all implications in P are also valid in K .

Although Hébert does not discuss implications directly within Rastier’s framework of interpretive semiotics, Greimas and Courtés (1979: 152) equate implications to presuppositions. That is, they are envisaged as “logically prior to implication: the ‘if’ would not find its ‘then,’ if the latter did not already exist as the presupposed.” Within the framework of FCA, implications are element/subset relations that emerge from the intent of the formal contexts.

For example, in the concept lattice B ̲ ( K θ C ) (Figure 15), the two inter-semiotic molecules we identified as c 3 and c 4 contain the following attribute (seme) implications respectively:

(48) { /absence of water/, /cold/ } { / i n a n i m a t e / } ,

(49) { / h o t / } { /damageable/, /liquid/ } ,

such that both sets of implications also imply {/white/}. But we can further cross-reference these implications as they pertain more generally to the lattices B ̲ ( K 4 ) (Figure 13) and B ̲ ( K 5 ) (Figure 14) to find further implications such as:

(50) ( { / h o t / } { /solid/, /low/ } ) B ̲ ( K 4 ) ,

(51) ( { /absence of water/ } { /weather/, /nature/ } ) B ̲ ( K 5 ) .

We also find from our earlier example in Equation (33) of the semic molecule /water protection/ + /black/ + /clothing/ from the tokens {Image 3 (hat), Image 2 (shoe)} that:

(52) { /water protection/, /black/, /clothing/ } { /container/, /liquid/, /hot/ } .

4 Conclusions

In this article we have introduced various mathematical formalisms to describe semiotic structures within the framework of “analysis by classification” and “semic analysis.” We firstly introduced Hébert’s disconnected finite rooted trees for the description of thematized classification in Vigneault’s <<Quelle affaire!>>, and by proposing structure-preserving maps to the formal contexts K 1 and K 2 and their ordered concept lattices, we introduced the utility of FCA for visualizing and reasoning on semiotic structures.

We showed in <<Quelle affaire!>> how Hébert’s notion of monoclassification equates to superconcepts in the concept lattices B ̲ ( K 1 ) and B ̲ ( K 2 ) in the form μ{m}≔(m , m ↓↑ } that have small intents (i.e., | A | = 1) and large extents. Duly, polyclassifications equate to subconcepts under the condition | A | > 1 for any formal concept (A, B). This also led us to utilize the tensor product of lattices to generate B ̲ ( K 1 ) B ̲ ( K 2 ) to track the recursivity of predations and oppositional dynamics between the semantic classes of //nature// and //culture//. Here we showed that in <<Quelle affaire!>>, the intersection between these semantic classes is readily visualized in the nested lattice through the activated concepts γ{fisherman} (//culture//) and γ{baby seal, seal} (//nature//) given they share an intent that contains the attribute {is a predator}.

This led us to further consider the structure of isotopies in The golden ship by Émile Nelligan. Here, we used FCA to firstly map Hébert’s analytic semic table of the poem to a formal context K 3 and its accompanying concept lattice. Using the lattice we identified important formal concepts of the isotopy /navigation/, in particular, an afferent/inherent seme axis associated to the concepts c 1 and c 2 , and their intersection at the attributes {actualized seme, /navigation/}, which equates to what Hébert calls an activation within the narrative plane. We then introduced preconcept lattices via the derived formal context V ( K 3 ) ) and the condition A ⊆ B (⇔ A  ⊇ B), and showed how the notion of negation (¬) and opposition [Ieqn2] within preconcept lattice constructions mirror what Greimas identifies as contradiction and Hébert identifies as virtualization.

Our final application of FCA considered Hébert’s analysis of inter- and intra-semiotic molecules within Réne Magritte’s La clef des songes (Key of Dreams). We constructed the formal contexts K 4 and K 5 and their accompanying concept lattices from an analytic semic table forwarded by Hébert in order to examine Rastier’s notion of stability of semantic features within a set of tokens (images) and signifiers (words) within La clef des songes. In order to formalize the structure of inter- and intra-semiotic molecules within the art work, we introduced ADFs in order to track attribute relations. We then used the concept lattice B ̲ ( K θ C ) as a means to visualize both the intent and extent of the two types of molecules built from attribute dependencies of the seme /white/. The concept lattice visualized the molecules both in the domain of the signifiers and tokens as well as their intersection at the objects {Image 4: (candle)} and {Word 3: ‘snow’ la Neige}. The use of ADFs also highlighted how attribute implications within our constructed concept lattices point towards what Greimas and Courtés call presuppositions between semes.

We consider these insights and formalisms as scaffolds to the discourse offered by Rastier and Hébert regarding semic analysis and analysis by classification, which in turn has highlighted how their approach closely aligns with the original aim of the Greimas semiotics project. That is to say that for Greimas, structural semiotics is a method concerned with a rigor and precision that is expressed through a mathematic-like terminology which can generate formalisms as well rules that identify structural equivalences. We have sought to identify with these same concerns in this article through extending these abstractions by drawing directly from the language of mathematics. But contrary to a desire to obfuscate, our motivation has been to provide a syntax for an interdisciplinary methodology that unites important previous contributions in the fields of structural semiotics and lattice theory in the pursuit of a theory of semantics beyond textual linguistics.


Corresponding author: Michael D. Fowler, Technische Universität Berlin, Berlin, Germany, E-mail:

References

Bĕlohlévek, Radim & Vladimí Sklenár̆. 2005. Formal concept analysis constrained by attribute-dependency formulas. In Bernhard Ganter & Robert Godin (eds.), Formal concept analysis: Third international conference, ICFCA 2005, Lens, France, february 14–18, 2005. Proceedings, 176–191. Berlin: Springer-Verlag.Search in Google Scholar

Burgmann, Christian & Rudolph Wille. 2006. The basic theorem on preconcept lattices. In Bernhard Ganter, Gerd Stumme & Rudolf Wille (eds.), Formal concept analysis: Lecture notes in computer science, 80–88. Berlin: Springer-Verlag.10.1007/11671404_5Search in Google Scholar

Frege, Gottlob. 1952. Translations from the philosophical writings of Gottlob Frege, Peter Geach & Max Black (eds. & trans.). Oxford: Blackwell.Search in Google Scholar

Ganter, Bernhard & Rudolph Wille. 1999. Formal concept analysis, mathematical foundations. New York: Springer Science & Business Media.10.1007/978-3-642-59830-2Search in Google Scholar

Greimas, Algirdas Julien. 1983. Structural semantics: An attempt at a method. Lincoln: University of Nebraska Press.Search in Google Scholar

Greimas, Algirdas Julien. 1987. On meaning: Selected writings in semiotic theory, vol. 38 Theory and History of literature. Minneapolis: University of Minnesota.Search in Google Scholar

Greimas, Algirdas Julien & Joseph Courtés. 1979. Semiotics and language: An analytical dictionary, Larry Crist, Daniel Patte, James Lee, Edward McMahon II, Gary Phillips & Michael Rengstorf (trans.). Bloomington: Indiana University Press.Search in Google Scholar

Greimas, Algirdas Julien & François Rastier. 1968. The interaction of semiotic constraints. Yale French Studies 41. 86–105. https://doi.org/10.2307/2929667.Search in Google Scholar

Hébert, Louis. 2007. Dispositifs pour l’analyse des textes et des images, 3rd edn. Limoges: Presses de l’Université de Limoges. Avialable at: https://www.signosemio.com/documents/Louis-Hebert-Tools-for-Texts-and-Images.pdf.Search in Google Scholar

Hébert, Louis. 2020. An introduction to applied semiotics: Tools for text and image analysis. London: Routledge.10.4324/9780429329807Search in Google Scholar

Levi-Strauss, Claude. 1955. The structural study of myth. Journal of American Folklore 68. 428–444. https://doi.org/10.2307/536768.Search in Google Scholar

Makinson, David. 2020. Sets, logic and maths for computing. New York: Springer International.10.1007/978-3-030-42218-9Search in Google Scholar

Marrone, Gianfranco. 2022. Introduction to the semiotics of the text. Berlin: Walter de Gruyter GmbH.10.1515/9783110688986Search in Google Scholar

Nelligan, Émile. 1960. Selected poems, Paul F. Widdows (trans.). Toronto: Ryerson Press.Search in Google Scholar

Rastier, François. 1997. Meaning and textuality, Frank Collins & Paul Perron (trans.). Toronto: University of Toronto Press.10.3138/9781442664838Search in Google Scholar

Rastier, François. 2016. Interpretive semantics. In Nick Riemer (ed.), The Routledge handbook of semantics, 491–506. London: Routledge.Search in Google Scholar

Saussure, Ferdinand de. 1983. Course in general linguistics, Charles Bally & Albert Sechehaye (eds.), Roy Harris (trans.). La Salle, IL: Open Court.Search in Google Scholar

Stumme, Gerd, Rudolf Wille & Uta Wille. 1998. Conceptual knowledge discovery in databases using formal concept analysis methods. Principles of Data Mining and Knowledge Discovery. 450–458. https://doi.org/10.1007/bfb0094849.Search in Google Scholar

Vigneault, Gilles. 1998. Quelle affaire! In L’armoire des jours, 147–148. Montréal: Nouvelles Éditions de l’Ar.Search in Google Scholar

Wille, Rudolph. 1982. Restructuring lattice theory: An approach based on hierarchies of concepts. In Ivan Rival (ed.), Ordered sets, 445–470. Boston: Reidel.10.1007/978-94-009-7798-3_15Search in Google Scholar

Wille, Rudolf. 2004. Preconcept algebras and generalized double boolean algebras. In Peter Eklund (ed.), Concept lattices, 1–13. Berlin: Springer Berlin Heidelberg.10.1007/978-3-540-24651-0_1Search in Google Scholar

Wille, Rudolph. 2005. Formal concept analysis as mathematical theory of concepts and concept hierachies. In Bernhard Ganter, Gerd Stumme & Rudolf Wille (eds.), Formal concept analysis: Foundations and applications, 1–34. Berlin: Springer-Verlag.10.1007/11528784_1Search in Google Scholar

Wilson, Robert Andrew & Frank C. Keil. 2001. The MIT encyclopedia of the cognitive sciences. Boston: MIT Press.Search in Google Scholar

Received: 2023-03-15
Accepted: 2024-09-13
Published Online: 2024-11-13
Published in Print: 2024-11-26

© 2024 the author(s), published by De Gruyter, Berlin/Boston

This work is licensed under the Creative Commons Attribution 4.0 International License.

Downloaded on 6.2.2026 from https://www.degruyterbrill.com/document/doi/10.1515/sem-2023-0037/html
Scroll to top button