Language Structure & Grammar Formalisms

← Back to Domain-Specific Families

Abstractions about the formal and social structure of language, including grammatical formalisms and syntactic theory (formal syntax, constraint grammar, lexicalist hypothesis), units and patterns within a language (bound variable, multiword expression, bare nouns), and connotative or stylistic devices (connotation, scare quotes, catachresis).

23 abstractions in this family — domain-specific abstractions that sit near one another in structural-signature space (k-means over structural-signature embeddings). Each is shown with its short description.

• Alphabet — A conventional segmental writing system whose standardized letter inventory primarily represents phonemes, with consonant and vowel treatment distinguishing alphabets from abjads and abugidas in narrow typology.
• Artistic Control — The recognized right to make binding creative decisions about a cultural work's form or release within a defined production scope, such as a film's final cut.
• Bare Nouns — Noun expressions that appear without an overt determiner, whose allowed positions and generic, existential, kind-level, or other interpretations depend on language-specific syntax and semantics.
• Bound variable — A variable occurrence governed by a quantifier, function parameter, summation, integral, or other binder within its specified scope.
• Catachresis — Markedly nonconventional application of a word or phrase, whether a semantic misuse or a deliberately strained rhetorical figure.
• Commonplace book — A personal, retrievable collection of selected passages and notes assembled for later use rather than chronological self-narration.
• Connotation — The evaluative or associative meaning a word evokes beyond its basic reference in context.
• Constraint Grammar — A rule-based language-analysis method that uses contextual constraints to disambiguate token readings and assign linguistic tags.
• Content Analysis — Systematic coding of a defined communication corpus to examine its content patterns.
• Eye Vein Verification — Biometric verification of a claimed identity by comparing an eye-vein pattern image with an enrolled template.
• Formal Syntax — A formal syntax is a finite or recursively specified system of symbols, lexical classes, formation and combination rules, delimiters, precedence, scope, and parse conventions that determines which expressions in a formal or programming language are well formed and how their structural organization is recovered.
• Glossematics — Hjelmslev and Uldall's formal structural theory of language, analyzing expression and content as parallel planes composed of minimal glossemes and defined by networks of internal dependencies.
• Grammar — The patterned system governing forms and combinations in a natural-language variety, evidenced by its users.
• Lexicalist Hypothesis — A grammar hypothesis separating word-building from phrase syntax and restricting syntactic access to word-internal structure.
• Literal movement grammar — A grammar formalism that passes displaced strings through predicate arguments and bindings.
• Multiword Expression — A conventional sequence of two or more lexemes whose meaning, syntax, selection, or use is partly idiosyncratic relative to ordinary composition.
• Phonics — Literacy instruction linking written letter patterns to speech sounds for decoding and spelling.
• Poetic Form — A poetic form is a repeatable organization of verse whose recognizable identity arises from constraints or conventions governing such features as line, meter, rhythm, rhyme, stanza, sequence, recurrence, voice, or prescribed progression.
• Productivity (linguistics) — The degree to which a language's grammatical pattern can extend to newly formed expressions.
• Regular Expression — A pattern language for denoting and matching sets of strings, classically equivalent to finite automata but extended by engine-specific constructs with distinct semantics and complexity.
• Scare Quotes — Quotation marks around a term that cue a writer's contextual distance from its ordinary or endorsed use, rather than necessarily quoting speech.
• Smallest grammar problem — Find the least-cost straight-line grammar that generates exactly one specified string.
• Substring — A string value occurring as a contiguous factor of a host, including the empty value by convention.