Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 152 for “"Parsers"”.

  1. Optimization of directly executable LR parsers

    Directly-executable parsers enable compilers and other parse-intensive applications to run significantly faster than those which use table-driven parsers. The cost for increased speed is a larger parser. It is possible to further increase parsing speed by applying various optimization algorithms at …

    uvic Repository record for Optimization of directly executable LR parsers (opens in a new tab)

  2. Using Natural Language Parsers for Authorship Attribution

    … texts by each author were run through both parsers. The output of each parser was analyzed using two multivariate analysis methods: discriminant analysis and cluster k- means. My results show that syntactic sentence structures may be a viable method for authorship attribution. The Link …

    rit Repository record for Using Natural Language Parsers for Authorship Attribution (opens in a new tab)

  3. Detecting grammatical errors with treebank-induced, probabilistic parsers

    Today's grammar checkers often use hand-crafted rule systems that define acceptable language. The development of such rule systems is labour-intensive and has to be repeated for each language. At the same time, grammars automatically induced from syntactically annotated corpora (treebanks) are …

    dcu Download PDF for Detecting grammatical errors with treebank-induced, probabilistic parsers (opens in a new tab)

  4. The Generation of Error Recovering Simple Precedence Parsers

    … and error recovery in simple precedence parsers is given, and in particular the error detection of Leinius, and the error recovery of Rhodes are described. An implementation of a system which generates error recovering simple precendence parsers is presented. The system divides into two …

    mcmaster Repository record for The Generation of Error Recovering Simple Precedence Parsers (opens in a new tab)

  5. Effectiveness of pre-trained morphological parsers for text classification /

    State-of-the-art models for natural language processing (NLP), such as transformers, employ positional encodings, which, according to our hypothesis, are not as effective at extracting grammatical functions of words for highly inflected languages. This is due to highly inflected languages employing …

    vilnius Repository record for Effectiveness of pre-trained morphological parsers for text classification / (opens in a new tab)

  6. Table driven prediction for recursive descent LL(k) parsers

    … process of converting these descriptions into parsers is performed by parser generators. Some of the parser generators that convert LL grammars into parsers construct them to use recursive descent that gives them context during execution. The context is provided by the execution stack as the …

    rit Repository record for Table driven prediction for recursive descent LL(k) parsers (opens in a new tab)

  7. Construction of LR(k) parsers with application to Algol 68

    … a powerful method of automatic construction of parsers for context free grammars. The methodology provided by De Remer is implemented for all classes of LR (k) grammars. The practical implementation of the translator limits k to 15. The necessity of having error recovery for any parsing …

    ubc Repository record for Construction of LR(k) parsers with application to Algol 68 (opens in a new tab) Download PDF for Construction of LR(k) parsers with application to Algol 68 (opens in a new tab)

  8. The use of deterministic parsers on sublanguage for machine translation

    … the practicability of using Deterministic Parsers in the analysis stage of a Machine Translation system. Machine Translation, Sublanguage and parsing are described in general terms with a review of Deterministic parsing systems, pertinent to this research, being presented in detail. The …

    aston Download PDF for The use of deterministic parsers on sublanguage for machine translation (opens in a new tab)

  9. Sempar — A Tool for Construction-Time Specification of Linting in Parsers

    A linter is a good tool to aid developers, however they are most common in larger, well-used languages such as Java or Python. They aid by giving feedback to the developer regarding their code, for example about code style or bad practices. A common problem is that it is hard to find linters for …

    chalmers Repository record for Sempar — A Tool for Construction-Time Specification of Linting in Parsers (opens in a new tab)

  10. A mechanism to evaluate context-free queries inspired in LR(1) parsers over graph databases

    The World Wide Web is an always increasing collection of information. This information is spread among different documents, which are made available by using the HTTP. Even though this information is accessible to users in the form of news articles, audio broadcasts, images and videos, software …

    brazil-ufrn Repository record for A mechanism to evaluate context-free queries inspired in LR(1) parsers over graph databases (opens in a new tab)

  11. Optimizing Log Parsing: Template Refinement and Semantic Generalization

    … sections: 1) an empirical study of existing log parsers, 2) SynLog+, and 3) GeLT. In the empirical study, we evaluate syntax-based, semantic-based, and hybrid log parses. The observations from the study indicates two issues. Firstly, there is a gap between the pars- ing accuracy of the syntax- …

    york Repository record for Optimizing Log Parsing: Template Refinement and Semantic Generalization (opens in a new tab)

  12. Faster Tomita parsing

    … Much research has addressed speeding up LR parsers, in this thesis, we argue that this previous work is not transferable to Tomita parsers. To speed up LR parsers, we reduce LR parsing overhead two ways: grammar transformations unroll recursion, and larger finite automata in the parser trade …

    uvic Repository record for Faster Tomita parsing (opens in a new tab)

  13. Typed, Algebraic Parser in Idris2

    … Parser combinators are a popular way of building parsers, which use the tools in the host programming language to build small parsers and compose them into more complex parsers. Parser combinators are usually built using a recursive descent approach with backtracking and multiple lookahead tokens, …

    buffalo Repository record for Typed, Algebraic Parser in Idris2 (opens in a new tab)

Page 1 of 8