Results 1 
8 of
8
Polynomial Time and Space ShiftReduce Parsing of Arbitrary Contextfree Grammars
, 1991
"... We introduce an algorithm for designing a predictive left to right shiftreduce nondeterministic pushdown machine corresponding to an arbitrary unrestricted contextfree grammar and an algorithm for efficiently driving this machine in pseudoparallel. The performance of the resulting parser is for ..."
Abstract

Cited by 27 (0 self)
 Add to MetaCart
We introduce an algorithm for designing a predictive left to right shiftreduce nondeterministic pushdown machine corresponding to an arbitrary unrestricted contextfree grammar and an algorithm for efficiently driving this machine in pseudoparallel. The performance of the resulting parser is formally proven to be superior to Earley's parser (1970). The technique employed consists in constructing before runtime a parsing table that encodes a nondeterministic machine in the which the predictive behavior has been compiled out. At run time, the machine is driven in pseudoparallel with the help of a chart.
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 25 (8 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.
Increasing the applicability of LR parsing
 In Third International Workshop on Parsing Technologies
, 1993
"... In this paper we discuss a phenomenon present in some contextfree grammars, called hidden left recursion. We show that ordinary LR parsing according to hidden leftrecursive grammars is not possible and we indicate a range of solutions to this problem. One of these solutions is a new parsing techni ..."
Abstract

Cited by 17 (6 self)
 Add to MetaCart
In this paper we discuss a phenomenon present in some contextfree grammars, called hidden left recursion. We show that ordinary LR parsing according to hidden leftrecursive grammars is not possible and we indicate a range of solutions to this problem. One of these solutions is a new parsing technique, which is a variant of traditional LR parsing. This new parsing technique can be used both with and without lookahead and the nondeterminism can be realized using backtracking or using a graphstructured stack. 1
Automatic Acquisition of Noun and Verb Meanings
, 1995
"... A robust Natural Language Processing (NLP) system must be able to automatically acquire the syntax and semantics of unknown words that it encounters during processing. It is inevitable that a realworld NLP system will encounter unknown words since the human lexicon continues to grow. This paper de ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
A robust Natural Language Processing (NLP) system must be able to automatically acquire the syntax and semantics of unknown words that it encounters during processing. It is inevitable that a realworld NLP system will encounter unknown words since the human lexicon continues to grow. This paper describes XXXXX, a system that automatically acquires the meanings of unknown nouns and verbs. XXXXX represents the semantics of nouns and verbs in terms of taxonomies since there is considerable evidence that the human lexicon is largely organized as a taxonomy. The use of taxonomies is common in NLP thus making these methods generally useful. When an unknown word is encountered XXXXX attempts to place the unknown word in a taxonomy. In XXXXX the acquisition of semantics is defined as locating an existing concept node in a concept hierarchy that defines an unknown word. If there is no such node then a node must be created and placed into the concept hierarchy. The former is referred to as the...
A variant of earley parsing
 In AI*IA 97: Advances in Artificial Intelligence, 5th Congress of the Italian Association for Artificial Intelligence, volume 1321 of LNAI, p. 84–95
, 1997
"... Abstract. The Earley algorithm is a widely used parsing method in natural language processing applications. We introduce a variant of Earley parsing that is based on a “delayed ” recognition of constituents. This allows us to start the recognition of a constituent only in cases in which all of its s ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract. The Earley algorithm is a widely used parsing method in natural language processing applications. We introduce a variant of Earley parsing that is based on a “delayed ” recognition of constituents. This allows us to start the recognition of a constituent only in cases in which all of its subconstituents have been found within the input string. This is particularly advantageous in several cases in which partial analysis of a constituent cannot be completed and in general in all cases of productions sharing some suffix of their righthand sides (even for different lefthand side nonterminals). Although the two algorithms result in the same asymptotic time and space complexity, from a practical perspective our algorithm improves the time and space requirements of the original method, as shown by reported experimental results. 1
Improving Upon Earley’s Parsing Algorithm In Prolog
, 2004
"... This paper presents a modification of the Earley (1970) parsing algorithm in Prolog. The Earley algorithm presented here is based on an implementation in Covington (1994a). The modifications are meant to improve on that algorithm in several key ways. The parser features a predictor that works like a ..."
Abstract
 Add to MetaCart
This paper presents a modification of the Earley (1970) parsing algorithm in Prolog. The Earley algorithm presented here is based on an implementation in Covington (1994a). The modifications are meant to improve on that algorithm in several key ways. The parser features a predictor that works like a leftcorner parser with links, thus decreasing the number of chart entries. It implements subsumption checking, and organizes chart entries to take advantage of first argument indexing for quick retrieval. 1
AND
"... Abstract. We present a lineartime algorithm to decide for any fixed deterministic contextfree language L and input string w whether w is a suffix of some string in L. In contrast to a previously published technique, the decision procedure may be extended to produce syntactic structures (parses) wi ..."
Abstract
 Add to MetaCart
Abstract. We present a lineartime algorithm to decide for any fixed deterministic contextfree language L and input string w whether w is a suffix of some string in L. In contrast to a previously published technique, the decision procedure may be extended to produce syntactic structures (parses) without an increase in time complexity. We also show how this algorithm may be applied to process incorrect input in linear time.