Learning of graph-based question answering rules

Proceedings of TextGraphs: The 1st Workshop on Graph-Based Methods for Natural Language Processing

Volumn , Issue , 2020, Pages 37-44

  Mollá, Diego ^a  

^a MACQUARIE UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH ALGORITHMS; NATURAL LANGUAGE PROCESSING SYSTEMS;

GRAPH REPRESENTATION; GRAPH-BASED; QUESTION ANSWERING; TRAINING CORPUS;

GRAPHIC METHODS;

EID: 85081788600     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. H. Bunke, P. Foggia, C. Guidobaldi, C. Sansone, and M. Vento. 2002. A comparison of algorithms for maximum common subgraph on randomly connected graphs. In Lecture Notes on Computer Science, volume 2396, pages 123-132. Springer-Verlag, Heidelberg.
2. Noriko Kando. 2005. Overview of the fifth NTCIR workshop. In Proceedings NTCIR 2005.
3. Rada Mihalcea. 2004. Graph-based ranking algorithms for sentence extraction applied to text summarization. In Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics, companion volume (ACL 2004).
4. Gilad Mishne. 2004. Source code retrieval using conceptual graphs. Master's thesis, University of Amsterdam.
5. Diego Mollá and Menno van Zaanen. 2005. Learning of graph rules for question answering. In Proc. ALTW 2005, Sydney.
6. Diego Mollá and Menno van Zaanen. 2006. Answerfinder at TREC 2005. In Proceedings TREC 2005. NIST.
7. Manuel Montes-y-Gómez, Aurelio López-López, and Alexander Gelbukh. 2000. Information retrieval with conceptual graph matching. In Proc. DEXA-2000, number 1873 in Lecture Notes in Computer Science, pages 312-321. Springer-Verlag.
8. Sung H. Myaeng and Aurelio López-López. 1992. Conceptual graph matching: a flexible algorithm and experiments. Journal of Experimentation and Theoretical Artificial Intelligence, 4:107-126.
9. Maria Teresa Pazienza, Marco Pennacchiotti, and Fabio Massimo Zanzotto. 2005. Textual entailment as syntactic graph distance: a rule based and a SVM based approach. In Proceedings PASCAL RTE challenge 2005.
10. Ross Quillian. 1968. Semantic memory. In Semantic Information Processing, pages 216-270. MIT Press.
11. Deepak Ravichandran and Eduard Hovy. 2002. Learning surface text patterns for a question answering system. In Proc. ACL2002.
12. Roger C. Schank. 1972. Conceptual dependency: A theory of natural language understanding. Cognitive Psychology, 3(4):532-631.
13. Dan Shen, Geert-Jan M. Kruijff, and Dietrich Klakow. 2005. Exploring syntactic relation patterns for question answering. In Robert Dale, Kam-Fai Wong, Jian Su, and Oi Yee Kwong, editors, Natural Language Processing IJCNLP 2005: Second International Joint Conference, Jeju Island, Korea, October 11-13, 2005. Proceedings. Springer-Verlag.
14. M. M. Soubbotin. 2001. Patterns of potential answer expression as clues to the right answers. In Voorhees and Harman (Voorhees and Harman, 2001).
15. John F. Sowa. 1979. Semantics of conceptual graphs. In Proc. ACL 1979, pages 39-44.
16. Pasi Tapanainen and Timo Järvinen. 1997. A non-projective dependency parser. In Proc. ANLP-97. ACL.
17. Alessandro Vallin, Bernardo Magnini, Danilo Giampiccolo, Lili Aunimo, Christelle Ayache, Petya Osenova, Anselmo Penas, Maarten de Rijke, Bogdan Sacaleanu, Diana Santos, and Richard Sutcliffe. 2005. Overview of the CLEF 2005 multilingual question answering track. In Proceedings CLEF 2005. Working note.
18. Menno van Zaanen. 2002. Bootstrapping Structure into Language: Alignment-Based Learning. Ph.D. thesis, University of Leeds, Leeds, UK.
19. Ellen M. Voorhees and Donna K. Harman, editors. 2001. The Tenth Text REtrieval Conference (TREC 2001), number 500-250 in NIST Special Publication. NIST.
20. Ellen M. Voorhees. 2001a. Overview of the TREC 2001 question answering track. In Voorhees and Harman (Voorhees and Harman, 2001).
21. Ellen M. Voorhees. 2001b. The TREC question answering track. Natural Language Engineering, 7(4):361-378.