Results 1 - 10
of
1,506
Parsing with polymorphic categorial grammars
- Advances in Computational Linguistics. Research in Computing Science
, 2009
"... Abstract. In this paper we investigate the use of polymorphic categorial grammars as a model for parsing natural language. We will show that, despite the undecidability of the general model, a subclass of polymorphic categorial grammars, which we call linear, is mildly context-sensitive and we propo ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
Abstract. In this paper we investigate the use of polymorphic categorial grammars as a model for parsing natural language. We will show that, despite the undecidability of the general model, a subclass of polymorphic categorial grammars, which we call linear, is mildly context-sensitive and we
Closed Categories and Categorial Grammar
"... Inspired by Lambek's work on categorial grammar, we examine the proposal that the theory of biclosed monoidal categories can serve as a foundation for a formal theory of natural language. The emphasis throughout is on the derivation of the axioms for these categories from linguistic intuitio ..."
Abstract
- Add to MetaCart
Inspired by Lambek's work on categorial grammar, we examine the proposal that the theory of biclosed monoidal categories can serve as a foundation for a formal theory of natural language. The emphasis throughout is on the derivation of the axioms for these categories from linguistic
Categorial Grammars with Negative Information
- A notion in focus, de Gruyter
, 1995
"... this paper we discuss some possibilities of introducing negative information in the formalism of categorial grammar. Traditionally, formal grammars, including categorial grammars, admit positive information only. For instance, one postulates the rule S)NP,VP but not \GammaS)NP,\GammaVP; here \GammaA ..."
Abstract
-
Cited by 5 (3 self)
- Add to MetaCart
this paper we discuss some possibilities of introducing negative information in the formalism of categorial grammar. Traditionally, formal grammars, including categorial grammars, admit positive information only. For instance, one postulates the rule S)NP,VP but not \GammaS)NP,\GammaVP; here \Gamma
Incremental Interpretation of Categorial Grammar
- in Proceedings of EACL95
, 1995
"... The paper describes a parser for Categorial Grammar which provides fully word by word incremental interpretation. The parser does not require fragments of sen- tences to form constituents, and thereby avoids problems of spurious ambiguity. The paper includes a brief discussion of the relationship be ..."
Abstract
-
Cited by 22 (0 self)
- Add to MetaCart
The paper describes a parser for Categorial Grammar which provides fully word by word incremental interpretation. The parser does not require fragments of sen- tences to form constituents, and thereby avoids problems of spurious ambiguity. The paper includes a brief discussion of the relationship
A Categorial Grammar for Greek
"... This paper presents a Categorial Grammar for Greek. The analysis provides evidence in favour of Set Combinatory Categorial Grammar (Set-CCG, Baldridge 2000), a formalism which shares the attractive linguistic and computational aspects of Combinatory Categorial Grammar (CCG, Steedman 2000b). What is ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
This paper presents a Categorial Grammar for Greek. The analysis provides evidence in favour of Set Combinatory Categorial Grammar (Set-CCG, Baldridge 2000), a formalism which shares the attractive linguistic and computational aspects of Combinatory Categorial Grammar (CCG, Steedman 2000b). What
Learning Stochastic Categorial Grammars
- CONLL97
, 1997
"... Stochastic categorial grammars (SCGs) are introduced as a more appropriate formalism for statistical language learners to estimate than stochastic context free grammars. As a vehicle for demonstrating SCG estimation, we show, in terms of crossing rates and in coverage, that when training material is ..."
Abstract
-
Cited by 21 (2 self)
- Add to MetaCart
Stochastic categorial grammars (SCGs) are introduced as a more appropriate formalism for statistical language learners to estimate than stochastic context free grammars. As a vehicle for demonstrating SCG estimation, we show, in terms of crossing rates and in coverage, that when training material
Constraint-Based Categorial Grammar
, 1994
"... We propose a generalization of Categorial Grammar in which lexical categories are defined by means of recursive constraints. In particular, the introduction of relational constraints allows one to capture the effects of (recursive) lexical rules in a computationally attractive manner. We illustrate ..."
Abstract
-
Cited by 19 (2 self)
- Add to MetaCart
We propose a generalization of Categorial Grammar in which lexical categories are defined by means of recursive constraints. In particular, the introduction of relational constraints allows one to capture the effects of (recursive) lexical rules in a computationally attractive manner. We illustrate
Combinatory Categorial Grammar
"... In this paper we will introduce Combinatory Categorial Grammars and explain the polynomial time parsing algorithm for such grammars as defined by K. Vijay-Shanker and David Weir. We will describe the recognition algorithm via an inference system that resembles the CKY algorithm, and then briefly dis ..."
Abstract
- Add to MetaCart
In this paper we will introduce Combinatory Categorial Grammars and explain the polynomial time parsing algorithm for such grammars as defined by K. Vijay-Shanker and David Weir. We will describe the recognition algorithm via an inference system that resembles the CKY algorithm, and then briefly
Reasoning with Categorial Grammar Logic
"... The article presents the first results we have obtained studying natural reasoning from a proof-theoretic perspective. In particular we focus our attention on monotonic reasoning. Our system consists of two parts: (i) A Formal Grammar -- a multimodal version of classical Categorial Grammar -- which ..."
Abstract
- Add to MetaCart
The article presents the first results we have obtained studying natural reasoning from a proof-theoretic perspective. In particular we focus our attention on monotonic reasoning. Our system consists of two parts: (i) A Formal Grammar -- a multimodal version of classical Categorial Grammar -- which
Results 1 - 10
of
1,506