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 9 of 9 for “"tree-adjoining grammar"”.

  1. Incorporating Punctuation Into the Sentence Grammar: A Lexicalized Tree Adjoining Grammar Perspective

    … The work here focuses on extending a syntactic grammar to handle phenomena occurring within a single sentence which have punctuation as an integral component. Punctuation marks are treated as full-fledged lexical items in a Lexicalized Tree Adjoining Grammar, which is an extremely well-suited …

    penn Repository record for Incorporating Punctuation Into the Sentence Grammar: A Lexicalized Tree Adjoining Grammar Perspective (opens in a new tab)

  2. Evolutionary Developmental Evaluation : the Interplay between Evolution and Development

    … developmental system called Developmental Tree Adjoining Grammar Guided Genetic Programming (DTAG3P), is implemented, embodying the requirements above. It is tested on a range of benchmark problems. The results indicate that the method generates more regularly-structured solutions than the …

    unsw Repository record for Evolutionary Developmental Evaluation : the Interplay between Evolution and Development (opens in a new tab)

  3. Generative and Computational Power of Combinatory Categorial Grammar

    Combinatory categorial grammar (CCG) is a mildly-context sensitive formalism that is well-established in computational linguistics. At the basis of the grammar are a lexicon and a rule system: The lexicon assigns syntactic categories to the symbols of a given input string, and the rule system …

    qucosa-diss

  4. Hybrid long-distance functional dependency parsing

    … werden. Diese Erweiterung ist bekannt aus der Tree-Adjoining Grammar (TAG) und erlaubt die Behandlung sogenannt mild kontextsensitiver Strukturen. 3. Das Parsen nichtgeschachtelter Phrasen (base phrases) kann erfolgreich durch flache Zugänge wie Chunking und Tagging angenähert werden. Wir …

    zurich

  5. Complexity of Lexical Descriptions and its Relevance to Partial Parsing

    … these ideas in the context of Lexicalized Tree-Adjoining Grammar (LTAG) framework wherein supertag disambiguation provides a representation that is an almost parse. We have used the disambiguated supertag sequence in conjunction with a lightweight dependency analyzer to compute noun groups, …

    penn Repository record for Complexity of Lexical Descriptions and its Relevance to Partial Parsing (opens in a new tab)

  6. Human-Guided Evolutionary-Based Linguistics Approach For Automatic Story Generation

    … story structure with a parameterised version of tree adjoining grammar as the story formalism. The results demonstrate that the system is able to produce coherent and complex stories with multiple characters, branches and long-distance dependency. Moreover, the system can collect good stories by …

    unsw Repository record for Human-Guided Evolutionary-Based Linguistics Approach For Automatic Story Generation (opens in a new tab)

  7. Formal and Computational Aspects of Natural Language Syntax

    … investigated in this thesis are based on the tree adjoining grammar (TAG) formalism of Joshi et al. (1975). TAG is an appealing formalism for the representation of natural language syntax because its elementary structures are phrase structure trees, which allows the linguist to localize …

    penn Repository record for Formal and Computational Aspects of Natural Language Syntax (opens in a new tab)

  8. Multiword expressions and the lexicon

    … I develop hinges formally on the use of a Tree-Adjoining Grammar (TAG), a tree-rewriting formalism which allows us to store (internally structured) phrases as elementary objects. This is integrated into the architecture of Lexical Functional Grammar (LFG), replacing the usual context-free …

    oxford Repository record for Multiword expressions and the lexicon (opens in a new tab)

  9. A Model of Unsupervised Formal Learning for Natural Language

    … Unsupervised statistical models that leverage grammar formalisms have not yet achieved the same level of performance, despite advantages in interpretability. I introduce a variably supervised learning algorithms that can directly apply the rules of a number of different grammar formalisms to …

    cornell Repository record for A Model of Unsupervised Formal Learning for Natural Language (opens in a new tab)