|
Minimalist Grammar
Minimalist grammars are a class of formal grammars that aim to provide a more rigorous, usually proof-theoretic, formalization of Chomskyan Minimalist program In linguistics, the minimalist program is a major line of inquiry that has been developing inside generative grammar since the early 1990s, starting with a 1993 paper by Noam Chomsky. Following Imre Lakatos's distinction, Chomsky presents minima ... than is normally provided in the mainstream Minimalist literature. A variety of particular formalizations exist, most of them developed by Edward Stabler, Alain Lecomte, Christian Retoré, or combinations thereof. Lecomte and Retoré's extensions of the Lambek Calculus Lecomte and Retoré (2001) introduce a formalism that modifies that core of the Lambek Calculus to allow for movement-like processes to be described without resort to the combinatorics of Combinatory categorial grammar. The formalism is presented in proof-theoretic terms. Differing only slightly in notation ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Formal Grammar
A formal grammar is a set of Terminal and nonterminal symbols, symbols and the Production (computer science), production rules for rewriting some of them into every possible string of a formal language over an Alphabet (formal languages), alphabet. A grammar does not describe the semantics, meaning of the strings — only their form. In applied mathematics, formal language theory is the discipline that studies formal grammars and languages. Its applications are found in theoretical computer science, theoretical linguistics, Formal semantics (logic), formal semantics, mathematical logic, and other areas. A formal grammar is a Set_(mathematics), 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 grammatical ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Minimalist Program
In linguistics, the minimalist program is a major line of inquiry that has been developing inside generative grammar since the early 1990s, starting with a 1993 paper by Noam Chomsky. Following Imre Lakatos's distinction, Chomsky presents minimalism as a research program, program, understood as a mode of inquiry that provides a conceptual framework which guides the development of linguistic theory. As such, it is characterized by a broad and diverse range of research directions. For Chomsky, there are two basic Minimalist grammar, minimalist questions—What is language? and Why does it have the properties it has?—but the answers to these two questions can be framed in any theory.Boeckx, Cedric ''Linguistic Minimalism. Origins, Concepts, Methods and Aims'', pp. 84 and 115. Conceptual framework Goals and assumptions Minimalism is an approach developed with the goal of understanding the nature of language. It models a speaker's knowledge of language as a computational syste ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Edward Stabler
Edward Stabler is a Professor of Linguistics at the University of California, Los Angeles. His primary areas of research are (1) Natural Language Processing (NLP), (2) Parsing and formal language theory, and (3) Philosophy of Logic and Language. He was a member of the faculty at UCLA from 1984 to 2016. His work involves the production of software for minimalist grammars (MGs) and related systems. Early life and education Stabler received his Ph.D. from the Department of Linguistics and Philosophy at MIT The Massachusetts Institute of Technology (MIT) is a private research university in Cambridge, Massachusetts, United States. Established in 1861, MIT has played a significant role in the development of many areas of modern technology and sc ... in 1981. Recent publications *Edward Stabler (2011) Computational perspectives on minimalism. Revised version in C. Boeckx, ed, Oxford Handbook of Linguistic Minimalism, pp. 617–642. *Edward Stabler (2010) A defense of this ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lambek Calculus
Joachim "Jim" Lambek (5 December 1922 – 23 June 2014) was a Canadian mathematician. He was Peter Redpath Emeritus Professor of Pure Mathematics at McGill University, where he earned his PhD degree in 1950 with Hans Zassenhaus as advisor. Biography Lambek was born in Leipzig, Germany, where he attended a Gymnasium. He came to England in 1938 as a refugee on the ''Kindertransport''. From there he was interned as an enemy alien and deported to a prison work camp in New Brunswick, Canada. There, he began in his spare time a mathematical apprenticeship with Fritz Rothberger, also interned, and wrote the McGill Junior Matriculation in fall of 1941. In the spring of 1942, he was released and settled in Montreal, where he entered studies at McGill University, graduating with an honours mathematics degree in 1945 and an MSc a year later. In 1950, he completed his doctorate under Hans Zassenhaus becoming McGill's first PhD in mathematics. Lambek became assistant professor at Mc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Combinatory Categorial Grammar
Combinatory categorial grammar (CCG) is an efficiently parsable, yet linguistically expressive grammar formalism. It has a transparent interface between surface syntax and underlying semantic representation, including predicate–argument structure, quantification and information structure. The formalism generates constituency-based structures (as opposed to dependency-based ones) and is therefore a type of phrase structure grammar (as opposed to a dependency grammar). CCG relies on combinatory logic, which has the same expressive power as the lambda calculus, but builds its expressions differently. The first linguistic and psycholinguistic arguments for basing the grammar on combinators were put forth by Steedman and Szabolcsi. More recent prominent proponents of the approach are Pauline Jacobson anJason Baldridge In these new approaches, the combinator B (the compositor) is useful in creating long-distance dependencies, as in "Who do you think Mary is talking about?" and th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Formal Languages
In logic, mathematics, computer science, and linguistics, a formal language is a set of string (computer science), strings whose symbols are taken from a set called "#Definition, alphabet". The alphabet of a formal language consists of symbols that concatenate into strings (also called "words"). Words that belong to a particular formal language are sometimes called Formal language#Definition, ''well-formed words''. A formal language is often defined by means of a formal grammar such as a regular grammar or context-free grammar. In computer science, formal languages are used, among others, as the basis for defining the grammar of programming languages and formalized versions of subsets of natural languages, in which the words of the language represent concepts that are associated with meanings or semantics. In computational complexity theory, decision problems are typically defined as formal languages, and complexity classes are defined as the sets of the formal languages that ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
