{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T14:27:41Z","timestamp":1744900061752,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540334279"},{"type":"electronic","value":"9783540334286"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11736790_13","type":"book-chapter","created":{"date-parts":[[2006,4,6]],"date-time":"2006-04-06T15:10:48Z","timestamp":1144336248000},"page":"231-239","source":"Crossref","is-referenced-by-count":33,"title":["Textual Entailment Recognition Based on Dependency Analysis and WordNet"],"prefix":"10.1007","author":[{"given":"Jes\u00fas","family":"Herrera","sequence":"first","affiliation":[]},{"given":"Anselmo","family":"Pe\u00f1as","sequence":"additional","affiliation":[]},{"given":"Felisa","family":"Verdejo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Barzilay, R., Lee, L.: Learning to Paraphrase: An Unsupervised Approach UsingMultiple- Sequence Alignment. In: NAACL-HLT (2003)","DOI":"10.3115\/1073445.1073448"},{"key":"13_CR2","unstructured":"Bille, P.: Tree Edit Distance, Alignment Distance and Inclusion. Technical Report TR-2003- 23, IT Technical Report Series (March 2003)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Dagan, I., Glickman, O., Magnini, B.: The PASCAL Recognising Textual Entailment Challenge. In: Proceedings of the PASCAL Challenges Workshop on Recognising Textual Entailment, Southampton, UK, April 2005, pp. 1\u20138 (2005)","DOI":"10.1007\/11736790_9"},{"key":"13_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algoritms on Strings, Trees and Sequences","author":"R. Gusfield","year":"1997","unstructured":"Gusfield, R.: Algoritms on Strings, Trees and Sequences. Cambridge University Press, Cambridge (1997)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Hermjakob, U., Echibabi, A., Marcu, D.: Natural Language Based Reformulation Resource and Web Exploitation for Question Answering. In: Proceedings of TREC (2002)","DOI":"10.6028\/NIST.SP.500-251.qa-usc-isi"},{"key":"13_CR6","unstructured":"Kilpel\u00e4inen, P.: Tree Matching Problems with Applications to Structured Text Databases. Technical Report A-1992-6, Department of Computer Science, University of Helsinki, Helsinki, Finland (November 1992)"},{"key":"13_CR7","unstructured":"Kouylekov, M., Magnini, B.: Recognizing Textual Entailment with Tree Edit Distance Algorithms. In: Proceedings of the PASCAL Challenges Workshop on Recognising Textual Entailment, Southampton, UK, April 2005, pp. 17\u201320 (2005)"},{"key":"13_CR8","first-page":"707","volume":"10","author":"V.I. Levensthein","year":"1966","unstructured":"Levensthein, V.I.: Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Soviet Physics - Doklady\u00a010, 707\u2013710 (1966)","journal-title":"Soviet Physics - Doklady"},{"key":"13_CR9","unstructured":"Lin, D.: Dependency-based Evaluation of MINIPAR. In: Workshop on the Evaluation of Parsing Systems, Granada, Spain (May 1998)"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Lin, D., Pantel, P.: DIRT - Discovery of Inference Rules from Text. In: Proceedings of ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 323\u2013328 (2001)","DOI":"10.1145\/502512.502559"},{"key":"13_CR11","volume-title":"C4.5: Programs for Machine Learning","author":"J.R. Quinlan","year":"1993","unstructured":"Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufman, San Francisco (1993)"},{"key":"13_CR12","unstructured":"Szpektor, I., Tanev, H., Dagan, I., Coppola, B.: Scaling Web-Based Acquisition of Entailment Relations. In: Proceedings of Empirical Methods in Natural Language Processing, EMNLP 2004 (2004)"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Valiente, G.: An Efficient Bottom-Up Distance Between Trees. In: Proceedings of the International Symposium on String Processing and Information REtrieval, SPIRE, pp. 212\u2013219 (2001)","DOI":"10.1109\/SPIRE.2001.989761"}],"container-title":["Lecture Notes in Computer Science","Machine Learning Challenges. Evaluating Predictive Uncertainty, Visual Object Classification, and Recognising Tectual Entailment"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11736790_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T07:37:30Z","timestamp":1736321850000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11736790_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540334279","9783540334286"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11736790_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}