Comparison (grammar)

Comparison is a feature in the morphology or syntax of some languages, whereby adjectives and adverbs are inflected or modified to indicate the relative degree of the property defined by the adjective or adverb.

The grammatical category associated with comparison of adjectives and adverbs is degree of comparison. The usual degrees of comparison are the positive, which simply denotes a property (as with the English words big and fully); the comparative, which indicates greater degree (as bigger and more fully); and the superlative, which indicates greatest degree (as biggest and most fully). Some languages have forms indicating a very large degree of a particular quality (called elative in Semitic linguistics). Other languages (e.g. English) can express lesser degree, e.g. beautiful, less beautiful, least beautiful.

Formation of comparatives and superlatives

Comparatives and superlatives may be formed morphologically, by inflection, as with the English and German -er and -(e)st forms, or syntactically, as with the English more... and most... and the French plus... and le plus... forms. Common adjectives and adverbs often produce irregular forms, such as better and best (from good) and less and least (from little/few) in English, and meilleur (from bon) and mieux (from the adverb bien) in French.

Grammar

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 (disambiguation)

Grammar

  • Grammar, the system of rules and principles for speaking and writing a natural language
  • A grammar, a linguistic description of the morphology and syntax of a natural language
  • A grammar, a style guide prescribing how to properly write and speak a natural language
  • A formal grammar in mathematics, logic, and theoretical computer science: a set of production rules for character strings in a constructed formal language (e.g. a programming language)
  • See also

  • Grammer (disambiguation)
  • Formal grammar

    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 syntaxa 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).

    Podcasts:

    PLAYLIST TIME:
    ×