Комбинаторная категориальная грамматика

In this paper we present a polynomial time pars- ing algorithm for Combinatory Categorial Grammar. The recognition phase extends the CKY algorithm for CFG. The process of generating a representation …...

In Combinatory Categnrial Grammar (CCG) [Ste90, Ste91], semantic function-argument structures are com- positionally produced through the course of a deriva- tion. These structures identify, inter alia, which enti- ties play …...

This paper presents a model for generating prosodically ap- propriate synthesized responses to database queries using Combinatory Categorial Grammar (CCG - cf. [22]), a for- malism which easily integrates the …...

Many theories of semantic interpretation use A-term manipulation to composition- ally compute the meaning of a sentence. These theories are usually implemented in a language such as Prolog that can …...

Under categorial grammars that have pow- erful rules like composition, a simple n-word sentence can have exponentially many parses. Generating all parses is ineffi- cient and obscures whatever true semantic …...

In relatively free word order languages, grammat- ical functions are intricately related to case mark- ing. Assuming an ordered representation of the predicate-argument structure, this work proposes a Combinatory Categorial …...

In relatively free word order languages, grammat- ical functions are intricately related to case mark- ing. Assuming an ordered representation of the predicate-argument structure, this work proposes a Combinatory Categorial …...

This paper describes a wide-coverage sta- tistical parser that uses Combinatory Cat- egorial Grammar (CCG) to derive de- pendency structures. The parser differs from most existing wide-coverage tree- bank parsers …...

This paper describes log-linear pars- ing models for Combinatory Categorial Grammar (CCG). Log-linear models can easily encode the long-range dependen- cies inherent in coordination and extrac- tion phenomena, which CCG …...

We extend Combinatory Categorial Grammar (CCG) with a generalized notion of multi- dimensional sign, inspired by the types of rep- resentations found in constraint-based frame- works like HPSG or LFG. …...

This paper describes and evaluates log-linear parsing models for Combinatory Categorial Grammar (CCG). A parallel implementation of the L-BFGS optimisation algorithm is described, which runs on a Beowulf cluster allowing …...

In this paper I outline Type-inheritance Combi- natory Categorial Grammar (TCCG), an imple- mented feature structure based CCG fragment of English. TCCG combines the fully lexical nature of CCG with …...

For speech synthesis systems that transform text materials into voice data, correctness and naturalness are the crucial measures of performance, the latter gaining more emphasis recently. In order to make …...

Efficient wide-coverage parsing is integral to large-scale NLP applications. Unfortu- nately, parsers for linguistically motivated formalisms, e.g. HPSG and TAG, are often too inefficient for these applications. This paper describes …...

We propose a solution to the annotation bottleneck for statistical parsing, by ex- ploiting the lexicalized nature of Combi- natory Categorial Grammar (CCG). The parsing model uses predicate-argument dependencies for …...

This paper presents a corpus-based ac- count of structural priming in human sen- tence processing, focusing on the role that syntactic representations play in such an account. We estimate the …...

. This paper investigates the nature of Japanese argument cluster (Steedman 2000b). Based on Combinatory Categorial Grammar, a type-raising analysis of case particles which captures some aspects of the information …...

Until quite recently, extending Phrase-based Statistical Machine Translation (PBSMT) with syntactic structure caused system per- formance to deteriorate. In this work we show that incorporating lexical syntactic de- scriptions in …...

. This paper deals with the complex verb formation of passive and potential predicates and syntactic structures projected by these verbs. Though both predicates are formed with the suffix -rare …...

. This paper describes desiderative constructions in Japanese with the main focus on ta(i) ‘want’ desideratives. In spite of the morphological one-word status, desiderative constructions have been claimed to have …...

Recent syntactic extensions of statisti- cal translation models work with a syn- chronous context-free or tree-substitution grammar extracted from an automatically parsed parallel corpus. The decoders ac- companying these extensions …...

. This paper offers a new analysis of the raising to object construction in Japanese. This has been extensively discussed following Kuno (1976) for the case where the ma- trix …...

Recent research has shown that Phrase- Based Statistical Machine Translation (PB-SMT) systems can benefit from two enhancements: (i) using words and POS tags as context-informed features on the source side; …...

The definition of combinatory categorial grammar (CCG) in the literature varies quite a bit from author to author. How- ever, the differences between the defini- tions are important in terms …...

Automated conversion has allowed the de- velopment of wide-coverage corpora for a variety of grammar formalisms without the expense of manual annotation. Analysing new languages also tests formalisms, ex- posing …...

Combinatory Categorial Grammar (CCG) is generally construed as a fully lexicalized formalism, where all grammars use one and the same universal set of rules, and cross- linguistic variation is isolated …...

In this paper, we present a method to em- ploy target-side syntactic contextual infor- mation in a Hierarchical Phrase-Based sys- tem. Our method uses Combinatory Cate- gorial Grammar (CCG) to …...

We apply the graph-structured stack (GSS) to shift-reduce parsing in a Combinatory Cate- gorial Grammar (CCG) parser. This allows the shift-reduce parser to explore all possible parses in polynomial time …...

This paper presents a novel method of improving Combinatory Categorial Grammar (CCG) parsing using features generated from Dependency Grammar (DG) parses and combined using reranking. Different grammar formalisms have different …...

We apply Combinatory Categorial Grammar to wide-coverage parsing in Chinese with the new Chinese CCGbank, bringing a formalism capable of transparently recovering non-local dependencies to a language in which they …...

For the last decade, distributional seman- tics has been an active area of research to address the problem of understanding the semantics of words in natural language. The core principal …...

Modelling the compositional process by which the meaning of an utterance arises from the meaning of its parts is a funda- mental task of Natural Language Process- ing. In this …...

We present an approach for learning context-dependent semantic parsers to identify and interpret time expressions. We use a Combinatory Categorial Gram- mar to construct compositional meaning representations, while considering contex- …...

AbstractFrom a purely theoretical point of view, it makes sense to approach recognizing textual entailment (RTE) with the help of logic. After all, entailment matters are all about logic. In …...

We present methods to control the lexicon size when learning a Combinatory Cate- gorial Grammar semantic parser. Existing methods incrementally expand the lexicon by greedily adding entries, considering a single …...

Compositional distributional semantics is a subfield of Computational Linguistics which investigates methods for represent- ing the meanings of phrases and sen- tences. In this paper, we explore im- plementations of …...

We use a Combinatory Categorial Gram- mar (CCG) parser with a structured per- ceptron learner to address Shared Task 6 of SemEval-2014, Supervised Semantic Parsing of Robotic Spatial Commands. Our …...

We present a Bayesian formulation for weakly-supervised learning of a Combina- tory Categorial Grammar (CCG) supertag- ger with an HMM. We assume supervi- sion in the form of a tag …...

Combinatory Categorial Grammar (CCG) is a lexicalized grammar formalism in which words are associated with cate- gories that specify the syntactic configura- tions in which they may occur. We present …...

Existing semantic parsing research has steadily improved accuracy on a few do- mains and their corresponding meaning representations. In this paper, we present a novel supervised semantic parsing algo- rithm, …...

Incremental parsers have potential advantages for applications like language modeling for machine translation and speech recognition. We describe a new algorithm for incremental transition-based Combinatory Categorial Grammar parsing. As English …...

This paper proposes a method of incremen- tally constructing semantic representations. Our method is based on Steedman’s Combina- tory Categorial Grammar (CCG), which has a transparent correspondence between the syn- …...

AbstractWe propose a new domain adaptation method for Combinatory Categorial Grammar (CCG) parsing, based on the idea of automatic generation of CCG corpora exploiting cheaper resources of dependency trees. Our …...

AbstractWe describe a new approach to semantic parsing based on Combinatory Categorial Grammar (CCG). The grammar’s semantic construction operators are defined in terms of a graph algebra, which allows our …...

AbstractThis paper is about learning word representations using grammatical type information. We use the syntactic types of Combinatory Categorial Grammar to develop multilinear representations, i.e. maps with n arguments, for …...

AbstractTree-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 …...

AbstractThis paper introduces an algorithm to convert Universal Dependencies (UD) treebanks to Combinatory Categorial Grammar (CCG) treebanks. As CCG encodes almost all grammatical information into the lexicon, obtaining a high-quality …...