In grammar, a modifier is an optional element in phrase structure or clause structure. A modifier is so called because it is said to modify (change the meaning of) another element in the structure, on which it is dependent. Typically the modifier can be removed without affecting the grammar of the sentence. For example, in the English sentence This is a red ball, the adjective red is a modifier, modifying the noun ball. Removal of the modifier would leave This is a ball, which is grammatically correct and equivalent in structure to the original sentence.

Other terms used with a similar meaning are qualifier (the word qualify may be used in the same way as modify in this context), attribute, and adjunct. These concepts are often distinguished from complements and arguments, which may also be considered dependent on another element, but are considered an indispensable part of the structure. For example, in His face became red, the word red might be called a complement or argument of became, rather than a modifier or adjunct, since it cannot be omitted from the sentence.

Modifier may refer to:

See also

In linguistics, grammar is the set of structural rules governing the composition of clauses, phrases, and words in any given natural language. The term refers also to the study of such rules, and this field includes morphology, syntax, and phonology, often complemented by phonetics, semantics, and pragmatics.

Use of the term

The term grammar is often used by non-linguists with a very broad meaning. As Jeremy Butterfield puts it, "Grammar is often a generic way of referring to any aspect of English that people object to." However, linguists use it in a much more specific sense. Speakers of a language have a set of internalised rules for using that language. This is grammar, and the vast majority of the information in it is acquired—at least in the case of one's native language—not by conscious study or instruction, but by observing other speakers; much of this work is done during early childhood. Learning a language later in life usually involves a greater degree of explicit instruction.

Grammar

See also

In formal language theory, a grammar (when the context is not given, often called a formal grammar for clarity) is a set of production rules for strings in a formal language. The rules describe how to form strings from the language's alphabet that are valid according to the language's syntax. A grammar does not describe the meaning of the strings or what can be done with them in whatever context—only their form.

Formal language theory, the discipline which studies formal grammars and languages, is a branch of applied mathematics. Its applications are found in theoretical computer science, theoretical linguistics, formal semantics, mathematical logic, and other areas.

A formal grammar is a set of rules for rewriting strings, along with a "start symbol" from which rewriting starts. Therefore, a grammar is usually thought of as a language generator. However, it can also sometimes be used as the basis for a "recognizer"—a function in computing that determines whether a given string belongs to the language or is grammatically incorrect. To describe such recognizers, formal language theory uses separate formalisms, known as automata theory. One of the interesting results of automata theory is that it is not possible to design a recognizer for certain formal languages.Parsing is the process of recognizing an utterance (a string in natural languages) by breaking it down to a set of symbols and analyzing each one against the grammar of the language. Most languages have the meanings of their utterances structured according to their syntax—a practice known as compositional semantics. As a result, the first step to describing the meaning of an utterance in language is to break it down part by part and look at its analyzed form (known as its parse tree in computer science, and as its deep structure in generative grammar).