Computing Word Meanings by Interpolation
Abstract
I outline a natural algorithm for solving a central problem in the task of learning word-to meaning mappings, as formulated by Siskind (1996, 2000) and extended to the typed lambda calculus setting by Kanazawa (2001). The algorithm is based on a new syntactical method for proving the Interpolation Theorem for the implicational fragment of intuitionistic propositional logic.
Downloads
Download data is not yet available.
Published
2003-12-01
Issue
Section
Conference Proceedings
How to Cite
Kanazawa, M. (2003). Computing Word Meanings by Interpolation . Proceedings of the Amsterdam Colloquium, 157-162. https://platform.openjournals.nl/PAC/article/view/23287
