A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
Issues in Implementation of Parallel Parsing on Multi-Core Machines
2014
International Journal of Computer Science Engineering and Information Technology
Preserved Fulltext
This paper highlights some issues related to implementation of parallel parsing on multi-core machines. ...
Parallel compilation is the area which still needs significant improvement by the use of this architecture. Recent research has shown some improvement in lexical analysis phase. ...
Chandwani et al [14] developed a parallel algorithm for CKY-parsing for context free grammars. ...
doi:10.5121/ijcseit.2014.4505
fatcat:t42btn7mt5ak7dmjgga3l7m52q
Page 454 of Computational Linguistics Vol. 17, Issue 4
[page]
1991
Computational Linguistics
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Weir (Chapter 13) presents a general scheme for polynomial-time recog- nition for languages generated by formalisms that are extensions of context-free gram- mars; viz., Linear Indexed Grammar, Combinatory ...
“A dependency-based parser for topic and focus” by Eva Hajitova (Chapter 9) discusses methods for parsing written “free word order” language. ...
Myanmar-English Bidirectional Machine Translation System with Numerical Particles Identification
2016
International Journal of Information Technology and Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Used parsers generate corresponding CFG rules which are collected and created as synchronous context free grammar SCFG rules. ...
Stanford and ML2KR parsers are used for preprocessing step. From this step, parsers generate corresponding parse tree structures. ...
Context Free Grammar (CFG) rules of source and target languages are needed to generate Synchronous Context Free Grammar (SCFG) rules to be easy to change the structure. ...
doi:10.5815/ijitcs.2016.06.05
fatcat:2aojkohy7berxk7qoajukssqyu
Page 289 of Mathematical Reviews Vol. , Issue 81A
[page]
1981
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
An LR(k) parser of a context-free grammar is treated as a formal system where the derivations are reversals of rightmost derivations in the grammar. ...
Error recovery in LR(k) pars- ing of a context-free grammar is formalized by extending an ...
Malay Single Sentence Parser
2019
Universiti Malaysia Terengganu Journal of Undergraduate Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
This research used top-down parsing technique, and grammar chosen was context-free grammar (CFG) for Malay language. ...
Parser is a process of classifying sentence structures of a language. Parser receives a sentence and breaks it up into correct phrases. ...
This study used context-free grammar through the implementation of prologue clauses generated. This parser system was not tested on any real parallel computer. ...
doi:10.46754/umtjur.v1i3.82
fatcat:qwluc5qhebdvvbqrhv43ixt544
LR parsers for natural languages
1984
Proceedings of the 22nd annual meeting on Association for Computational Linguistics -
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
MLR, an extended LR parser, is introduced, and its application to natural language parsing is discussed. An LR parser is a ~;hift-reduce parser which is doterministically guided by a parsing table. ...
The MLR parser and its parsing table generator have been implemented at Carnegie-Mellon University. ...
Acknowledgements I would like to thank Takehiro Tokuda, Osamu Watanabe, Jaime Carbonell and Herb Simon for thoughtful comments on an earlier version of this paper. ...
doi:10.3115/980491.980564
dblp:conf/coling/Tomita84
fatcat:3oq5uud6zran5p3t2ksub2xxq4
Page 714 of Mathematical Reviews Vol. , Issue 81B
[page]
1981
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Masiny i Kompleksy No. 2 (1979), 35-39, 106, Authors’ summary: “We propose a procedure for parallel syntactic analysis of context-free languages. ...
This paper is in the tradition of using models more powerful than context-free grammars to describe programming languages. ...
Page 2109 of Mathematical Reviews Vol. 50, Issue 6
[page]
1975
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The authors present a two-parameter family of parsers M,' for general context-free grammars. ...
Stockii (Moscow)
Bouckaert, M.; Pirotte, A.; Snelling, M. 15443 Efficient parsing algorithms for general context-free parsers. Information Sci. 8 (1975), 1-26. ...
Parallel non-deterministic bottom-up parsing
1971
Proceedings of the international symposium on Extensible languages -
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
The development of translator writing systems and extensible languages has led to a simultaneous development of more efficient and general syntax analyzers, usually for context-free (CF) syntax. ...
Our paper describes a type of parser that can be used with reasonable efficiency for any CF grammar, even one which is ambiguous. ...
The parser is easy to generate for any CF grammar, requiring only the computation of precedence tables. ...
doi:10.1145/800006.807982
fatcat:ucp4tcjs5fgjdoj6n7wqu5guuu
Evaluation of a parallel chart parser
1988
Proceedings of the second conference on Applied natural language processing -
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
We describe a parallel implementation of a chart parser for a shared-memory multiprocessor. The speed-ups obtained with this parser have been measured for a number of small natural-language grammars. ...
For the largest of these, part of an operational question-answering system, the parser ran 5 to 7 times faster than the serial version. ...
For general context-free grammars, it is possible to adapt the Cocke-Younger-Kasami algorithm (Aho and Ullman 1972, p. 314 if) for parallel use. ...
doi:10.3115/974235.974248
dblp:conf/anlp/GrishmanC88
fatcat:k52ybwbrwzht3nqk4fz2kflsie
A grammar-based approach to automatic generation of user-interface dialogues
1988
Proceedings of the SIGCHI conference on Human factors in computing systems - CHI '88
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
In this paper we explain the motivation for our work and provide practical examples of the use of fork and context. In addition, we outline algorithms for parsing and for generating parser tables. ...
We propose a notation for specifying dialogues based on context-free attributed grammars with two extensions: fork operators for specifying sub-dialogues and co&e& attributes for dispatching tokens. ...
ACKNOWLEDGMENT David Sher provided the proof that fork operators can generate non-context-free languages. ...
doi:10.1145/57167.57179
fatcat:hgkntt5l4nax5nqj3ubolpbmf4
Page 6513 of Mathematical Reviews Vol. , Issue 98J
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
for classes of non-context-free languages. ...
Furthermore, they demonstrate how “standard” parsing techniques for LL(1) and LR(1) context-free languages can be adapted to produce lin- ear time parsers for LDG languages satisfying the appropriate LL ...
Parallel non-deterministic bottom-up parsing
1971
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
The development of translator writing systems and extensible languages has led to a simultaneous development of more efficient and general syntax analyzers, usually for context-free (CF) syntax. ...
Our paper describes a type of parser that can be used with reasonable efficiency for any CF grammar, even one which is ambiguous. ...
The parser is easy to generate for any CF grammar, requiring only the computation of precedence tables. ...
doi:10.1145/942582.807982
fatcat:hprukapq4rheda42oldfl7mska
Polynomial time and space shift-reduce parsing of arbitrary context-free grammars
1991
Proceedings of the 29th annual meeting on Association for Computational Linguistics -
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
We introduce an algorithm for designing a predictive left to right shift-reduce non-deterministic push-down machine corresponding to an arbitrary unrestricted context-free grammar and an algorithm for ...
At run time, the machine is driven in pseudo-parallel with the help of a chart. The recognizer behaves in the worst case in O(IGI2n3)-time and O(IGIn2)-space. ...
An efficient augmentedcontext-free parsing algorithm. Linguistics, 13:31-46. D. H. Younger. 1967. Recognition and parsing of context-free languages in time n 3. ...
doi:10.3115/981344.981358
dblp:conf/acl/Schabes91
fatcat:aiviavudaje5zne4or5fd6vpnu
Page 252 of Mathematical Reviews Vol. 55, Issue 1
[page]
1978
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
As an application, we | show that for every family of deterministic context-free pushdown | parsers (e.g., precedence, LR(k), LL(k), ---) there is a family of | general context-free parallel parsers that ...
Further, exponential lower bounds on several decidable problems for context-free grammars generating finite sets are obtained, all nontrivial predicates for certain specific classes of languages are shown ...
« Previous
Showing results 1 — 15 out of 10,697 results