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 10 of 10 for “"Dependency Grammar"”.

  1. Improving Product-related Patent Information Access with Automated Technology Ontology Extraction

    … To realize patent claim parsing, a new dependency grammar framework was proposed. It makes efficient and effective claim parsing possible. For the invention comparison, a new graph similarity measure was proposed. The proposed similarity measure can overcome the weakness of previous …

    nus Repository record for Improving Product-related Patent Information Access with Automated Technology Ontology Extraction (opens in a new tab) Download file for Improving Product-related Patent Information Access with Automated Technology Ontology Extraction (opens in a new tab)

  2. From Atoms to the Solar System: Generating Lexical Analogies from Text

    … with similar relations. The system uses a <em>dependency grammar</em> to characterize semantic relations, and applies machine learning techniques to determine their similarities. Empirical evaluation shows that the system performs remarkably well, generating lexical analogies at a precision of …

    waterloo Repository record for From Atoms to the Solar System: Generating Lexical Analogies from Text (opens in a new tab)

  3. Using Dependency Parses to Augment Feature Construction for Text Mining

    … In this dissertation, we evaluate the utility of dependency parses as textual features for different text mining applications. Dependency parsing is one form of syntactic parsing, based on the dependency grammar implicit in sentences. While dependency parsing has traditionally been used for text …

    vt Repository record for Using Dependency Parses to Augment Feature Construction for Text Mining (opens in a new tab)

  4. Novel Estimation Methods for Unsupervised Discovery of Latent Structure in Natural Language Text

    … The experimentation focuses on a single dependency grammar induction task, in depth. The aim is to give strong support for the usefulness of the new techniques in one scenario. It must be noted, however, that the task (as defined here and in prior work) is somewhat artificial, and …

    jhu Repository record for Novel Estimation Methods for Unsupervised Discovery of Latent Structure in Natural Language Text (opens in a new tab)

  5. Automatic Annotation and Assessment of Syntactic Structures in Law Texts Combining Rule-Based and Statistical Methods

    … hybrid supertagger that analyzes topological dependency grammar relations in the German language. In this thesis, supertagging problems are seen as morphosyntactic ambiguity and syntactic resolution. Depending on the linguistic phenomena, the ambiguity is resolved by applying a rule-based and …

    zurich

  6. Unsupervised Structure Induction for Natural Language Processing

    … equivalence learning, the constituency grammar induction and the dependency grammar induction. In transliteration equivalence learning, transliterated bilingual word pairs are given without internal syllable alignments. The task is to automatically infer the mapping between syllables in …

    nus Repository record for Unsupervised Structure Induction for Natural Language Processing (opens in a new tab) Download file for Unsupervised Structure Induction for Natural Language Processing (opens in a new tab)

  7. 汉语交叉依存类非投射性现象 = Edge-crossing Non-projective Phenomenon in Chinese Language

    Most of Dependency-based parsing is only restricted in projective dependency. In order to improve parsing precision, it is inevitable to involve non-projective dependency in dependency parsing. Therefore, it is also an important topic for dependency research. We choose edge-crossing dependency, one …

    nus Repository record for 汉语交叉依存类非投射性现象 = Edge-crossing Non-projective Phenomenon in Chinese Language (opens in a new tab) Download file for 汉语交叉依存类非投射性现象 = Edge-crossing Non-projective Phenomenon in Chinese Language (opens in a new tab)

  8. Linguistically Motivated Combinatory Categorial Grammar Induction

    Combinatory Categorial Grammar (CCG) is a widely studied grammar formalism that has been used in a variety of NLP applications, e.g., semantic parsing, and machine translation. One key challenge in building effective CCG parsers is a lack of labeled training data, which is expensive to produce …

    washington Repository record for Linguistically Motivated Combinatory Categorial Grammar Induction (opens in a new tab)