Contributions in Merlin

In this paper we describe on-going work aimed at creating a dependency-based annotated treebank for the BioMedical domain. Our starting point is the GENIA corpus, which is a corpus of 2000 MEDLINE abstracts, which has been manually annotated for various biological entities, according to the GENIA Ontology.1 There is an exponential growth of published research in this sector, which makes it difficult even for the experts to follow the recent developments. This creates the need for tools that can automatically process the research literature and extract only relevant information, such as interactions between genes and proteins. In order for these tools to be developed, annotated resources, such as corpora and Treebanks are of fundamental importance. Such resources will support the development of practical domain-specific information extraction tools.

This paper describes Pro3Gres, a fast, robust, broad-coverage parser that delivers deep-linguistic grammatical relation structures as output, which are closer to predicate-argument structures and more informative than pure constituency structures. The parser stays as shallow as is possible for each task, combining shallow and deep-linguistic methods by integrating chunking and by expressing the majority of long-distance dependencies in a context-free way. It combines statistical and rule-based approaches, different linguistic grammar theories and different linguistic resources. Preliminary evaluations indicate that the parser’s performance is state-of-the-art.

The current tendency in Question Answering is towards the processing of large volumes of open-domain text. This tendency is spurred by the creation of the Question Answering track in TREC, and the recent increase of systems that use the Web to extract the answers to the questions. This has undoubtly the advantage that narrow, application-specific concerns can be overlooked in favor of more general approaches. However the unconstrained nature of the domain and questions does not necessarily lead to systems that are better at specific tasks, as they might be required in a deployed application. It has been already been observed in other competitions (notably the Information Extraction competitions organized under the name of Message Understanding Conferences) that the nature of the competitive process tends to select a type of system that better adapts to the evaluation itself, rather than systems that deal in an optimal way with the problem. To use a comparison from evolution theory, a too severe selection in a given local environment leads to a converge of the population to a very limited genetic pool, which is then uncapable of coping with even a minor change in the environment. In restricted domains, systems cannot take advantage of the so-called ""Zipf's law of Questions"" Prager, which states that there is an inverse relation between the frequency of certain types of questions and their complexity. In other words, the questions most frequently asked are those that can be solved with simpler techniques. By targeting a smaller set of frequent questions types, system can achieve good results with limited effort. By contrast, the non-redundant nature of most technical documentation, and the use of domain specific sublanguage and terminology, makes them unsuitable to (some of) the approaches seen in the TREC QA competition. In the proposed contribution We will discuss the specific nature of technical documentation, with examples from real domains (e.g. the Maintenance Manual of a large commercial aircraft) and illustrate solutions that have been adopted in a deployed system. An example of the difference between technical documents and open domain texts is the focus on specific types of entities. While in Open Domain systems Named Entities play a major role, in Technical Documentation they are almost irrelevant, by contrast a far greater role is played by domain terminology. Technical domains present the additional problem of ""domain navigation"". By assuming that users are familiar with domain concepts, inexpert users are presented with a barrier separating questions from answers. Unfamiliarity with domain terminology might lead to questions which contain imperfect formulations of domain terms. A question answering system for junior doctors or training technicians needs therefore to use whatever scarce domain knowledge is contained in a query to extract relevant answers. Detecting terminological variants and exploiting the relations between terms (like synonymy, meronymy, antonymy) is vital to this task. Another idiosyncrasy of technical domains is the tendency towards definitional questions (""what is the ANT connection?""), which prove tricky to answer precisely in a generic document collection (and for this reason they have been deliberately left out of the recent TREC 2002). In Technical Domains it can be expected that such type of question would play a major role, and therefore systems must be capable of coping with them. In this book chapter we aim to explain the above concepts and illustrate them with examples taken from text from technical domains. We will also illustrate why techniques that are typically used in data-intensive open-domain question-answering systems would not work effectively in technical domains that have less data redundancy. In sum, we will show that question-answering of technical domains present a better opportunity to explore content-based approaches to question-answering, while at the same time bringing the possibility of producing commercially viable systems in the short term.

null

null

Simulation is a common means for validating requirements models. Simulating formal models is state-of-the-art. However, requirements models usually are not formal for two reasons. Firstly, a formal model cannot be generated in one step. Requirements are vague in the beginning and are refined stepwise towards a more formal representation. Secondly, requirements are changing, thus leading to a continuously evolving model. Hence, a requirements model will be complete and formal only at the end of the modeling process, if at all. If we want to use simulation as a means of continuous validation during the process of requirements evolution, the simulation technique employed must be capable of dealing with semi-formal, incomplete models. In this paper, we present an approach how we can handle partial models during simulation and use simulation to support evolution of these models. Our approach transfers the ideas of drivers, stubs, and regression from testing to the simulation of requirements models. It also uses the simulation results for evolving an incomplete model in a systematic way towards a more formal and complete one.

null

null