TY - GEN
T1 - Natural language as the basis for meaning representation and inference
AU - Dagan, Ido
AU - Bar-Haim, Roy
AU - Szpektor, Idan
AU - Greental, Iddo
AU - Shnarch, Eyal
PY - 2008
Y1 - 2008
N2 - Semantic inference is an important component in many natural language understanding applications. Classical approaches to semantic inference rely on logical representations for meaning, which may be viewed as being "external" to the natural language itself. However, practical applications usually adopt shallower lexical or lexical-syntactic representations, which correspond closely to language structure. In many cases, such approaches lack a principled meaning representation and inference framework. We describe a generic semantic inference framework that operates directly on language-based structures, particularly syntactic trees. New trees are inferred by applying entailment rules, which provide a unified representation for varying types of inferences. Rules were generated by manual and automatic methods, covering generic linguistic structures as well as specific lexical-based inferences. Initial empirical evaluation in a Relation Extraction setting supports the validity and potential of our approach. Additionally, such inference is shown to improve the critical step of unsupervised learning of entailment rules, which in turn enhances the scope of the inference system.
AB - Semantic inference is an important component in many natural language understanding applications. Classical approaches to semantic inference rely on logical representations for meaning, which may be viewed as being "external" to the natural language itself. However, practical applications usually adopt shallower lexical or lexical-syntactic representations, which correspond closely to language structure. In many cases, such approaches lack a principled meaning representation and inference framework. We describe a generic semantic inference framework that operates directly on language-based structures, particularly syntactic trees. New trees are inferred by applying entailment rules, which provide a unified representation for varying types of inferences. Rules were generated by manual and automatic methods, covering generic linguistic structures as well as specific lexical-based inferences. Initial empirical evaluation in a Relation Extraction setting supports the validity and potential of our approach. Additionally, such inference is shown to improve the critical step of unsupervised learning of entailment rules, which in turn enhances the scope of the inference system.
UR - http://www.scopus.com/inward/record.url?scp=49949098274&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-78135-6_14
DO - 10.1007/978-3-540-78135-6_14
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:49949098274
SN - 354078134X
SN - 9783540781349
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 151
EP - 170
BT - Computational Linguistics and Intelligent Text Processing - 9th International Conference, CICLing 2008, Proceedings
T2 - 9th International Conference on Computational Linguistics and Intelligent Text Processing, CICLing 2008
Y2 - 17 February 2008 through 23 February 2008
ER -