|
[1]Gennaro Chierchia and Sally McConnell-Ginet, “Meaning and Grammar: An introduction to Semantics”, The MIT press, Cambridge, MA, 2000
[2]Ido Dagan and Oren Glickman, Probabilistic textual entailment: Generic applied modeling of language variability, In Proceedings of the Workshop on Learning Methods for Text Understanding and Mining, Grenoble, France, 2004.
[3]NTCIR 9, Recognizing Inference in TExt task, http://artigas.lti.cs.cmu.edu/rite/Main_Page.
[4]Ion Androutsopoulos and Prodromos Malakasiotis, “A survey of paraphrasing and textual entailment methods”, Journal of Artificial Intelligence Research, Volume 38, pages 135-187, 2010.
[5]Michael Collins and Nigel Duffy, “ New ranking algorithms for parsing andtagging: Kernels over discrete structures, and the voted perceptron”, Proceedings of the 40th Annual Meeting on Association for Computational Linguistics, 2002.
[6]Johan Bos, Katja Markert, “Recognising textual entailment with logical inference”, Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing, Vancouver, B.C., Canada, 2005.
[7]Marta Tatu and Dan Moldovan, “COGEX at RTE 3”, In Proceedings of ACL-PASCAL Workshop on Textual Entailment and Paraphrasing, pages 22–27, Prague, Czech Republic, 2007.
[8]Marta Tatu, Dan Moldovan, “A semantic approach to recognizing textual entailment”, In Proceedings of HLT/EMNLP 2005, pages 371–378, Vancouver, Canada, 2005
[9]Christiane Fellbaum, “WordNet: An Electronic Lexical Database”, The MIT Press, 1998.
[10] Dan I. Moldovan and Vasile Rus, “Logic form transformation of WordNet and its applicability to question answering”, In Proceedings of the 39th Annual Meeting of ACL, pages 402–409, Toulouse, France, 2001.
[11]Dekang Lin, “An information-theoretic definition of similarity”, In Proceedings of the Fifteenth International Conference on Machine Learning (ICML-98) Madison, Wisconsin, 1998.
[12]Sebastian Padó and Mirella Lapata, “Dependency-based construction of semantic space models”, Computational Linguistics, Volume 33, No. 2, pages 161–199, 2007.
[13]Jeff Mitchell and Mirella Lapata, “Vector-based models of semantic composition”, In Proceedings of the 46th Annual Meeting of ACL: HLT, pages 236–244, Columbus, OH., 2008.
[14]Levenshtein, V, “Binary codes capable of correcting deletions, insertions, and reversals”, Soviet Physice-Doklady, 10, pages 707–710, 1966.
[15]Prodromos Malakasiotis, Ion Androutsopoulos, “Learning textual entailment using SVMs and string similarity measures”, In Proceedings of ACL-PASCAL Workshop on Textual Entailment and Paraphrasing, pages 42–47, Prague, Czech Republic, 2007.
[16]Wan, S., Dras, M., Dale, R., & Paris, C., “Using dependency-based features to take the “parafarce” out of paraphrase”, In Proceedings of the Australasian Language Technology Workshop, pages 131–138, Sydney, Australia, 2006.
[17]Kishore Papineni, Salim Roukos, Todd Ward and Wei-Jing Zhu, “BLEU: a method for automatic evaluation of machine translation”, In Proceedings of the 40th Annual Meeting on ACL, pages 311–318, Philadelphia, PA, 2002.
[18]Liang Zhou, Chin-Yew Lin and Eduard Hovy, “Re-evaluating machine translation results with paraphrase support”, In Proceedings of the Conference on EMNLP, pages 77–84 , Sydney, Australia, 2006.
[19]Prodromos Malakasiotis, “Paraphrase recognition using machine learning to combine similarity measures”, In Proceedings of the 47th Annual Meeting of ACL and the 4th International Joint Conference on Natural Language Processing of the Asian Federation of Natural Language Processing, Suntec, Singapore, 2009.
[20]Igor Mel''cuk, “Dependency Syntax: Theory and Practice”, State University of New York Press, 1987.
[21]Sandra Kübler, Ryan McDonald, and Joakim Nivre, “Dependency Parsing”. Synthesis Lectures on Human Language Technologies. Morgan and Claypool Publishers, 2009.
[22]Selkow, S., “The tree-to-tree editing problem”, The Journal of Information Processing Letters, Volume 6, No. 6, 184–186, 1977.
[23]Kuo-Chung Tai, “The tree-to-tree correction problem”, The Journal of ACM, Volume 26, No. 3, 422–433, 1979.
[24]Kaizhong Zhang and Dennis Shasha, “Simple fast algorithms for the editing distance between trees and related problems”, SIAM Journal of Computing, Volume 18, No. 6, pages 1245–1262, 1989.
[25]oll′a, D., Schwitter, R., Rinaldi, F., Dowdall, J., & Hess, M, Anaphora resolution in EXTRANS. In Proc. of the Int. Symposium on Reference Resolution and Its Applications to Question Answering and Summarization, pp. 23–25, Venice, Italy,2003.
[26]Mitchell, T, “Machine Learning”, Mc-Graw Hill. 1997.
[27]Ethem Alpaydin, “Introduction to Machine Learning”, The MIT Press, 2004.
[28]Yujie Zhang and Kazuhide Yamamoto, “Paraphrasing spoken Chinese using a paraphrase corpus”, The Journal of Natural Language Engineering, Volume 11, No. 4, pages 417–434, December, 2005.
[29] Fabio Massimo Zanzotto and Lorenzo Dell''Arciprete, “Efficient kernels for sentence pair classification”, In Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing, Volume 1, pages 91–100, Singapore, 2009.
[30]Eduard Hovy, “Toward finely differentiated evaluation metrics for machine translation”, In Proceedings of the Eagles Workshop on Standards and Evaluation, Pisa, Italy, 1999.
[31]J.S. White and T. O’Connell, “The ARPA MT evaluation methodologies: evolution, lessons, and future approaches”, In Proceedings of the First Conference of the Association for Machine Translation in the Americas, pages 193–205, Columbia, Maryland, 1994.
[32] Lun-Wei Ku and Hsin-Hsi Chen, “Mining Opinions from the Web: Beyond Relevance Retrieval”, Journal of American Society for Information Science and Technology,Volume 58 No 12, pages 1838- 1850, October, 2007
[33] Stanford parser, http://nlp.stanford.edu/software/lex-parser.shtml
[34]Min-Hsiang Li, Shih-Hung Wu, Ping-che Yang and Tsun Ku, “Chinese Characters Conversion System based on Lookup Table and Language Model”, In Proceedings of the 22nd Conference on Computational Linguistics and Speech Processing (ROCLING 2010), pages 113-127, Nantou, Taiwan, September 2010.
[35]K. Zhang and D. Sasha. “ Simple fast algorithms for the editing distance between trees and related problems”, Society for Industrial and Applied Mathematics Philadelphia, Volume 39 No 7, May 2010.
[36] Alessandro Moschitti, “Making tree kernels practical for natural language learning”, In Proceedings of 11th Conference of the European Chapter of the Association for Computational Linguistics (EACL2006), pages 113–120, Treato, Italy, 2006.
[37] ICTCLAS, http://ictclas.org/
[38] CKIP, http://ckipsvr.iis.sinica.edu.tw
[39] Roger Levy and Christopher Manning, “Is it harder to parse Chinese, or the Chinese Treebank?”, In Proceeding of the 41st Annual Meeting on Association for Computational Linguistics, Volume 1, pages 439-446, Sapporo Convention Center, Japan, 2003.
[40] LIBSVM, http://www.csie.ntu.edu.tw/~cjlin/libsvm/
|