The representation of semantic information in German machine readable dictionaries

Author(s):  
Winfried Lenders
2015 ◽  
Vol 32 (6) ◽  
pp. 908-917 ◽  
Author(s):  
Goksel Misirli ◽  
Matteo Cavaliere ◽  
William Waites ◽  
Matthew Pocock ◽  
Curtis Madsen ◽  
...  

Abstract Motivation: Biological systems are complex and challenging to model and therefore model reuse is highly desirable. To promote model reuse, models should include both information about the specifics of simulations and the underlying biology in the form of metadata. The availability of computationally tractable metadata is especially important for the effective automated interpretation and processing of models. Metadata are typically represented as machine-readable annotations which enhance programmatic access to information about models. Rule-based languages have emerged as a modelling framework to represent the complexity of biological systems. Annotation approaches have been widely used for reaction-based formalisms such as SBML. However, rule-based languages still lack a rich annotation framework to add semantic information, such as machine-readable descriptions, to the components of a model. Results: We present an annotation framework and guidelines for annotating rule-based models, encoded in the commonly used Kappa and BioNetGen languages. We adapt widely adopted annotation approaches to rule-based models. We initially propose a syntax to store machine-readable annotations and describe a mapping between rule-based modelling entities, such as agents and rules, and their annotations. We then describe an ontology to both annotate these models and capture the information contained therein, and demonstrate annotating these models using examples. Finally, we present a proof of concept tool for extracting annotations from a model that can be queried and analyzed in a uniform way. The uniform representation of the annotations can be used to facilitate the creation, analysis, reuse and visualization of rule-based models. Although examples are given, using specific implementations the proposed techniques can be applied to rule-based models in general. Availability and implementation: The annotation ontology for rule-based models can be found at http://purl.org/rbm/rbmo. The krdf tool and associated executable examples are available at http://purl.org/rbm/rbmo/krdf. Contact: [email protected] or [email protected]


2012 ◽  
Author(s):  
Darya L. Zabelina ◽  
Emmanuel Guzman-Martinez ◽  
Laura Ortega ◽  
Marcia Grabowecky ◽  
Mark Beeman ◽  
...  

1986 ◽  
Vol 65 (1) ◽  
pp. 9
Author(s):  
C.W. Painter
Keyword(s):  

1969 ◽  
Vol 08 (01) ◽  
pp. 07-11 ◽  
Author(s):  
H. B. Newcombe

Methods are described for deriving personal and family histories of birth, marriage, procreation, ill health and death, for large populations, from existing civil registrations of vital events and the routine records of ill health. Computers have been used to group together and »link« the separately derived records pertaining to successive events in the lives of the same individuals and families, rapidly and on a large scale. Most of the records employed are already available as machine readable punchcards and magnetic tapes, for statistical and administrative purposes, and only minor modifications have been made to the manner in which these are produced.As applied to the population of the Canadian province of British Columbia (currently about 2 million people) these methods have already yielded substantial information on the risks of disease: a) in the population, b) in relation to various parental characteristics, and c) as correlated with previous occurrences in the family histories.


2010 ◽  
Vol 3 (1) ◽  
pp. 1-30 ◽  
Author(s):  
Heike Baeskow

For many decades there has been a consensus among linguists of various schools that derivational suffixes function not only to determine the word-class of the complex expressions they form, but also convey semantic information. The aspect of suffix-inherent meaning is ignored by representatives of a relatively new theoretical direction – Neo-Construction Grammar – who consider derivational suffixes to be either purely functional elements of the grammar or meaningless phonological realizations of abstract grammatical morphemes. The latter view is maintained by adherents of Distributed Morphology, who at the same time emphasize the importance of conceptual knowledge for derivational processes without attempting to define this aspect. The purpose of this study is first of all to provide support for the long-standing assumption that suffixes are inherently meaningful. The focus of interest is on the suffixes -ship, -dom and -hood. Data from Old English and Modern English (including neologisms) will show that these suffixes have developed rich arrays of meaning which cannot be structurally derived. Moreover, since conceptual knowledge is indeed an important factor for word-formation processes, a concrete, theory-independent model for the representation of the synchronically observable meaning components associated with -ship, -dom and -hood will be proposed.


1997 ◽  
Vol 9 (1-3) ◽  
pp. 58-77
Author(s):  
Vitaly Kliatskine ◽  
Eugene Shchepin ◽  
Gunnar Thorvaldsen ◽  
Konstantin Zingerman ◽  
Valery Lazarev

In principle, printed source material should be made machine-readable with systems for Optical Character Recognition, rather than being typed once more. Offthe-shelf commercial OCR programs tend, however, to be inadequate for lists with a complex layout. The tax assessment lists that assess most nineteenth century farms in Norway, constitute one example among a series of valuable sources which can only be interpreted successfully with specially designed OCR software. This paper considers the problems involved in the recognition of material with a complex table structure, outlining a new algorithmic model based on ‘linked hierarchies’. Within the scope of this model, a variety of tables and layouts can be described and recognized. The ‘linked hierarchies’ model has been implemented in the ‘CRIPT’ OCR software system, which successfully reads tables with a complex structure from several different historical sources.


Sign in / Sign up

Export Citation Format

Share Document