A functional toolkit for morphological and phonological processing, application to a Sanskrit tagger

Journal of Functional Programming

Volumn 15, Issue 4, 2005, Pages 573-614

  Huet, Gérard ^a  

^a INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

LITERATE PROGRAMMING; MORPHOLOGICAL OPERATIONS; NATURAL LANGUAGE TEXT; NATURAL LANGUAGES; PHONOLOGICAL PROCESSING; SPACE DATA STRUCTURES; SYSTEMATIC REPRESENTATION; ZIPPER TECHNOLOGY;

FUNCTIONAL PROGRAMMING; MATHEMATICAL MORPHOLOGY; TRANSDUCERS;

SPEECH;

EID: 23444433594     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796804005416     Document Type: Review

References (41)

1. Beesley, K. R. and Karttunen, L. (2003) Finite-state morphology. CSLI Publications, The University of Chicago Press.
2. Bentley, J. L. and Sedgewick, R. (1997) Fast algorithms for sorting and searching strings. Proceedings 8th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM.
3. Bergaigne, A. (1884) Manuel pour étudier la langue sanscrite. F. Vieweg, Paris.
4. Brill, E. (1992) A simple rule-based part of speech tagger. Proceedings Third Conference on Applied Natural Language Processing, pp. 152-155.
5. Burstall, R. (1969) Proving properties of programs by structural induction. Comput. J. 12(1), 41-48.
6. Burstall, R. (1984) Programming with modules as typed functional programming. Proc. Int. Conf. on Fifth Gen. Computing systems.
7. Coulson, M. (1992) Sanskrit - an introduction to the classical language, 2nd ed. Hodder & Stoughton.
8. Cousineau, G. and Mauny, M. (1998) The Functional Approach to Programming. Cambridge University Press.
9. Daciuk, J., Mihov, S., Watson, B. W. and Watson, R. E. (2000) Incremental construction of minimal acyclic finite-state automata. Computational Linguistics, 26(1).
10. de Rauglaudre, D. (2001) The Camlp4 preprocessor, http://caml.inria.fr/ camlp4/
11. Dershowitz, N. and Manna, Z. (1979) Proving termination with multiset ordering. Comm. ACM, 22, 465-476.
12. Filliozat, P.-S. (1988) Grammaire sanskrite pâninéenne. Picard, Paris.
13. Flajolet, P., Sipala, P. and Steyaert, J.-M. (1990) Analytic variations on the common subexpresssion problem. Proceedings of 17th ICALP colloquium, pp. 220-234. Warwick.
14. Gordon, M., Milner, R. and Wadsworth, C. (1977) A metalanguage for interactive proof in LCF. Technical report, Internal Report CSR-16-77, Department of Computer Science, University of Edinburgh.
15. Huet, G. (1997) The Zipper. J. Funct. Program. 7(5), 549-554.
16. Huet, G. (2002) The Zen computational linguistics toolkit. Technical report, ESSLLI Course Notes. http://pauillac.inria.fr/~huet/ZEN/zen.pdf
17. Huet, G. (2003a) Automata mista. In: Dershowitz, N. (ed.), Festschrift in honor of Zohar Manna for his 64th anniversary: Lecture Notes in Computer Science 2772. Springer-Verlag, http://pauillac.inria.fr/~huet/PUBLIC/zohar.pdf
18. Huet, G. (2003b) Lexicon-directed segmentation and tagging of Sanskrit. XIIth World Sanskrit Conference, Helsinki, Finland.
19. Huet, G. (2003c) Linear contexts and the sharing functor: Techniques for symbolic computation. In: Kamareddine, F. (ed., Thirty-five Years of Automating Mathematics. Kluwer.
20. Huet, G. (2003d) Towards computational processing of Sanskrit. International Conference on Natural Language Processing (ICON), Mysore, Karnataka.
21. Huet, G. (2003e) Zen and the art of symbolic computing: Light and fast applicative algorithms for computational linguistics. Practical Aspects of Declarative Languages (PADL) Symposium. http://pauillac.inria.fr/~huet/PUBLIC/ padl.pdf
22. Kaplan, R. M. and Kay, M. (1994) Regular models of phonological rule systems. Computational Linguistics, 20(3), 331-378.
23. Karttunen, L. (1995) The replace operator. ACL'95.
24. Karttunen, L. (2000) Applications of finite-state transducers in natural language processing. Proceedings CIAA-2000.
25. Karttunen, L. and Beesley, K. R. (2001) A short history of two-level morphology. ESSLLI'2001 Workshop on Twenty Years of Finite-state Morphology, http://www2.parc.com/istl/members/karttune/
26. Kessler, B. (1992) External sandhi in classical Sanskrit. M Phil thesis, Stanford University.
27. Kessler, B. (1995) Sandhi and syllables in classical Sanskrit. In: Duncan, E., Farkas, D. and Spaelty, P. (eds.), Twelfth West Coast Conference on Formal Linguistics. CSLI.
28. Koskenniemi, K. (1984) A general computational model for word-form recognition and production. 10th International Conference on Computational Linguistics.
29. Landin, P. (1966) The next 700 programming languages. Comm. ACM, 9(3), 157-166.
30. Laporte, E. (1995) Rational transductions for phonetic conversion and phonology. Technical report, IGM 96-14, Institut Gaspard Monge, Université de Marne-la-vallée.
31. Leroy, X., Rémy, D., Vouillon, J. and Doligez, D. (2000) The Objective Caml system, documentation and user's manual - release 3.00. INRIA. http://caml.inria.fr/ocaml/
32. Mohri, M. (1997) Finite-state transducers in language and speech processing. Computational Linguistics, 23(2), 269-311.
33. Paulson, L. C. (1991) ML for the Working Programmer. Cambridge University Press.
34. Ranta, A. (2003) Grammatical framework: a type-theoretical grammar formalism. J. Funct. Program. 13.
35. Roche, E. and Schabes, Y. (1995) Deterministic part-of-speech tagging with finite-state transducers. Computational Linguistics, 21(2), 227-253.
36. Roche, E. and Schabes, Y. (1997) Finite-state Language Processing. MIT Press.
37. Sproat, R. (1992) Morphology and Computation. MIT Press.
38. Sproat, R., Shih, C., Gale, W. and Chang, N. (1996) A stochastic finite-state word-segmentation algorithm for Chinese. Computational Linguistics, 22(3), 377-408.
39. Weis, P. and Leroy, X. (1999) Le langage Caml, 2nd ed. Dunod.
40. Whitney, W. D. (1924) Sanskrit grammar, 5th ed. Leipzig.
41. Whitney, W. D. (1997) Roots, verb-forms and primary derivatives of the sanskrit language. Motilal Banarsidass, Delhi. (1st edition 1885).