J.Earley. 1970. An efficient context-free parsing algorithm.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the attachment ambiguity. Hence, for D theory to be useful in a system that does semantic interpretation, it would need to be coupled with a semantic interpreter that recognizes the difference between these two examples. The approach taken in this paper is to combine an all path parsing algorithm [5, 7, 11, 16, 17] with routines for generating logical representations in order to create a shared packed parse forest annotated with the logical representations for the constituents in the forest (i.e. an annotated shared packed parse forest) Before discussing the benefits of this approach, we describe the ....

....parse for Every man saw the boy with his binoculars given a certain world model. parse forest to store logical representations. Use of an annotated shared packed parse forest has the following benefits: 1. It provides a space savings by packing duplicate nodes into a single entry in the forest [7, 16, 17], thus reducing the overhead when it is necessary to keep all parses until it is possible to make an informed choice among the alternative meanings. 2. It provides a direct method for focusing on the points of ambiguity in a sentence when parent links are included for each node. 3. It is able to ....

[Article contains additional citation context not shown here]

J. C. Earley. An efficient context-free parsing algorithm. Communications of the ACM, 13:94-- 102, 1970.

....automata can only be used to implement unidirectional parsing strategies that read the input string in the same way. As an example of the kind of parsers that can be implemented, a compilation schema of a context free grammar into a pushdown automaton implementing the Earley s parsing strategy [4] is derived. In the resulting automaton, V T is the set of terminals of the source grammar, VS is the union of f 0 ; f g and a set of dotted productions , the initial element 0 is used to start computations, the final element f is (S ffiffl) and Theta contains the set of transitions ....

J. Earley. An efficient context-free parsing algorithm. Communications of the ACM, 13(2):94--102, 1970.

....is better. For example, the point at 68 35 shows that on this particular run of earley, the stop and copy collector requires 68 more CPU time and 35 more heap space than the 2 generational collector. earley is an implementation of Earley s parsing algorithm, written by Marc Feeley [13]. In our benchmarks, this program first creates a parser from an ambiguous grammar, and then computes all parses of an input of length 12 or 13 that has an exponential number of parse trees; this is iterated 5 times. earley constructs its output in a functional manner, and the resulting data ....

J Earley. An efficient context-free parsing algorithm. Communications of the ACM 13(2), 1970, pages 94--102.

....normalizes the likelihood according to #, which we describe by simply calculating the sample mean likelihood of the string, i.e. ## ## # ## (5) 3. The Earley Stolcke Parsing For parsing input strings, we employ the Earley Stolcke algorithm, a parser originally developed by Jay Earley [6] for efficient parsing of CFG and later modified by Andreas Stolcke [14] to accommodate SCFG. The Earley Stolcke algorithm uses a top down parsing approach and context free productions to build strings that are derivable from left to right. It maintains multiple hypotheses of all possible ....

J. C. Earley. An Efficient Context-Free Parsing Algorithm. PhD thesis, CarnegieMellon University, 1968.

....of the right hand side has progressed. To be more precise, the meaning of the above dotted item is that the input symbols on a path from q to q can be derived from . Note that recognition of right hand sides is done from right to left, i.e. in. reversed order with respect to Earley s algorithm [6]. For a certain instance of a rule, the initial position of the dot is given by the position of the diamond in the corresponding filter item. There are several ways to. construct U. For presentational reasons our algorithm will be relatively simple, in the style of the CYK algorithm [8] 1. ....

J. Earley. 1970. An efficient context-free parsing algorithm. Communications of the ACM, 13(2):94-102, February.

.... at the intermediate points of a query, and (3) various authors [20, 21] have given experimental support for the practical efficiency of left corner parsers relative to that of chart parsers even though the latter have better (n as opposed to exponential) worst case complexity bounds [22, 23, 24]. However, initial attempts to modify Petrick s left corner parser to let it accept terminal symbols (words) in a strictly sequential, word at a time fashion proved harder than expected. This was due to the organization of the parser with respect to its handling of non determinism. Its ....

Earley, J. "An Efficient Context-Free Parsing Algorithm." Communications of the ACM 6, No. 8 (1970): 94-102.

....applied to non determlnlztlc Lloparsers for ITN grammars. 1 Introduction A major problem of computational linguistics is the inefficiency of parsing natural language. The most popular parsing method for context free natural language grammars, is the general context free parsing method of Earley [1]. It was noted by Lang [2] that Earley like methods can be used for simulating a class of non deterministic pushdown antomata(NPDA) Recently, Tomira [3] presented an algorithm that simulates non deterministic LR parsers, and dammed it to be a fast algorithm for practical natural language ....

....lies a method for deriving a bilinear cover. 3.1 Earley s method Earley s construction of items is a clear example of a construction of a bilinear cover Cz(G) for each context free grammar G. The terminals of Cz(G) and G are identical, the non terminals of Cz(G) are the items (dotted rules[1]) Ii , defined as follows. Let the non terminal defined by rule i of grammar G be given by Ni, then ir is Ari a. with ] 1 = k (a, are used for sequences of terminals and non terminals) We assume that only one rule, rule 0, of G rewrites the start symbol S. The length of the right hand ....

[Article contains additional citation context not shown here]

Earley, I. 1970. An Efficient Context-Free Parsing Algorithm, Communicationz A CM 13(2):94-102.

....such as the LALR(1) algorithm in Yacc [6,7] are deterministic and cannot generally cope with the fact that input involving a Schrodinger token may (temporarily) not have a unique parse. Instead, we use more general parsing techniques such as generalized LR parsing [8] or Earley s algorithm [9,10], which effectively simulate non determinism if necessary to handle ambiguity in the grammar. In the past, these types of parsers have not been widely used in compilers due to efficiency concerns: all other things being equal, the more general parsing algorithms tend to be slower due to extra ....

Earley J. An efficient context-free parsing algorithm. Communications of the ACM 1970; 13(2):94--102.

....such as the LALR(1) algorithm in Yacc [6,7] are deterministic and cannot generally cope with the fact that input involving a Schrodinger token may (temporarily) not have a unique parse. Instead, we use more general parsing techniques such as generalized LR parsing [8] or Earley s algorithm [9,10], which effectively simulate non determinism if necessary to handle ambiguity in the grammar. In the past, these types of parsers have not been widely used in compilers due to efficiency concerns: all other things being equal, the more general parsing algorithms tend to be slower due to extra ....

Earley J. An efficient context-free parsing algorithm. PhD Thesis, Carnegie-Mellon University, 1968.

No context found.

J.Earley. 1970. An efficient context-free parsing algorithm.

No context found.

J. Earley. An Efficient Context-Free Parsing Algorithm. Communications of the ACM, 13(2):94, 1970.

No context found.

EARLEY, J. 1970. An efficient context-free parsing algorithm. Communications of the ACM 13.94--102.

No context found.

J. Earley. An Efficient Context-free Parsing Algorithm. Communications of the ACM, 13(2):94--102, 1970.

No context found.

EARLEY, J. An Efficient Context-Free Parsing Algorithm. Communications of the ACM 13, 2 (1970), 94--102.

No context found.

J. Earley. An efficient context-free parsing algorithm. Communications of ACM, 13:94--102, 1970.

No context found.

J. Earley. An efficient context-free parsing algorithm. Communications of the ACM, 13(2):94--102, 1970.

No context found.

J. Earley. An Efficient Context Free Parsing Algorithm. Communications of the ACM, 13(2), 1970.

No context found.

J. Earley. An efficient context-free parsing algorithm. Communications of the ACM, 13(2):94--102, 1970.

No context found.

Earley, J. (1970). An efficient context-free parsing-algorithm. pages 451--455.

No context found.

EARLEY J., "An efficient context-free parsing algorithm", Communications of the ACM, vol. 6, num. 8, 1970, p. 451--455.

No context found.

: J. Earley: "An Efficient Context-Free Parsing Algorithm", Commnnications of the ACM 13 (2) 1970, pp. 94-102

No context found.

Earley, J., "An Efficient Context-free Parsing Algorithm," Communication of ACM, Vol. 6, No. 8, February 1970, pp, 94-102.

No context found.

J. Earley, `An efficient context-free parsing algorithm', Commun. ACM, 13(2), 94--102 (1970).

No context found.

J. Earley, `An efficient context-free parsing algorithm', Comms. ACM, 13(2), 94--102 (1970). (Reprinted in Comms. ACM 26(1), 57--61 (1983).)

No context found.

J. Earley, "An efficient context-free parsing algorithm", CACM, Vol. 13, N 2, F6vrier 1970, pp 94-102.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC