T. Kasami. An ecient recognition and syntax algorithm for context-free languages. Technical Report AFCRL-65-758, Air Force Cambridge Research Lab, Bedford, 1965. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An HPSG parser with CFG filtering - Torisawa, al. (2000) (1 citation) (Correct)
....also be causes of the overgeneration. 5 Implementation of a parser with CFG ltering We have implemented a parser which performs ltering with a compiled CFG. We call the parser the TNT parser. Figure 10 illustrates its block diagram. First, an input sentence is parsed by a CKY based CFG parser (Kasami, 1965) and the parser produces a CKY table from which we can extract the tree forms accepted by the compiled CFG. Second, the rule schema application module constructs feature structures expressing parse trees by looking at the information stored in the CKY table. The CFG parser was implemented in C ....
Kasami, T. (1965). An ecient recognition and syntax algorithm for context-free languages (Tech. Rep. # 65-758). Bedford, MA: Air Force Cambrige Research Laboratory.
A Uniform Framework for Problems on Context-Free Grammars - Esparza, Rossmanith, Schwoon (2000) (2 citations) (Correct)
....solutions for certain standard problems on context free grammars like tests for membership, emptiness, and niteness. For many of these problems independent solutions are given, e.g. reductions to a graph theoretic problem for niteness or the well known algorithm by Cocke, Younger and Kasami [8, 9] for the membership problem. Closer inspection reveals that several problems reduce to reachability questions between sentential forms. It has been observed that nite automata can play a useful role in solving reachability questions. Book and Otto, in their work about string rewriting systems ....
T. Kasami. An ecient recognition and syntax algorithm for context-free languages. Technical Report AFCRL-65-758, Air Force Cambridge Research Lab, Bedford, 1965.
A Parallel Context-Free Derivation Hierarchy - Reinhardt (Correct)
....derivation steps with = kG in sequence 2 The connection to parallel recognition With the method in [GR88] context free languages can be recognized by a CRCW PRAM in O(log(n) steps. But this method needs n 6 processors, which makes it very inecient. On the other hand the CYK algorithm [Kas65] allows easily a parallelization on a CRCW PRAM in linear time with n 3 processors 3 . This idea can be used to recognize languages in CFLth(f(n) in time O(f(n) with n 3 processors 4 . This means that the derivation tree height corresponds to the running time of the following parallel ....
T. Kasami. An ecient recognition and syntax algorithm for context-free languages. Scientic Report AFCRL-65-758, Air Force Cambridge Research Laboratory, Bedford MA, 1965.
A Uniform Framework for Problems on Context-Free Grammars - Esparza, Rossmanith, Schwoon (2000) (2 citations) (Correct)
No context found.
T. Kasami. An ecient recognition and syntax algorithm for context-free languages. Technical Report AFCRL-65-758, Air Force Cambridge Research Lab, Bedford, 1965.
A Uniform Framework for Problems on Context-Free Grammars - Esparza, Rossmanith, Schwoon (2000) (2 citations) (Correct)
No context found.
T. Kasami. An ecient recognition and syntax algorithm for context-free languages. Technical Report AFCRL-65-758, Air Force Cambridge Research Lab, Bedford, 1965.
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