Results 331 to 340 of about 179,036 (364)
Some of the next articles are maybe not open access.
Proceedings of the second conference on European chapter of the Association for Computational Linguistics -, 1985
The UCREL team at the University of Lancaster is engaged in the development of a robust parsing mechanism, which will assign the appropriate grammatical structure to sentences in unconstrained English text. The techniques used involve the calculation of probabilities for competing structures, and are based on the techniques successfully used in tagging
Roger Garside, Fanny Leech
openaire +2 more sources
The UCREL team at the University of Lancaster is engaged in the development of a robust parsing mechanism, which will assign the appropriate grammatical structure to sentences in unconstrained English text. The techniques used involve the calculation of probabilities for competing structures, and are based on the techniques successfully used in tagging
Roger Garside, Fanny Leech
openaire +2 more sources
Reusing batch parsers as incremental parsers
1995A simple solution to the incremental parsing problem is found by mapping sentential forms of a context-free grammar G over terminal strings of the placeholder language and then subtree forests, i.e. sequences of syntax sub-trees, over sequences of pairs (placeholdertoken, subtree-pointer).
openaire +2 more sources
Transforming a Chunker to a Parser [PDF]
, 2001 Ever since the landmark paper Ramshaw and Marcus (1995), machine learning systems have been used successfully for identifying base phrases (chunks), the bottom constituents of a parse tree. We expand a state-of-the-art chunking algorithm to a bottom-up parser by recursively applying the chunker to its own output.
openaire +2 more sources
ACM SIGPLAN Notices, 2011
We present a novel method of embedding context-free grammars in Haskell, and to automatically generate parsers and pretty-printers from them. We have implemented this method in a library called BNFC-meta (from the BNF Converter, which it is built on). The library builds compiler front ends using metaprogramming instead of conventional code generation ...
DuregårdJonas, JanssonPatrik
openaire +2 more sources
We present a novel method of embedding context-free grammars in Haskell, and to automatically generate parsers and pretty-printers from them. We have implemented this method in a library called BNFC-meta (from the BNF Converter, which it is built on). The library builds compiler front ends using metaprogramming instead of conventional code generation ...
DuregårdJonas, JanssonPatrik
openaire +2 more sources
International Journal of Intelligent Systems, 1987
A parser for natural language is proposed which, (a) concentrates on methodological procedures rather than grammatical details of a natural language; (b) is based on the claim that in order to exploit the full power of computers, models of human language processing should not necessarily be designed to simulate human behavior; and (c) is designed for ...
openaire +2 more sources
A parser for natural language is proposed which, (a) concentrates on methodological procedures rather than grammatical details of a natural language; (b) is based on the claim that in order to exploit the full power of computers, models of human language processing should not necessarily be designed to simulate human behavior; and (c) is designed for ...
openaire +2 more sources
LR—Automatic Parser Generator and LR(1) Parser
IEEE Transactions on Software Engineering, 1981LR is an LR(1) parser generation system. It is written entirely in portable ANS1 standard Fortran 66 and has been successfully operated on a number of computers. LR uses a powerful algorithm of Pager's to generate a space efficient parser for any LR(1) grammar.
C. Wetherell, A. Shannon
openaire +2 more sources
Acta Informatica, 1973
Knuth'sLR(1) parsing algorithm is sufficiently general to handle the parsing of most programming languages with the additional benefit of earlier detection of syntax errors than in other formal methods used in compilers. The major obstacle impeding the use of this algorithm is the large space requirement for parsing tables.
Anderson T, Eve J, Horning JJ
openaire +3 more sources
Knuth'sLR(1) parsing algorithm is sufficiently general to handle the parsing of most programming languages with the additional benefit of earlier detection of syntax errors than in other formal methods used in compilers. The major obstacle impeding the use of this algorithm is the large space requirement for parsing tables.
Anderson T, Eve J, Horning JJ
openaire +3 more sources
Acta Informatica, 1978
The concept of incremental parsing is briefly introduced. An algorithm which augments an LR parser with the capability of reanalyzing a limited part of a modified program is illustrated. The algorithm operates on a sequence of configurations representing the parse of the old input and finds the smallest part of the sequence which must be recomputed to ...
openaire +3 more sources
The concept of incremental parsing is briefly introduced. An algorithm which augments an LR parser with the capability of reanalyzing a limited part of a modified program is illustrated. The algorithm operates on a sequence of configurations representing the parse of the old input and finds the smallest part of the sequence which must be recomputed to ...
openaire +3 more sources
Proceedings of the 11th edition of the International Workshop on Smalltalk Technologies, 2016
Parser combinators are a popular approach to parsing. Parser combinators follow the structure of an underlying grammar, are modular, well-structured, easy to maintain, and can recognize a large variety of languages including context-sensitive ones. However, their universality and flexibility introduces a noticeable performance overhead.
Jan Vraný +4 more
openaire +2 more sources
Parser combinators are a popular approach to parsing. Parser combinators follow the structure of an underlying grammar, are modular, well-structured, easy to maintain, and can recognize a large variety of languages including context-sensitive ones. However, their universality and flexibility introduces a noticeable performance overhead.
Jan Vraný +4 more
openaire +2 more sources
Proceedings of the 9th conference on Computational linguistics -, 1982
Uppsala Chart Processor is a linguistic processor for phonological, morphological, and syntactic analysis. It incorporates the basic mechanisms of the General Syntactic Processor. Linguistic rules as well as dictionary articles are presented to the processor in a procedural formalism, the UCP-formalism.
openaire +2 more sources
Uppsala Chart Processor is a linguistic processor for phonological, morphological, and syntactic analysis. It incorporates the basic mechanisms of the General Syntactic Processor. Linguistic rules as well as dictionary articles are presented to the processor in a procedural formalism, the UCP-formalism.
openaire +2 more sources