Results 21 to 30 of about 10,154 (303)

Learning the Morphological and Syntactic Grammars for Named Entity Recognition

open access: yesInformation, 2022
In some languages, Named Entity Recognition (NER) is severely hindered by complex linguistic structures, such as inflection, that will confuse the data-driven models when perceiving the word’s actual meaning.
Mengtao Sun   +4 more
doaj   +1 more source

Translating Controlled Graph Grammars to Ordinary Graph Grammars

open access: yesElectronic Notes in Theoretical Computer Science, 2016
AbstractGraph Grammar (GG) is an appropriate formal language for specifying complex systems. In a GG the system states are represented by graphs and the changes between the states are described by rules. The use of GGs is interesting as there are several techniques for the specification and verification of systems that are described in this language ...
Alex Bertei   +2 more
openaire   +1 more source

Applications of A Hyper–Graph Grammar System in Adaptive Finite–Element Computations

open access: yesInternational Journal of Applied Mathematics and Computer Science, 2018
This paper describes application of a hyper-graph grammar system for modeling a three-dimensional adaptive finite element method. The hyper-graph grammar approach allows obtaining a linear computational cost of adaptive mesh transformations and ...
Gurgul Piotr   +3 more
doaj   +1 more source

Computing semantic similarity of texts based on deep graph learning with ability to use semantic role label information

open access: yesScientific Reports, 2022
We propose a deep graph learning approach for computing semantic textual similarity (STS) by using semantic role labels generated by a Semantic Role Labeling (SRL) system. SRL system output has significant challenges in dealing with graph-neural networks
Majid Mohebbi   +2 more
doaj   +1 more source

CREATING AND MAINTAINING IFC–CITYGML CONVERSION RULES [PDF]

open access: yesISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2019
We employ a triple graph grammar to enable configurable conversion from IFC to CityGML. In this paper, we present the mathematical framework behind the graph transformation approach as well as an application to create, store and maintain transformation ...
H. Tauscher
doaj   +1 more source

Problematic Unordered Queries in Temporal Moment Measurement by Using Natural Language

open access: yesIEEE Access, 2023
This study examines the difficulty in measuring temporal moments by using natural language (TMMNL) in the untrimmed video. The purpose of TMMNL is to use natural language query to find a specific moment within a lengthy video.
Hafiza Sadia Nawaz, Junyu Dong
doaj   +1 more source

Absence of phase transition in random language model

open access: yesPhysical Review Research, 2022
The random language model, proposed as a simple model of human languages, is defined by the averaged model of a probabilistic context-free grammar. This grammar expresses the process of sentence generation as a tree graph with nodes having symbols as ...
Kai Nakaishi, Koji Hukushima
doaj   +1 more source

Graph design by graph grammar evolution [PDF]

open access: yes2007 IEEE Congress on Evolutionary Computation, 2007
Determining the optimal topology of a graph is pertinent to many domains, as graphs can be used to model a variety of systems. Evolutionary algorithms constitute a popular optimization method, but scalability is a concern with larger graph designs. Generative representation schemes, often inspired by biological development, seek to address this by ...
Martin H. Luerssen, David M. W. Powers
openaire   +1 more source

Synthon approach and graph grammar [PDF]

open access: yes, 1983
The Corey's synthon approach is formalized by a special type of graph grammar. The graph language induced by this grammar is composed of all possible graphs (molecules) that can be constructed from the so-called starting graphs.
Vladimír Kvasnička
core   +1 more source

Engineering Grammar-Based Type Checking for Graph Rewriting Languages

open access: yesIEEE Access, 2022
The ability to handle evolving graph structures is important both for programming languages and modeling languages. Of various languages that adopt graphs as primary data structures, a graph rewriting language LMNtal provides features of both (concurrent)
Naoki Yamamoto, Kazunori Ueda
doaj   +1 more source

Home - About - Disclaimer - Privacy