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 46 for “"Parse Trees"”.

  1. Kernel engineering on parse trees

    … the input data is represented as sequences, trees and even graphs. Traditional feature based methods transform these structured input data into vectorial representation by sophisticated feature engineering, which is argued infeasible to fully explore the structure features. Alternatively, …

    nus Repository record for Kernel engineering on parse trees (opens in a new tab) Download file for Kernel engineering on parse trees (opens in a new tab)

  2. The Design & Implementation of an Abstract Semantic Graph for Statement-Level Dynamic Analysis of C++ Applications

    … application. We begin by extending the GNU gcc parser to generate parse trees in XML format for each of the compilation units in a C++ application. We then provide verification that the generated parse trees are structurally equivalent to the code in the original C++ application. We use the …

    clemson Repository record for The Design & Implementation of an Abstract Semantic Graph for Statement-Level Dynamic Analysis of C++ Applications (opens in a new tab)

  3. Architectural synthesis of analogue filters from behavioural VHDL-AMS descriptions

    … constructs from behavioural filter models using parse trees. They can be extended to support a more general, mixed-signal synthesis system based on VHDL-AMS. An effective architectural optimisation engine for analogue filter synthesis has been developed to minimise transfer function accuracy …

    soton Download PDF for Architectural synthesis of analogue filters from behavioural VHDL-AMS descriptions (opens in a new tab)

  4. Toward complex data structure aggregation and truth discovery

    … to aggregate sequential labels and constituency parse trees. In the first scenario, we aim to aggregate sequence labels from crowds in the absence of ground truth. An optimization-based sequential label aggregation (AggSLC) method is proposed that infers the best set of annotation aggregated …

    iastate Repository record for Toward complex data structure aggregation and truth discovery (opens in a new tab)

  5. Source Transformation with Boolean Grammars

    … of languages, Boolean grammars capture multiple parse trees of the same document simultaneously, allowing one to switch between these parse "views". In particular, source transformation and reengineering tasks can benefit from parse views by recasting the input text into whichever parse is most …

    queens Repository record for Source Transformation with Boolean Grammars (opens in a new tab)

  6. Mkparse -- an interactive parser generator

    The design and implementation of an interactive parser generator, Mkparse, are presented in this thesis. Mkparse is the second tool in the Mk* series of tools for com­piler construction. Mkparse encourages the user to design a language starting from its abstract syntax instead of from its concrete …

    uvic Repository record for Mkparse -- an interactive parser generator (opens in a new tab)

  7. GP-Automata working in pairs to solve the Tartarus problem

    … made up of a finite state machine and a group of parse trees. There is one parse tree associated with each state of the finite state machine. Each parse tree can receive input and produce an index that identifies its state's output and which state to go to next. For this thesis, we apply …

    iastate Repository record for GP-Automata working in pairs to solve the Tartarus problem (opens in a new tab)

  8. A visualization system for information retrieval and mining in high dimensional databases

    … tertiary structures, 3D molecules, phylogenetic trees, neuroanatomical networks, parse trees, CAD/CAM parts, and XML documents. Answering queries on such databases often requires solving variants of the graph isomorphism or subisomorphism problems. We also describe a graphic user interface which …

    njit Repository record for A visualization system for information retrieval and mining in high dimensional databases (opens in a new tab)

  9. A graphical environment for change detection in structured documents

    … pattern matching and pattern discovery in trees. Several operators are developed to support. the comparison of the documents; graphical devices are provided to facilitate the use of the operators. We believe the proposed tool is useful for not only document management, but also software …

    njit Repository record for A graphical environment for change detection in structured documents (opens in a new tab)

  10. Learning for semantic parsing with kernels under various forms of supervision

    … obtained by finding the most probable semantic parse using these classi- fiers. This method does not use any hard-matching rules and unlike previous and other recent methods, does not use grammar rules for natural language, probabilistic or otherwise, which makes it more robust to noisy input. …

    texas Repository record for Learning for semantic parsing with kernels under various forms of supervision (opens in a new tab)

  11. Null Element Restoration

    … structures produced by the most commonly used parsers are less detailed than those structures found in the treebanks the parsers were trained on. In particular, these parsers typically lack the null elements used to indicate wh-movement, control, and other phenomena. This thesis presents a …

    penn Repository record for Null Element Restoration (opens in a new tab)

  12. Predicting RNA secondary structure using a stochastic conjunctive grammar

    … one sequence is generated by combining multiple parse trees. I create several grammars that are designed to predict pseudoknotted RNA sec- ondary structure. One grammar is designed to predict all types of pseudoknots and the others are made to only predict a pseudoknot called H-type. These …

    manitoba Repository record for Predicting RNA secondary structure using a stochastic conjunctive grammar (opens in a new tab)

  13. NEW ADVANCES IN REORDERING FOR STATISTICAL MACHINE TRANSLATION

    … the reordering problem by exploiting dependency parse trees in the phrase-based statistical machine translation approach. We propose a novel approach to detect translation ordering of two words and apply sparse dependency swap features in translation decoding to encourage good translation output …

    nus Repository record for NEW ADVANCES IN REORDERING FOR STATISTICAL MACHINE TRANSLATION (opens in a new tab) Download file for NEW ADVANCES IN REORDERING FOR STATISTICAL MACHINE TRANSLATION (opens in a new tab)

  14. THE SCIENCE OF SPEECH: DEVELOPING A COMPUTATIONAL MODEL FOR DIGITAL COMMUNICATION AND ITS RAMIFICATIONS FOR AUTHOR IDENTIFICATION IN CYBERSECURITY

    … to commit a forgery of some kind. However, most parse trees focus on either the human, or the machine, side of the Human-Machine Interface (HMI). Incorporating both sides of the HMI better accounts for the unique digital signature every web author creates by analyzing stylometry and keystroke …

    nps Repository record for THE SCIENCE OF SPEECH: DEVELOPING A COMPUTATIONAL MODEL FOR DIGITAL COMMUNICATION AND ITS RAMIFICATIONS FOR AUTHOR IDENTIFICATION IN CYBERSECURITY (opens in a new tab)

  15. Citation Handling: Processing Citation Texts in Scientific Documents

    … natural language processing components, such as parsers or sentence compressors, will perform poorly if those components cannot handle citations correctly. In this thesis, I examine the effect of citation handling on parsing, sentence compression, and multi-document summarization. There are two …

    maryland Repository record for Citation Handling: Processing Citation Texts in Scientific Documents (opens in a new tab)

  16. Unsupervised Disambiguation of Abstract

    … This thesis focus on disambiguating parse trees created by Grammatical Framework — a formal language that represent meaning of natural language sentences with abstract syntax trees in order to do machine translation. Since one tree represents a meaning, for every sentence there exists …

    chalmers Repository record for Unsupervised Disambiguation of Abstract (opens in a new tab)

  17. Automatised analysis of emergency calls using Natural Language Processing

    … good at answering specific questions. Comparing parse trees seems promising, but the technology needs more work before it is ready to be used. The solutions presented show that it could be possible to automatise the analysis of the calls given that the right questions are asked and the results …

    chalmers Repository record for Automatised analysis of emergency calls using Natural Language Processing (opens in a new tab)

  18. Distance Measures for Probabilistic Patterns

    … as feature vectors. Examples include strings, parse trees, time series, random spatial fields, and random graphs [79] [117]. Distance measures are not arbitrary. They can only be effective when they incorporate information about the problem domain; this is a direct consequence of the Ugly …

    waterloo Repository record for Distance Measures for Probabilistic Patterns (opens in a new tab)

  19. Tree-Based Graph Neural Networks for Natural Language Inference: From Structure-Only to Hybrid Architectures

    … graph neural networks operating on dependency parse trees can provide more parameter-efficient sentence representations for natural language inference, evaluated on two NLI tasks: entailment classification and semantic textual similarity. Tree Matching Networks (TMN) adapt Graph Matching …

    eastern-wash Repository record for Tree-Based Graph Neural Networks for Natural Language Inference: From Structure-Only to Hybrid Architectures (opens in a new tab)

  20. An Empirical Study on Bash Language Usage in Github

    … a large dataset of Bash script source code, parse trees and code smell reports of each collected Bash script to facilitate future research in Bash language.

    waterloo Repository record for An Empirical Study on Bash Language Usage in Github (opens in a new tab)

Page 1 of 3