DE eng

Search in the Catalogues and Directories

Hits 1 – 17 of 17

1
Evaluation and Cross-Comparison of Lexical Entities of Biological Interest (LexEBI) ...
Rebholz-Schuhmann, Dietrich; Kim, Jee-Hyub; Yan, Ying. - : Public Library of Science (PLoS), 2013
BASE
Show details
2
Evaluation and Cross-Comparison of Lexical Entities of Biological Interest (LexEBI)
Rebholz-Schuhmann, Dietrich; Kim, Jee-Hyub; Yan, Ying. - : Public Library of Science, 2013
BASE
Show details
3
Evaluation and Cross-Comparison of Lexical Entities of Biological Interest (LexEBI)
In: PLoS ONE. - 8, 10 (2013) , e75185, ISSN: 1932-6203 (2013)
BASE
Show details
4
Evaluation and cross-comparison of lexical entities of biological interest (LexEBI)
BASE
Show details
5
Evaluating gold standard corpora against gene/protein tagging solutions and lexical resources
BASE
Show details
6
Evaluating gold standard corpora against gene/protein tagging solutions and lexical resources
In: Rebholz-Schuhmann, Dietrich; Kafkas, Senay; Kim, Jee-hyub; Li, Chen; Yepes, Antonio Jimeno; Hoehndorf, Robert; Backofen, Rolf; Lewin, Ian (2013). Evaluating gold standard corpora against gene/protein tagging solutions and lexical resources. Journal of Biomedical Semantics, 4:28. (2013)
BASE
Show details
7
Evaluation and Cross-Comparison of Lexical Entities of Biological Interest (LexEBI)
In: Rebholz-Schuhmann, Dietrich; Kim, Jee-hyub; Yan, Ying; Dixit, Abhishek; Friteyre, Caroline; Hoehndorf, Robert; Backofen, Rolf; Lewin, Ian (2013). Evaluation and Cross-Comparison of Lexical Entities of Biological Interest (LexEBI). PLoS ONE, 8(10):e75185. (2013)
BASE
Show details
8
A First-Order Axiomatization of the Theory of Finite Trees
In: Journal of logic, language and information. - Dordrecht [u.a.] : Kluwer 4 (1995) 1, 5-40
OLC Linguistik
Show details
9
A first-order axiomatization of the theory of finite trees
BASE
Show details
10
A First-Order Axiomatization of the Theory of Finite Trees
In: IRCS Technical Reports Series (1995)
Abstract: We provide first-order axioms for the theories of finite trees with bounded branching and finite trees with arbitrary (finite) branching. The signature is chosen to express, in a natural way, those properties of trees most relevant to linguistic theories. These axioms provide a foundation for results in linguistics that are based on reasoning formally about such properties. We include some observations on the expressive power of these theories relative to traditional language complexity classes.
Keyword: Axiomatizations; Ehrenfeucht-Fraisse Games; First-Order Theories; Natural Language Syntax; Trees
URL: https://repository.upenn.edu/cgi/viewcontent.cgi?article=1119&context=ircs_reports
https://repository.upenn.edu/ircs_reports/117
BASE
Hide details
11
A Complete and Recursive Feature Theory ...
Backofen, Rolf; Smolka, Gert. - : arXiv, 1994
BASE
Show details
12
DISCO---An HPSG-based NLP System and its Application for Appointment Scheduling (Project Note) ...
BASE
Show details
13
DISCO - an HPSG-based NLP system and its application for appointment scheduling
BASE
Show details
14
A complete and recursive feature theory ...
Backofen, Rolf; Smolka, Gert. - : Universität des Saarlandes, 1992
BASE
Show details
15
A complete and recursive feature theory
BASE
Show details
16
Towards the integration of functions, relations and types in an AI programming language ...
Backofen, Rolf; Euler, Lutz; Görz, Günther. - : Universität des Saarlandes, 1991
BASE
Show details
17
Towards the integration of functions, relations and types in an AI programming language
BASE
Show details

Catalogues
0
0
1
0
0
0
0
Bibliographies
0
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
16
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern