By Topic

Language understanding and subsequential transducer learning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
A. Castellanos ; Dept. de Sistemas Informaticos y Computacion, Univ. Politecnica de Valencia, Spain ; E. Vidal ; J. Oncina

The application of the Onward Subsequential Transducer Inference Algorithm (OSTIA) recently introduced by J. Oncina et al. (1993) to (pseudo-) natural language understanding is considered. For this purpose, a task proposed by J.A. Feldman et al. (1990), as a touchstone for comparing the capabilities of language learning systems has been adopted and three increasingly difficult semantic coding schemes have been defined for this task. In all cases the OSTIA was consistently proved able to learn very compact and accurate transducers from relatively small training sets of input-output examples of the task

Published in:

Grammatical Inference: Theory, Applications and Alternatives, IEE Colloquium on

Date of Conference:

22-23 Apr 1993