Daciuk, J., van Noord, G.: Finite automata for compact representation of language models in NLP. In: Implementation and Application of Automata, 6th International Conference, CIAA 2001. Lecture Notes in Computer Science, vol. 2494, pp. 65–73. Springer, New York (2002)...
The approach consists in constructing a tr... S Mesfar,M Silberztein - Conference on Finite-state Methods & Natural Language Processing: Post-international Workshop Fsmnlp 被引量: 5发表: 2009年 [Lecture Notes in Computer Science] Implementation and Application of Automata Volume 2494 || ...
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...
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...
• 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 1 b:y a:x R(T) = { ...
7. Turkish lexicon expansion by using finite state automata [O] . MUSTAFA BURAK ÖZTÜRK, BURCU CAN BUĞLALILAR 2019 机译:土耳其词典扩展通过使用有限状态自动机 8. Finite Tree Automata and omega-Automata [R] . Hossley, R. F. 1972 机译:有限树自动机和欧米茄自动机 获取...
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...
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...
Jan Daciuk, Gertjan van Noord: Finite Automata for Compact Representation of Language Models in NLP, Noord, G.: Finite automata for compact representation of language models - Daciuk, van () Citation Context ...ailable on Pedersen’s website at http://www.d. umn.edu/~tpederse/nsp....
According to [1], spell checking is a process of comparing an input word with a complete master list of acceptable words and rejects those words from the input that have no match in the master list.In this proposed work, we use finite state automata techniques to detect wrongly spelled ...