Efficient Graph Kernels for Textual Entailment Recognition

DOI10.3233/FI-2011-400MaRDI QIDQ3100178zbMATH OpenOpenAlexFDO

Authors Fabio Massimo Zanzotto, Lorenzo Dell'Arciprete, Alessandro Moschitti

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

graph kernelsnatural language processinggraph similaritytextual entailment

Mathematics Subject Classification ID

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

Recommendations

• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• scientific article; zbMATH DE number 1756671
• Practical graph isomorphism. II.
• scientific article; zbMATH DE number 1670894
• scientific article; zbMATH DE number 2222791
• Simple Conceptual Graphs and Simple Concept Graphs

Cited in

(3)

• Knowledge-based textual inference via parse-tree transformations
• Graph based multi-view learning for semantic relation extraction
• A method of feature extraction in recognizing textual entailment

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3100178)