Sökning: "graph extensions"

Visar resultat 1 - 5 av 14 avhandlingar innehållade orden graph extensions.

  1. 1. Best Trees Extraction and Contextual Grammars for Language Processing

    Författare :Anna Jonsson; Johanna Björklund; Frank Drewes; Hendrik Jan Hoogeboom; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Weighted tree automata; the N-best problem; efficient algorithms; semantic graph; abstract meaning representation; contextual graph grammars; hyperedge replacement; graph extensions;

    Sammanfattning : In natural language processing, the syntax of a sentence refers to the words used in the sentence, their grammatical role, and their order. Semantics concerns the concepts represented by the words in the sentence and their relations, i.e., the meaning of the sentence. LÄS MER

  3. 2. Random Graph and Growth Models

    Författare :Sebastian Rosengren; Maria Deijfen; Pieter Trapman; Tatyana Turova; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematical Statistics; matematisk statistik;

    Sammanfattning : Random graphs is a well-studied field of probability theory, and have proven very useful in a range of applications — modeling social networks, epidemics, and structures on the Internet to name a few. However, most random graphs are static in the sense that the network structure does not change over time. LÄS MER

  4. 3. Random Graphs: Dynamic and Multi-type Extensions

    Författare :Sebastian Rosengren; Maria Deijfen; Olle Nerman; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : Random graphs is a well-studied field of probability theory, and have proven very useful in a range of applications. However, most random graphs are \textit{static} in the sense that the network structure does not change over time; they also tend to consist of \textit{single-type} objects. This puts restrictions on possible applications. LÄS MER

  5. 4. Structural Models of Network Contacts Between Actors Governed by Activity and Attraction

    Författare :Zhi Geng; Statistiska institutionen; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Directed graph; Ego-nets; EM algorithm; Gibbs sampling; Multinomial distribution; Hypergeometric distribution; Vertex covariates; Clustering coefficient; Taylor expansion;

    Sammanfattning : This thesis consists of five papers on the subject of statistical modeling of stochastic networks. The NG-model proposed in Paper I combines a block structure with parameters that capture the identities of vertices and thus the new approach stresses the concept of ego-nets, which describes the structure around identified vertices. LÄS MER

  7. 5. Studies in extended unification-based formalism for linguistic description : an algorithm for feature structures with disjunction and a proposal for flexible systems

    Författare :Lena Strömbäck; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : Unification-based formalisms have been used in computational and traditional linguistics for quite some while. In these formalisms the feature structure is the basic structure for representing linguistic information. LÄS MER