An Abductive Mechanism for Natural Language Processing Based on Lambek Calculus

Authors:
Antonio Frias Delgado;Jose Antonio Jimenez Millan
Affiliations:
-;-
Venue:
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
Year:
2000

Citing 6
Cited 0

Learnable classes of categorial grammars

Learnable classes of categorial grammars
Inductive Inference: Theory and Methods

ACM Computing Surveys (CSUR)
Handbook of Logic and Language

Handbook of Logic and Language
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Robust Processing of Natural Language

KI '95 Proceedings of the 19th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Parsing as natural deduction

ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an abductive mechanism that works as a robust parser in realistic tasks ofN atural Language Processing involving incomplete information in the lexicon, whether it lacks lexical items or the items are partially and/or wrongly tagged. The abductive mechanism is based on an algorithm for automated deduction in Lambek Calculus for Categorial Grammar. Most relevant features, from the Artificial Intelligence point of view, lie in the ability for handling incomplete information input, and for increasing and reorganizing automatically lexical data from large scale corpora.