Efficient Graph Kernels for Textual Entailment Recognition

DOI10.3233/FI-2011-400zbMath1238.68175OpenAlexW172419288MaRDI QIDQ3100178

Fabio Massimo Zanzotto, Alessandro Moschitti, Lorenzo Dell'Arciprete

Publication date: 22 November 2011

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2011-400

zbMATH Keywords

natural language processinggraph kernelsgraph similaritytextual entailment

Mathematics Subject Classification ID

Applications of graph theory (05C90) Logic of natural languages (03B65) Natural language processing (68T50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph theory (educational aspects) (97K30)

This page was built for publication: Efficient Graph Kernels for Textual Entailment Recognition