Finite-state technology as a programming environment

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4394 LNCS, Issue , 2007, Pages 97-106

  Wintner, Shuly ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); JAVA PROGRAMMING LANGUAGE; NATURAL LANGUAGE PROCESSING SYSTEMS; PATTERN RECOGNITION; PROBLEM SOLVING; REAL TIME SYSTEMS;

FINITE STATE TECHNOLOGY; LINEAR RECOGNITION; PROGRAMMING ENVIRONMENT;

COMPUTER PROGRAMMING;

EID: 37149004898     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70939-8_9     Document Type: Conference Paper

References (21)

1. Johnson, C.D.: Formal Aspects of Phonological Description. Mouton, The Hague (1972)
2. Koskenniemi, K.: Two-Level Morphology: a General Computational Model for Word-Form Recognition and Production. The Department of General Linguistics, University of Helsinki (1983)
3. Kaplan, R.M., Kay, M.: Regular models of phonological rule systems. Computational Linguistics 20 (1994) 331-378
4. Roche, E., Schabes, Y., eds.: Finite-State Language Processing. Language, Speech and Communication. MIT Press, Cambridge, MA (1997)
5. Beesley, K.R., Karttunen, L.: Finite-State Morphology: Xerox Tools and Techniques. CSLI, Stanford (2003)
6. Beesley, K.R.: Arabic morphology using only finite-state operations. In Rosner, M., ed.: Proceedings of the Workshop on Computational Approaches to Semitic languages, Montreal, Quebec, COLING-ACL'98 (1998) 50-57
7. Cohen-Sygal, Y., Wintner, S.: Finite-state registered automata for nonconcatenative morphology. Computational Linguistics 32 (2006) 49-82
8. Silberztein, M.: Dictionnaires électroniques et analyse automatique de textes : le système INTEX. Masson, Paris (1993)
9. Mohri, M., Pereira, F., Riley, M.: The design principles of a weighted finite-state transducer library. Theoretical Computer Science 231 (2000) 17-32
10. van Noord, G., Gerdemann, D.: An extendible regular expression compiler for finite-state approaches in natural language processing. In Boldt, O., Jürgensen, H., eds.: Automata Implementation. Number 2214 in Lecture Notes in Computer Science. Springer (2001)
11. Karttunen, L.: The replace operator. In: Proceedings of the Annual Meeting of the Association for Computational Linguistics. (1995) 16-23
12. Yona, S., Wintner, S.: A finite-state morphological grammar of Hebrew. Natural Language Engineering (Forthcoming)
13. Itai, A., Wintner, S., Yona, S.: A computational lexicon of contemporary Hebrew. In: Proceedings of The fifth international conference on Language Resources and Evaluation (LREC-2006), Genoa, Italy (2006)
14. Cohen-Sygal, Y., Wintner, S.: XFST2FSA: Comparing two finite-state toolboxes. In: Proceedings of the ACL-2005 Workshop on Software, Ann Arbor, MI (2005)
15. Mohri, M.: Minimization algorithms for sequential transducers. Theoretical Computer Science 234 (2000) 177-201
16. Holzer, M., Kutrib, M.: State complexity of basic operations on nondeterministic finite automata. In: Implementation and Application of Automata (CIAA '02). (2002) 151-160
17. Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics 23 (1997) 269-312
18. Zajac, R.: Feature structures, unification and finite-state transducers. In: FSMNLP'98: The International Workshop on Finite-state Methods in Natural Language Processing, Ankara, Turkey (1998)
19. Amtrup, J.W.: Morphology in machine translation systems: Efficient integration of finite state transducers and feature structure descriptions. Machine Translation 18 (2003) 217-238
20. Daciuk, J., Mihov, S., Watson, B.W., Watson, R.E.: Incremental construction of minimal acyclic finite-state automata. Computational Linguistics 26 (2000) 3-16
21. Carrasco, R.C., Forcada, M.L.: Incremental construction and maintenance of minimal finite-state automata. Computational Linguistics 28 (2002) 207-216