Results 1  10
of
68
Tree Insertion Grammar: A CubicTime, Parsable Formalism that Lexicalizes ContextFree Grammar without Changing the Trees Produced
 Computational Linguistics
, 1994
"... this paper, we study the problem of lexicalizing contextfree grammars and show that it enables faster processing. In previous attempts to take advantage of lexicalization, a variety of lexicalization procedures have been developed that convert contextfree grammars (CFGs) into equivalent lexicalize ..."
Abstract

Cited by 80 (1 self)
 Add to MetaCart
this paper, we study the problem of lexicalizing contextfree grammars and show that it enables faster processing. In previous attempts to take advantage of lexicalization, a variety of lexicalization procedures have been developed that convert contextfree grammars (CFGs) into equivalent lexicalized grammars. However, these procedures typically suffer from one or more of the following problems
Partial Proof Trees as Building Blocks for a Categorial Grammar
 Linguistics and Philosophy
, 1997
"... We describe a categorial system (PPTS) based on partial proof trees (PPTs) as the building blocks of the system. The PPTs are obtained by unfolding the arguments of the type that would be associated with a lexical item in a simple categorial grammar. The PPTs are the basic types in the system and a ..."
Abstract

Cited by 39 (10 self)
 Add to MetaCart
We describe a categorial system (PPTS) based on partial proof trees (PPTs) as the building blocks of the system. The PPTs are obtained by unfolding the arguments of the type that would be associated with a lexical item in a simple categorial grammar. The PPTs are the basic types in the system and a derivation proceeds by combining PPTs together. We describe the construction of the finite set of basic PPTs and the operations for combining them. PPTS can be viewed as a categorial system incorporating some of the key insights of lexicalized tree adjoining grammar, namely the notion of an extended domain of locality and the consequent factoring of recursion from the domain of dependencies. PPTS therefore inherits the linguistic and computational properties of that system, and so can be viewed as a `middle ground' between a categorial grammar and a phrase structure grammar. We also discuss the relationship between PPTS, natural deduction, and linear logic proofnets, and argue that natural ...
Lambek Grammars Are Context Free
 In Proceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science
, 1993
"... In this paper the Chomsky Conjecture is proved: all languages recognized by the Lambek calculus are context free. ..."
Abstract

Cited by 29 (1 self)
 Add to MetaCart
(Show Context)
In this paper the Chomsky Conjecture is proved: all languages recognized by the Lambek calculus are context free.
Productfree Lambek calculus and contextfree grammars
 The Journal of Symbolic Logic
, 1997
"... In this paper we prove the Chomsky Conjecture (all languages recognized by the Lambek calculus are contextfree) for both the full Lambek calculus and its productfree fragment. For the latter case we present a construction of contextfree grammars involving only productfree types. ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
(Show Context)
In this paper we prove the Chomsky Conjecture (all languages recognized by the Lambek calculus are contextfree) for both the full Lambek calculus and its productfree fragment. For the latter case we present a construction of contextfree grammars involving only productfree types.
Combinatory Categorial Grammars: Generative Power and Relationship to Linear ContextFree Rewriting Systems
, 1988
"... Recent results have established that there is a family of languages flint is exactly the clazs of languages generated by three independently developed grammar formalisms: Tree Adjoining Grammars, Head Grammars, and Linear Indexed Grammars. In this paper we show flint Combinawry Categorial Grammar ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
Recent results have established that there is a family of languages flint is exactly the clazs of languages generated by three independently developed grammar formalisms: Tree Adjoining Grammars, Head Grammars, and Linear Indexed Grammars. In this paper we show flint Combinawry Categorial Grammars also generates the same class of languages. We discuss the structmal descriptions produc l by Combinatory Categorial Orammars and compare them to those of grammar formalisms in th ias of Linear ContextFre Rewriting Systems. We also discuss crtain extensions of Combinatory gorial Ommmars and their effect on the weak geneative capacity.
Categorial Grammars, Lexical Rules and the English Predicative
 Formal Grammar: Theory and Implementation
, 1995
"... this paper, we will study the possibilities for applying lexical rules to the analysis of English syntax, and in particular the structure of the verb phrase. We will develop a lexicon whose empirical coverage extends to the full range of verb subcategories, complex adverbial phrases, auxiliaries, th ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
this paper, we will study the possibilities for applying lexical rules to the analysis of English syntax, and in particular the structure of the verb phrase. We will develop a lexicon whose empirical coverage extends to the full range of verb subcategories, complex adverbial phrases, auxiliaries, the passive construction, yes/no questions and the particularly troublesome case of predicatives. The effect of a lexical rule, in our system, will be to produce new lexical entries from old lexical entries. The similarity between our system and the metarule system of generalized phrasestructure grammar (GPSG, as presented in Gazdar, et al. 1985) is not coincidental. Our lexical rules serve much the same purpose as metarules in GPSG, which were restricted to lexical phrase structure rules. The similarity is in a large part due to the fact that with the universal phrasestructure schemes being fixed, the role of a lexical category assignment in effect determines phrasestructure in much the same way as a lexical category entry and lexical phrasestructure rule determines lexical phrasestructure in GPSG. Our lexical rules will also bear a relationship to the lexical rules found in lexicalfunctional grammar (LFG, see Bresnan 1982), as LFG rules are driven by the grammatical role assigned to arguments. Many of our analyses were first applied to either LFG or GPSG, as these were the first serious linguistic theories based on a notion of unification. In the process of explaining the basic principles behind categorial grammar and developing our lexical rule system, we will establish a categorial grammar lexicon with coverage of English syntactic constructions comparable to that achieved within published accounts of the GPSG or LFG frameworks. Language, at its most abstract level, i...
Dependency grammar and dependency parsing
 Växjö University
, 2005
"... Despite a long and venerable tradition in descriptive linguistics, dependency grammar has until recently played a fairly marginal role both in theoretical linguistics and in natural language processing. The increasing interest in dependencybased ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
Despite a long and venerable tradition in descriptive linguistics, dependency grammar has until recently played a fairly marginal role both in theoretical linguistics and in natural language processing. The increasing interest in dependencybased
A Hypothetical Reasoning Algorithm for Linguistic Analysis
 Journal of Logic and Computation
, 1994
"... The Lambek calculus, an intuitionistic fragment of Linear Logic, has recently been rediscovered by linguists. Due to its builtin hypothetical reasoning mechanism, it allows for describing a certain range of those phenomena in natural language syntax which involve incomplete subphrases or moved cons ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
(Show Context)
The Lambek calculus, an intuitionistic fragment of Linear Logic, has recently been rediscovered by linguists. Due to its builtin hypothetical reasoning mechanism, it allows for describing a certain range of those phenomena in natural language syntax which involve incomplete subphrases or moved constituents. Previously, it seemed unclear how to extent traditional parsing techniques in order to incorporate reasoning about incomplete phrases, without causing the undesired effect of derivational equivalences. It turned out that the Lambek calculus offers a framework to formulate equivalent but more implementationoriented calculi where this problem does not occur. In this paper, such a theorem prover for the Lambek calculus, i.e. a parser for Lambek categorial grammars, is defined. Permutations of proof steps which would cause derivational equivalence in a purely sequential formulation do not play a role in a (pseudo)parallel approach which is based on a lemma table or a "chart". At the...