The syntactic prediction with token automata: application to HandiAS system

Authors:
Denis Maurel;Brigitte Le Pévédic
Affiliations:
Univ. of Tours, Tours, France;Valoria, Vannes, France
Venue:
Theoretical Computer Science
Year:
2001

Citing 3
Cited 1

Psuedo-minimal transducer

Theoretical Computer Science - Special issue on implementing automata
Building Automata on Schemata and Acceptability Tables: Application to French Data Adverbials

WIA '96 Revised Papers from the First International Workshop on Implementing Automata
Finite-state transducers in language and speech processing

Computational Linguistics

Sibylle: un système d'aide à la saisie de texte

IHM 2004 Proceedings of the 16th conference on Association Francophone d'Interaction Homme-Machine

Quantified Score

Hi-index	5.23

Visualization

Abstract

This paper presents a finite-state machine to compute the probability of a word appearance when one knows the left syntactic context. We memorize the token number of words in a dictionary and the token number of syntactic categories on finite-state automata. We compute a word probability with these numbers. If we have not predicted the awaited word , we take into account the first letter for a new prediction, and so on. This system has been implemented on a prototype software for disabled communication aid, called HandiAS and it is a part of the Research project CNHL of the LI, the Computer Laboratory of the Tours University. Copyright 2001 Elsevier Science B.V.