A technique for compact representation of language models in Natural Language Processing is presented. After a brief review of the motivations for a more compact representation of such language models, it is shown how finite-state automata can be used to compactly represent such language models. ...
Finite-state technology (FST) is a general term for the use of finite-state automata and transducers in computational linguistics and natural language processing (NLP). FST is very versatile, having been used very successfully for descri... S Wintner 被引量: 16发表: 2004年 Finite-State Regist...
We have noted that while finite state automata (FSA) based techniques have been extensively used in NLP and IE in English, they have not yet been extensively used in processing Chinese text, and in particular, to our knowledge, no work has been reported in using FSA in person name ...
FUNDAMENTAL ALGORITHMS FOR FINITE-STATE AUTOMATA AND TRANSDUCERS IN NLP . . . . . . . . . . . . . . . . . . . . . . . . . . . 42 3.1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42 3.2. From regular expressions to...
Finite-state technology (FST) is a general term for the use of finite-state automata and transducers in computational linguistics and natural language processing (NLP). FST is very versatile, having been used very successfully for descri... S Wintner 被引量: 16发表: 2004年 Computational approac...
automata or deploying NLP systems on small hand-held devices. When automata are built up through complex regular expressions, the savings from minimization can be considerable, especially when ap- plied at intermediate stages of the construction, since (for example) smaller automata can be intersect...
and outputs another string as the output. • Finite-state automata equate to regular languages, and FSTs equate to regular relations. – Ex: R = { (a n , b n ) | n >= 0} is a regular relation. It maps a string of a’s into an equal length string of b’s An FST q 0 q...
Pereira, F., Riley, M.: Speech recognition by composition of weighted finite automata. In: Roche, E., Schabes, Y. (eds.) Finite-state Language Processing, pp. 431–453. The MIT Press, Cambridge (1997) Rose, D.J., Tarjan, R.E.: Algorithmic aspects of vertex elimination. In: Proce...
A technique for compact representation of language models in Natural Language Processing is presented. After a brief review of the motivations for a more compact representation of such language models , it is shown how finite-state automata can be used to compactly represent such language models. ...
This paper addresses the implementation of virtual network operations in xfst (XEROX Finite State Technology software). The example of "priority union" which is particularly useful in NLP, is developed.Franck GuingneFlorent NicartImplementation and application of automata: 7th international conference, ...