Literal movement grammar¶
A grammar formalism that passes displaced strings through predicate arguments and bindings.
Core Idea¶
A literal movement grammar (LMG) is a formal grammar extending context-free rewriting with predicate arguments and item semantics for binding and later checking terminal-word material. A captured string can be passed down a derivation and recognized at another structural position. This is a precise rule formalism, not every linguistic theory that speaks of movement. Individual productions need not use every available item type, and a conventional CFG can be embedded as an arity-zero limiting case without making the two formalisms equal.
Groenink's 1995 paper gives a compact grammar that derives aabbcc within the non-context-free a^n b^n c^n language. It separately analyzes Dutch verb and object displacement with argument passing, motivated in part by cross-serial dependencies. The first is a formal capacity witness; the second is an attested linguistic analysis, not proof of universal natural-language coverage or practical parser speed. A generated string is not the grammar that yields it. The portable parent is Formal System—symbols, start expression and mechanical rules—while binding/slash semantics and the grammar-language distinction define the narrower LMG.
Scope of Application¶
These uses separate formal derivability from claims about linguistic adequacy.
- Formal-language theory. Analyze derivations and expressive power of the argument-passing grammar class.
- Computational linguistics. Model selected extraposition and cross-serial dependencies with explicit rule semantics.
- Grammar comparison. Contrast the arity-zero CFG subset with movement-item extensions.
- Parsing research. Study restricted LMG subclasses and their recognition properties without equating them to every implementation.
Clarity¶
Identify the start predicate, argument patterns, binding/slash items and licensed derivation. Tree-adjoining grammar is the nearest different formalism: it can model related discontinuity through tree adjunction, not LMG item semantics. CFGs embed as an arity-zero case. Separate the grammar artifact, a generated string and any claim about natural-language adequacy.
Manages Complexity¶
Displaced constituents create dependencies between distant positions. LMGs carry terminal-word information in predicate arguments so a formal derivation can defer and later check that information instead of treating every movement link as an informal annotation. The simplification preserves exact rule semantics, but expressive power alone says neither which grammar best analyzes a language nor how fast every unrestricted case parses.
Abstract Reasoning¶
- Identify the grammar's symbol sets, start predicate and production rules.
- Check whether nonterminal arguments match or carry terminal-word patterns.
- Track binding and slash-item semantics where the derivation actually uses them.
- Distinguish an embedded arity-zero CFG case from the full LMG formalism.
- Check a claimed formal derivation separately from a claim about Dutch or another natural language.
Knowledge Transfer¶
Argument passing and deferred matching can inform comparison with other grammar formalisms, but the LMG name applies only to Groenink-style predicate-argument rewrite and item semantics. A bare CFG is an embedded subcase, not an equivalent formalism; a natural-language movement metaphor without formal rules is analogy. The carrier is a specified generative grammar, and the stopping boundary is its binding/slash derivation relation.
Relationships to Other Abstractions¶
Current abstraction Literal movement grammar Domain-specific
Parents (1) — more general patterns this builds on
-
Literal movement grammar is a kind of Formal System Prime
LMG has symbols, a start expression, explicit productions and mechanical derivations.
Hierarchy paths (2) — routes to 2 parentless roots
- Literal movement grammar → Formal System → Formalization → Representation → Abstraction
- Literal movement grammar → Formal System → Formalization → Transformation → Function (Mapping)
Neighborhood in Abstraction Space¶
Literal movement grammar sits in a crowded region of the domain-specific corpus (27th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Language Structure & Grammar Formalisms (23 abstractions)
Nearest neighbors
- Linear Grammar — 0.90
- Formal Syntax — 0.90
- Constraint Grammar — 0.89
- Meaning Postulate — 0.89
- Productivity (linguistics) — 0.88
Computed from structural-signature embeddings · 2026-10-08