HOME
*



picture info

Dynamic Syntax
Dynamic Syntax (DS) is a grammar formalism and linguistic theory whose overall aim is to explain the ''real-time'' processes of language understanding and production, and describe linguistic structures as happening step-by-step over time. Under the DS approach, syntactic knowledge is understood as the ability to incrementally analyse the structure and content of spoken and written language in context and in real-time. While it posits representations similar to those used in Combinatory categorial grammars (CCG), it builds those representations left-to-right going word-by-word. Thus it differs from other syntactic models which generally abstract way from features of everyday conversation such as interruption, backtracking, and self-correction. Moreover, it differs from other approaches in that it does not postulate an independent level of syntactic structure over words. DS emerged in the late 1990s and early 2000s through the work of prominent figures such as Ruth Kempson, Ronnie Ca ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Grammar Formalism
In formal language theory, a grammar (when the context is not given, often called a formal grammar for clarity) describes how to form strings from a 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. A formal grammar is defined as a set of production rules for such strings in a formal language. Formal language theory, the discipline that 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 de ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

King's College London
King's College London (informally King's or KCL) is a public research university located in London, England. King's was established by royal charter in 1829 under the patronage of King George IV and the Duke of Wellington. In 1836, King's became one of the two founding colleges of the University of London. It is one of the oldest university-level institutions in England. In the late 20th century, King's grew through a series of mergers, including with Queen Elizabeth College and Chelsea College of Science and Technology (in 1985), the Institute of Psychiatry (in 1997), the United Medical and Dental Schools of Guy's and St Thomas' Hospitals and the Florence Nightingale School of Nursing and Midwifery (in 1998). King's has five campuses: its historic Strand Campus in central London, three other Thames-side campuses (Guy's, St Thomas' and Waterloo) nearby and one in Denmark Hill in south London. It also has a presence in Shrivenham, Oxfordshire, for its profession ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


European Summer School In Logic, Language And Information
The European Summer School in Logic, Language and Information (ESSLLI) is an annual academic conference organized by the European Association for Logic, Language and Information. The focus of study is the "interface between linguistics, logic and computation, with special emphasis on human linguistic and cognitive ability"."ESSLLI – Aims"
, ( Association for Logic, Language and Information website).
The conference is held over two weeks of the European Summer, and offers about 50 courses at introductory and advanced levels. It attracts around 500 participants from all over the world.


V ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  



picture info

SOAS University Of London
SOAS University of London (; the School of Oriental and African Studies) is a public research university in London, England, and a member institution of the federal University of London. Founded in 1916, SOAS is located in the Bloomsbury area of central London. SOAS is one of the world's leading institutions for the study of Asia, Africa, and the Middle East. Its library is one of the five national research libraries in the UK. SOAS also houses the Brunei Gallery, which hosts a programme of changing contemporary and historical exhibitions from Asia, Africa, and the Middle East with the aim of presenting and promoting cultures from these regions. SOAS is divided into three faculties: Faculty of Arts and Humanities, Faculty of Languages and Cultures, and Faculty of Law and Social Sciences. It is home to the SOAS School of Law, which is one of the leading law schools in the UK. The university offers around 350 bachelor's degree combinations, more than 100 one-year master's d ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

CC-BY Icon
A Creative Commons (CC) license is one of several public copyright licenses that enable the free distribution of an otherwise copyrighted "work".A "work" is any creative material made by a person. A painting, a graphic, a book, a song/lyrics to a song, or a photograph of almost anything are all examples of "works". A CC license is used when an author wants to give other people the right to share, use, and build upon a work that the author has created. CC provides an author flexibility (for example, they might choose to allow only non-commercial uses of a given work) and protects the people who use or redistribute an author's work from concerns of copyright infringement as long as they abide by the conditions that are specified in the license by which the author distributes the work. There are several types of Creative Commons licenses. Each license differs by several combinations that condition the terms of distribution. They were initially released on December 16, 2002, by ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Lambda Calculus
Lambda calculus (also written as ''λ''-calculus) is a formal system in mathematical logic for expressing computation based on function abstraction and application using variable binding and substitution. It is a universal model of computation that can be used to simulate any Turing machine. It was introduced by the mathematician Alonzo Church in the 1930s as part of his research into the foundations of mathematics. Lambda calculus consists of constructing § lambda terms and performing § reduction operations on them. In the simplest form of lambda calculus, terms are built using only the following rules: * x – variable, a character or string representing a parameter or mathematical/logical value. * (\lambda x.M) – abstraction, function definition (M is a lambda term). The variable x becomes bound in the expression. * (M\ N) – application, applying a function M to an argument N. M and N are lambda terms. The reduction operations include: * (\lambda x.M \rightarrow(\ ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Epsilon Calculus
Hilbert's epsilon calculus is an extension of a formal language by the epsilon operator, where the epsilon operator substitutes for quantifiers in that language as a method leading to a proof of consistency for the extended formal language. The ''epsilon operator'' and ''epsilon substitution method'' are typically applied to a first-order predicate calculus, followed by a showing of consistency. The epsilon-extended calculus is further extended and generalized to cover those mathematical objects, classes, and categories for which there is a desire to show consistency, building on previously-shown consistency at earlier levels. Epsilon operator Hilbert notation For any formal language ''L'', extend ''L'' by adding the epsilon operator to redefine quantification: * (\exists x) A(x)\ \equiv \ A(\epsilon x\ A) * (\forall x) A(x)\ \equiv \ A(\epsilon x\ (\neg A)) The intended interpretation of ϵ''x'' ''A'' is ''some x'' that satisfies ''A'', if it exists. In other words, ϵ''x' ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Generative Grammar
Generative grammar, or generativism , is a linguistic theory that regards linguistics as the study of a hypothesised innate grammatical structure. It is a biological or biologistic modification of earlier structuralist theories of linguistics, deriving ultimately from glossematics. Generative grammar considers grammar as a system of rules that generates exactly those combinations of words that form grammatical sentences in a given language. It is a system of explicit rules that may apply repeatedly to generate an indefinite number of sentences which can be as long as one wants them to be. The difference from structural and functional models is that the object is base-generated within the verb phrase in generative grammar. This purportedly cognitive structure is thought of as being a part of a universal grammar, a syntactic structure which is caused by a genetic mutation in humans. Generativists have created numerous theories to make the NP VP (NP) analysis work in nat ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

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 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 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 system with one basic operation, nam ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

SiSwati
The Swazi or siSwati language is a Bantu language of the Nguni group spoken in Eswatini and South Africa by the Swati people. The number of speakers is estimated to be in the region of 2.4 million. The language is taught in Eswatini and some South African schools in Mpumalanga, particularly former KaNgwane areas. Siswati is an official language of Eswatini (along with English), and is also one of the eleven official languages of South Africa. The official term is "siSwati" among native speakers; in English, Zulu, Ndebele or Xhosa it may be referred to as ''Swazi''. Siswati is most closely related to the other Tekela languages, like Phuthi and Northern Transvaal (Sumayela) Ndebele, but is also very close to the Zunda languages: Zulu, Southern Ndebele, Northern Ndebele, and Xhosa. Dialects Siswati spoken in Eswatini can be divided into four dialects corresponding to the four administrative regions of the country: Hhohho, Lubombo, Manzini, and Shiselweni. Siswat ...
[...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 ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]