BibSonomy publications for /user/diego_ma/ExtrAnsWed Feb 20 02:26:16 CET 2008Proceedings 2003 International Symposium on Reference Resolution and Its Applications to Question Answering and SummarizationAnaphora Resolution in ExtrAns2003anaphora ExtrAns The true power of anaphora resolution algorithms can only be gauged when embedded into specific Natural Language Processing (NLP) applications. In this paper we describe the anaphora resolution module from ExtrAns, an answer extraction system. The anaphora resolution module is based on Lappin and Leass' original algorithm, which used McCord's Slot Grammar as the inherent parser. We report how to port Lappin and Leass' algorithm to Link Grammar, a freely available dependency-based parsing system that is used in a range of NLP applications. Finally, we report on how the equivalence classes that result from the anaphora resolution algorithm are incorporated into the logical forms used by ExtrAns.Tue Jan 29 09:04:48 CET 2008Batumi, GeorgiaProc. Third International Tbilisi Symposium on Language, Logic and Computation\myurl{http://www.ifi.unizh.ch/cl/}ExtrAns --- Answer Extraction from Technical Documents by Minimal Logical Forms and Selective Highlighting1999ExtrAns molla_publication Tue Jan 29 09:03:11 CET 2008Germersheim, GermanyProc. 34. Linguistisches {K}olloquiumInkrementelle Minimale Logische {F}ormen f{\"u}r die {A}ntwortextraktion1999answer_extraction semantics ExtrAns molla_publication Tue Jan 29 09:01:47 CET 2008New Directions in Question AnsweringZ-NewDirections:200471-82Question Answering in Terminology-Rich Technical Domains2004ExtrAns molla_publication Tue Jan 29 09:00:15 CET 2008Proc. ACL04 Workshop on Question Answering in Restricted DomainsAnswering Questions in the Genomics Domain2004question_answering ExtrAns There is a wealth of very useful information hidden in research papers in the biomedical domain. However the access to such information is often hindered by poor interfaces. To utilize these knowledge sources in an optimal way, researches and clinicians need to be able to retrieve answers about specific problem situations quickly and with high precision. In this contribution we describe current efforts aimed at adapting an existing Question Answering system to a new document set, namely research papers in the genomics domain. The system has been originally developed for another restricted domain, however it has already proved its portability. Nevertheless, the process is not painless, and the specific purpose of this paper is to describe the problems encountered.Tue Jan 29 08:59:29 CET 2008AmsterdamProc. ECAI2002 July 21-26 2002, Lyon, France460-464Towards Answer Extraction: An Application to Technical Domains2002ExtrAns molla_publication The shortcomings of traditional Information Retrieval are most evident when users require exact information rather than relevant documents. This practical need is pushing the research community towards systems that can exactly pinpoint those parts of documents that contain the information requested. Answer Extraction (AE) systems satisfy that need. This paper presents one such system (ExtrAns) which works by transforming documents and queries into a semantic representation called Minimal Logical Form (MLF) and derives the answers by logical proof from the documents. MLFs use underspecification to overcome the problems associated with a complete semantic representation and offer the possibility of monotonic, non-destructive extension.Tue Jan 29 08:57:50 CET 2008Traitement Automatique des Langues2495-522Extrans, an Answer Extraction System412000ExtrAns answer_extraction molla_publication Tue Jan 29 08:56:36 CET 2008Traitement Automatique des Langues1127-156Answer Extraction Using a Dependency Grammar in {ExtrAns}412000DG ExtrAns molla_publication We report on the implementation of an answer extraction system, ExtrAns, that uses the output of a dependency-based parser and grammar. In order to increase speed, the parser and grammar used sacrifice functionalism (in the framework of dependency theory) in favour of projectivity. We have found that the resulting dependency structures, although cumbersome to handle, can be used by ExtrAns to find the syntactic and semantic dependencies needed in several of the linguistic processing stages. In particular, we focus on the minimal logical form generation.Tue Jan 29 08:55:24 CET 2008IEEE Intelligent Systems412-17ExtrAns: Extracting Answers from Technical Texts182003ExtrAns molla_publication Tue Jan 29 08:54:34 CET 2008To be submitted to EACL99On the Use of Incremental Semantics in Answer Extraction1999ExtrAns molla_publication Tue Jan 29 08:53:38 CET 2008ZZZ-NLDB99219-224On the Scalability of the Answer Extraction System ``{ExtrAns}''1999ExtrAns molla_publication Tue Jan 29 08:52:06 CET 2008ViennaProc. of the 9th International Conference and Workshop on Database and Expert Systems. Workshop ``Natural Language and Information Systems'' (NLIS'98)August143-148A Real World Implementation of Answer Extraction1998ExtrAns molla_publication Tue Jan 29 08:45:14 CET 2008Internal report for ExtrAnsA First Attempt to Define the Semantics of a Sample Text for {ExtrAns}1997ExtrAns molla_publication Tue Jan 29 08:45:08 CET 2008\myurl{http://www.ifi.unizh.ch/CL/}{ExtrAns}: An Answer Extraction System for Unix Manpages -- On-line Manual1998ExtrAns molla_publication Tue Jan 29 08:27:07 CET 2008ParisProceedings of the fifth conference TALN 1998 (Traitement Automatique des Langues Naturelles)June12-21Extraction Automatique de R{\'e}ponses: impl{\'e}mentation du syst{\`e}me {ExtrAns}1998ExtrAns molla_publication Fri Dec 14 02:45:49 CET 2007MarchThe {WebExtrAns} Tokeniser2000tokeniser ExtrAns Fri Dec 14 02:43:54 CET 2007ParisWorkshop on Representation and Treatment of Syntactic Ambiguity in Natural Language Processing21-24Dealing with Ambiguities in an Answer Extraction System2000ExtrAns ambiguity Fri Dec 14 02:43:49 CET 2007Internal report for ExtrAnsThe {Alvey} system: A preliminary report1996ExtrAns Alvey Fri Dec 14 02:43:47 CET 2007Internal report for ExtrAns{ExtrAns} after a year1997ExtrAns Fri Dec 14 02:40:58 CET 2007User Manual for the Minimal Logical Form Generator2002ExtrAns This document describes how to use the Minimal Logical Form (MLF) generator that uses syntactic analyses produced by the Conexor FDG parser. This generator was built for use with the ExtrAns answer extraction system, however it has the potential to be used in other applications.