| Journal: | Computación y Sistemas |
| Database: | PERIÓDICA |
| System number: | 000423262 |
| ISSN: | 1405-5546 |
| Authors: | Lavalle, Jesús1 Montes, Manuel1 Jiménez, Héctor3 Villaseñor, Luis1 Beltrán, Beatriz2 |
| Institutions: | 1Instituto Nacional de Astrofísica, Optica y Electrónica, Coordinación de Ciencias Computacionales, Tonantzintla, Puebla. México 2Benemérita Universidad Autónoma de Puebla, Facultad de Ciencias de la Computación, Puebla. México 3Universidad Autónoma Metropolitana, División de Ciencias de la Comunicación y Diseño, Cuajimalpa, Ciudad de México. México |
| Year: | 2018 |
| Season: | Ene-Mar |
| Volumen: | 22 |
| Number: | 1 |
| Country: | México |
| Language: | Inglés |
| Document type: | Artículo |
| Approach: | Aplicado, descriptivo |
| English abstract | Recognizing Textual Entailment (RTE) is a Natural Language Processing task. It is very important in tasks as Semantic Search and Text Summarization. There are many approaches to RTE, for example, methods based on machine learning, linear programming, probabilistic calculus, optimization, and logic. Unfortunately, no one of them can explain why the entailment is carried on. We can make reasonings, with Natural Logic, from the syntactic part of a natural language expression, and very little semantic information. This paper presents an Automatic Theorem Prover for Natural Logic that allows to know precisely the relationships needed in order to reach the entailment in a class of natural language expressions |
| Disciplines: | Ciencias de la computación, Literatura y lingüística |
| Keyword: | Lingüística aplicada, Procesamiento de lenguaje natural, Vinculación textual, Búsqueda semántica, Lógica natural |
| Keyword: | Applied linguistics, Natural language processing, Textual entailment, Semantic search, Natural logic |
| Full text: | Texto completo (Ver HTML) Texto completo (Ver PDF) |
