scholarly journals Parallel Syntactic Annotation in CReST

2012 ◽  
Vol 7 ◽  
Author(s):  
Sandra Kübler ◽  
Eric Baucom ◽  
Matthias Scheutz
Keyword(s):  
Natural Language ◽  
Search Task ◽  
Categorial Grammar ◽  
Speech Signals ◽  
High Quality ◽  
Combinatory Categorial Grammar ◽  
Dialogue Structure ◽  
Syntactic Annotation ◽  
Grammar Formalisms

In this paper, we introduce the syntactic annotation of the CReST corpus, a corpus of natural language dialogues obtained from humans performing a cooperative, remote search task. The corpus contains the speech signals as well as transcriptions of the dialogues, which are additionally annotated for dialogue structure, disfluencies, and for syntax. The syntactic annotation comprises POS annotation, Penn Treebank style constituent annotations, dependency annotations, and combinatory categorial grammar annotations. The corpus is the first of its kind, providing parallel syntactic annotation based on three different grammar formalisms for a dialogue corpus. All three annotations are manually corrected, thus providing a high quality resource for linguistic comparisons, but also for parser evaluation across frameworks.

Categorial Grammar

Linguistics ◽  
2019 ◽  
Author(s):  
Glyn Morrill
Keyword(s):  
Natural Language ◽  
Language Processing ◽  
Modus Ponens ◽  
Categorial Grammar ◽  
Substructural Logic ◽  
Grammatical Structure ◽  
Rewriting Systems ◽  
Categorial Grammars ◽  
History Of ◽  
Grammar Formalisms

The term “categorial grammar” refers to a variety of approaches to syntax and semantics in which expressions are categorized by recursively defined types and in which grammatical structure is the projection of the properties of the lexical types of words. In the earliest forms of categorical grammar types are functional/implicational and interact by the logical rule of Modus Ponens. In categorial grammar there are two traditions: the logical tradition that grew out of the work of Joachim Lambek, and the combinatory tradition associated with the work of Mark Steedman. The logical approach employs methods from mathematical logic and situates categorial grammars in the context of substructural logic. The combinatory approach emphasizes practical applicability to natural language processing and situates categorial grammars within extended rewriting systems. The logical tradition interprets the history of categorial grammar as comprising evolution and generalization of basic functional/implicational types into a rich categorial logic suited to the characterization of the syntax and semantics of natural language which is at once logical, formal, computational, and mathematical, reaching a level of formal explicitness not achieved in other grammar formalisms. This is the interpretation of the field that is being made in this article. This research has been partially supported by MINICO project TIN2017–89244-R. Thanks to Stepan Kuznetsov, Oriol Valentín and Sylvain Salvati for comments and suggestions. All errors and shortcomings are the author’s own.

scholarly journals Lexicalization and Generative Power in CCG

2015 ◽  
Vol 41 (2) ◽  
pp. 215-247 ◽  
Author(s):  
Marco Kuhlmann ◽  
Alexander Koller ◽  
Giorgio Satta
Keyword(s):  
Categorial Grammar ◽  
Linguistic Variation ◽  
Weak Equivalence ◽  
Generative Power ◽  
Context Sensitive ◽  
Combinatory Categorial Grammar ◽  
Tree Adjoining Grammar ◽  
Central Result ◽  
Grammar Formalisms

The weak equivalence of Combinatory Categorial Grammar (CCG) and Tree-Adjoining Grammar (TAG) is a central result of the literature on mildly context-sensitive grammar formalisms. However, the categorial formalism for which this equivalence has been established differs significantly from the versions of CCG that are in use today. In particular, it allows restriction of combinatory rules on a per grammar basis, whereas modern CCG assumes a universal set of rules, isolating all cross-linguistic variation in the lexicon. In this article we investigate the formal significance of this difference. Our main result is that lexicalized versions of the classical CCG formalism are strictly less powerful than TAG.

Combinatory Categorial Grammar for Computer-Assisted Language Learning

2012 ◽  
pp. 258-272
Author(s):  
Simon Delamarre ◽  
Maryvonne Abraham
Keyword(s):  
Natural Language ◽  
Language Learning ◽  
Categorial Grammar ◽  
Computer Assisted ◽  
Computer Assisted Language Learning ◽  
Software Applications ◽  
Combinatory Categorial Grammar ◽  
High Level ◽  
Syntactical Analysis ◽  
Short Presentation

This chapter intends to demonstrate how Applicative and Combinatory Categorial Grammar (ACCG) can be drawn on to design powerful software applications for the teaching of languages. To this end, the authors present some modules from their “pictographic translator,” software that performs syntactical analysis of sentences in natural language directly written by the user, and then dynamically displays series of pictograms that illustrate the words and structure of the user’s sentences. After a short presentation of the application and an introduction to ACCG, the chapter examines how this formalism enables the building of several high-level functions in the system, such as disambiguation, structure exhibition, and grammatical correction/validation. The chapter concludes with a short discussion concerning the potential (and limits) of this architecture with regards to multilingualism.

scholarly journals Strong Equivalence of TAG and CCG

2021 ◽  
Vol 9 ◽  
pp. 707-720
Author(s):  
Lena Katharina Schiffer ◽  
Andreas Maletti
Keyword(s):  
Expressive Power ◽  
Categorial Grammar ◽  
First Order ◽  
Context Sensitive ◽  
Combinatory Categorial Grammar ◽  
Tree Adjoining Grammar ◽  
Empty String ◽  
Grammar Formalisms

Tree-adjoining grammar (TAG) and combinatory categorial grammar (CCG) are two well-established mildly context-sensitive grammar formalisms that are known to have the same expressive power on strings (i.e., generate the same class of string languages). It is demonstrated that their expressive power on trees also essentially coincides. In fact, CCG without lexicon entries for the empty string and only first-order rules of degree at most 2 are sufficient for its full expressive power.

scholarly journals Human Annotated Dialogues Dataset for Natural Conversational Agents

2020 ◽  
Vol 10 (3) ◽  
pp. 762
Author(s):  
Erinc Merdivan ◽  
Deepika Singh ◽  
Sten Hanke ◽  
Johannes Kropf ◽  
Andreas Holzinger ◽  
...  
Keyword(s):  
Natural Language ◽  
Detailed Analysis ◽  
Human Perception ◽  
Natural Language Understanding ◽  
Industrial Applications ◽  
Benchmark Dataset ◽  
Conversational Agents ◽  
High Quality ◽  
Language Understanding ◽  
Major Drawback

Conversational agents are gaining huge popularity in industrial applications such as digital assistants, chatbots, and particularly systems for natural language understanding (NLU). However, a major drawback is the unavailability of a common metric to evaluate the replies against human judgement for conversational agents. In this paper, we develop a benchmark dataset with human annotations and diverse replies that can be used to develop such metric for conversational agents. The paper introduces a high-quality human annotated movie dialogue dataset, HUMOD, that is developed from the Cornell movie dialogues dataset. This new dataset comprises 28,500 human responses from 9500 multi-turn dialogue history-reply pairs. Human responses include: (i) ratings of the dialogue reply in relevance to the dialogue history; and (ii) unique dialogue replies for each dialogue history from the users. Such unique dialogue replies enable researchers in evaluating their models against six unique human responses for each given history. Detailed analysis on how dialogues are structured and human perception on dialogue score in comparison with existing models are also presented.

Category theory

2020 ◽  
pp. 19-38
Author(s):  
Ash Asudeh ◽  
Gianluca Giorgolo
Keyword(s):  
Natural Language ◽  
Category Theory ◽  
Categorial Grammar ◽  
Natural Language Semantics ◽  
Fundamental Notion ◽  
Language Semantics ◽  
Natural Transformations ◽  
Glue Semantics

This chapter aims to introduce sufficient category theory to enable a formal understanding of the rest of the book. It first introduces the fundamental notion of a category. It then introduces functors, which are maps between categories. Next it introduces natural transformations, which are natural ways of mapping between functors. The stage is then set to at last introduces monads, which are defined in terms of functors and natural transformations. The last part of the chapter provides a compositional calculus with monads for natural language semantics (in other words, a logic for working with monads) and then relates the compositional calculus to Glue Semantics and to a very simple categorial grammar for parsing. The chapter ends with some exercises to aid understanding.

Sign in / Sign up

Export Citation Format

Share Document