Results 1 
6 of
6
Parsing Some Constrained Grammar Formalisms
 Computational Linguistics
, 1994
"... this paper we present a scheme to extend a recognition algorithm for ContextFree Grammars (CFG) that can be used to derive polynomialtime recognition algorithms for a set of formalisms that generate a superset of languages generated by CFG. We describe the scheme by developing a CockeKasamiYoung ..."
Abstract

Cited by 56 (6 self)
 Add to MetaCart
this paper we present a scheme to extend a recognition algorithm for ContextFree Grammars (CFG) that can be used to derive polynomialtime recognition algorithms for a set of formalisms that generate a superset of languages generated by CFG. We describe the scheme by developing a CockeKasamiYounger (CKY)like pure bottomup recognition algorithm for Linear Indexed Grammars and show how it can be adapted to give algorithms for Tree Adjoining Grammars and Combinatory Categorial Grammars. This is the only polynomialtime recognition algorithm for Combinatory Categorial Grammars that we are aware of
Dynamic Programming for LinearTime Incremental Parsing
"... Incremental parsing techniques such as shiftreduce have gained popularity thanks to their efficiency, but there remains a major problem: the search is greedy and only explores a tiny fraction of the whole space (even with beam search) as opposed to dynamic programming. We show that, surprisingly, d ..."
Abstract

Cited by 42 (3 self)
 Add to MetaCart
Incremental parsing techniques such as shiftreduce have gained popularity thanks to their efficiency, but there remains a major problem: the search is greedy and only explores a tiny fraction of the whole space (even with beam search) as opposed to dynamic programming. We show that, surprisingly, dynamic programming is in fact possible for many shiftreduce parsers, by merging “equivalent ” stacks based on feature values. Empirically, our algorithm yields up to a fivefold speedup over a stateoftheart shiftreduce dependency parser with no loss in accuracy. Better search also leads to better learning, and our final parser outperforms all previously reported dependency parsers for English and Chinese, yet is much faster. 1
Generalized LeftCorner Parsing
 In Sixth Conference of the European Chapter of the Association for Computational Linguistics, Proceedings of the Conference
, 1993
"... We show how techniques known from generalized LR parsing can be applied to leftcorner parsing. The esulting parsing algorithm for contextfree grammars has some advantages over generalized LR parsing: the sizes and generation times of the parsers are smaller, the produced output is more compa ..."
Abstract

Cited by 23 (7 self)
 Add to MetaCart
We show how techniques known from generalized LR parsing can be applied to leftcorner parsing. The esulting parsing algorithm for contextfree grammars has some advantages over generalized LR parsing: the sizes and generation times of the parsers are smaller, the produced output is more compact, and the basic parsing technique can more easily be adapted to arbitrary contextfree grammars.
A Natural Language Parser With Interleaved Spelling Correction Supporting Lexical Functional Grammar And IllFormed Input
, 1994
"... ..."
Contribution of a Category Hierarchy to the Robustness of Syntactic Parsing.
 In COLING'90: Proc. of the 13th Intl. Conf. on Computational Linguistics
, 1990
"... We describe how the use of a hierarchy of lexical categories instead of a simple set of categories leads to the definition of a flexible and precise language for the description of dependency structures. After specifying the formalism we use to decorate these structures, we present an application ai ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We describe how the use of a hierarchy of lexical categories instead of a simple set of categories leads to the definition of a flexible and precise language for the description of dependency structures. After specifying the formalism we use to decorate these structures, we present an application aiming to detect and correct errors in a written text. We outline how the use of the hierarchy improves the manipulation of unknown words. 1. Introduction The work presented in this paper is part of a more general project which aims towards a complete system for detection and correction of errors in a written text. Our interest here is the creation of a syntacticsemantic module which builds dependency structures decorated with attributepairs lists integrating a mechanism for the inheritance of properties. We show the contribution of hierarchisation of lexical categories to the construction of syntactical structures. 2. Construction of dependency structures Dependency structures are trees...
Frontier Pruning for ShiftReduce CCG Parsing
"... We apply the graphstructured stack (GSS) to shiftreduce parsing in a Combinatory Categorial Grammar (CCG) parser. This allows the shiftreduce parser to explore all possible parses in polynomial time without resorting to heuristics, such as beam search. The GSSbased shiftreduce parser is 34 % slo ..."
Abstract
 Add to MetaCart
We apply the graphstructured stack (GSS) to shiftreduce parsing in a Combinatory Categorial Grammar (CCG) parser. This allows the shiftreduce parser to explore all possible parses in polynomial time without resorting to heuristics, such as beam search. The GSSbased shiftreduce parser is 34 % slower than CKY in the finelytuned C&C parser. We perform frontier pruning on the GSS, increasing the parsing speed to be competitive with the C&C parser with a small accuracy penalty. 1