Track:
All Papers
Downloads:
Abstract:
The accurate use of combinatory logic and combinators in natural language processing needs a strategy for the removal of combinators, but also for their introduction. The tour of scientific literature teaches us how to reduce combinators and construct from a combinatory expression a normal form without combinators, however no strategy has been proposed to automate the introduction of combinators and construct from one normal form one combinatory expression. We show in our paper that such a strategy is possible. An algorithm is also described.