Sciweavers

64 search results - page 4 / 13
» Semantic Completeness in Sub-ontology Extraction Using Distr...
Sort
View
ECAI
2008
Springer
13 years 9 months ago
Task Driven Coreference Resolution for Relation Extraction
Abstract. This paper presents the extension of an existing mimimally supervised rule acquisition method for relation extraction by coreference resolution (CR). To this end, a novel...
Feiyu Xu, Hans Uszkoreit, Hong Li
EMNLP
2009
13 years 5 months ago
Supervised Learning of a Probabilistic Lexicon of Verb Semantic Classes
The work presented in this paper explores a supervised method for learning a probabilistic model of a lexicon of VerbNet classes. We intend for the probabilistic model to provide ...
Yusuke Miyao, Jun-ichi Tsujii
ADBIS
2003
Springer
127views Database» more  ADBIS 2003»
14 years 27 days ago
Using Common Schemas for Information Extraction from Heterogeneous Web Catalogs
The Web has become the world’s largest information source. Unfortunately, the main success factor of the Web, the inherent principle of distribution and autonomy of the participa...
Richard Vlach, Wassili Kazakos
CONCUR
2010
Springer
13 years 8 months ago
A Geometric Approach to the Problem of Unique Decomposition of Processes
This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs ar...
Thibaut Balabonski, Emmanuel Haucourt
WWW
2007
ACM
14 years 8 months ago
Just the right amount: extracting modules from ontologies
The ability to extract meaningful fragments from an ontology is key for ontology re-use. We propose a definition of a module that guarantees to completely capture the meaning of a...
Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazako...