BibSonomy publications for /user/diego_ma/DGWed Nov 11 22:33:09 CET 2009SydneyProceedings COLING/ACL 2006889-896Exploring Correlation of Dependency Relation Paths for Answer Extraction2006question_answering machine_learning dependencies DG In this paper, we explore correlation of dependency relation paths to rank candidate answers in answer extraction. Using the correlation measure, we compare dependency relations of a candidate answer and mapped question phrases in sentence with the corresponding relations in question. Different from previous studies, we propose an approximate phrase mapping algorithm and incorporate the mapping score into the correlation measure. The correlations are further incorporated into a Maximum Entropy-based ranking model which estimates path weights from training. Experimental results show that our method significantly outperforms state-ofthe-art syntactic relation-based methods by up to 20% in MRR.Tue Sep 15 17:22:44 CEST 2009Traitement Automatique des Langues (TAL)315-39Linguistic Knowledge and Question Answering462005question_answering DG Tue Mar 04 07:52:43 CET 2008Proceedings of the Workshop on Using Corpora for Natural Language Generation (UCNLG'05) at Corpus Linguistics 2005Statistically Generated Summary Sentences: A Preliminary Evaluation of Verisimilitude using Precision of Dependency Relations2005summarisation , DG 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.Fri Dec 14 02:49:25 CET 2007MontrealProcessing of Dependency-Based Grammars: Proceedings of the Workshop COLING-ACL981998DG Fri Dec 14 02:49:14 CET 2007ParisTraitement Automatique des Langues: Special Issue on Dependency Grammars2000DG Fri Dec 14 02:47:20 CET 2007Bulletin de la Facult{\'e} des Lettres de Strasbourg7219-229Comment Construire une Syntaxe121934DG Fri Dec 14 02:47:19 CET 2007ParisEl{\'e}ments de Syntaxe Structurale1959DG Fri Dec 14 02:47:16 CET 2007Proc. ANLP-97A Non-Projective Dependency Parser1997DG parsers Fri Dec 14 02:46:29 CET 2007DordrechtThe Meaning of the Sentence in Its Semantic and Pragmatic Aspects1986DG Fri Dec 14 02:46:18 CET 2007NovFunctional Non-Projective Parsing with Dependency Grammar ({DG})1998DG parsers Fri Dec 14 02:44:59 CET 2007MoscowRusskij Sintaksis v Nau{\v n}om Osve{\v s}{\v c}nii (Russian Syntax: a Scientific Approach1934DG Fri Dec 14 02:44:41 CET 2007Conexor Functional Dependency Grammar 3.7 --- User's Manual2002parsers DG Fri Dec 14 02:44:27 CET 2007Madrid, SpainProc. ACL/EACL'97The Complexity of Recognition of Linguistically Adequate Dependency Grammars1997DG Fri Dec 14 02:43:17 CET 2007Montreal, CanadaProc. Coling-ACL'98 Workshop on Processing of Dependency Grammars78-87Decision Procedures for Dependency Parsing Using Graded Constraints1998DG robust_parsing Fri Dec 14 02:43:16 CET 2007Dependency Syntax: Theory and Practice1988DG Fri Dec 14 02:42:39 CET 2007MontrealProcessing of Dependency-Based Grammars; proceedings of the workshop. COLING-ACLUnit Coordination and Gapping in Dependency Theory1998DG Fri Dec 14 02:42:27 CET 2007Proc. Workshop on the Evaluation of Parsing SystemsGranadaDependency-based Evaluation of MINIPAR1998parsers DG Fri Dec 14 02:41:42 CET 2007Proc. LLC8Constraint Programming Technology in Computational Linguistics1999underspecification constraint_programming DG Constraint programming is a programming paradigm that was originally invented in computer science to deal with hard combinatorial problems. Recently, constraint programming has evolved into a technology which permits to solve hard industrial scheduling and optimization problems. We argue that existing constraint programming technology can be useful for applications in natural language processing. Some problems whose treatment with traditional methods requires great care to avoid combinatoric explosion of (potential) readings seem to be solvable in an efficient and elegant manner using constraint programming. We illustrate our claim by two recent examples, one from the area of underspecified semantics and one from parsing.Fri Dec 14 02:41:15 CET 2007Proc. COLING-ACL'98Pseudo-Projectivity: A Polynomially Parsable Non-Projective Dependency Grammar1998DG