next up previous contents index
Next: Index Up: POLITECHNIKA GDANSKA Technical Previous: BUGS


A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company, 1974.

Eric Steven Atwell. How to detect grammatical errors in a text without parsing it. In ACL Proceedings, Third European Conference, pages 34-45, 1987.

Steven Bird and T. Mark Ellison. One-level phonology: Autosegmental representations and rules as finite automata. Computational Linguistics, 20(1):55-90, March 1994.

Jon Bentley. A spelling checker. Communications of the ACM, 28(5), May 1985.

Eric Brill. A Corpus-Based Approach to Language Learning. PhD thesis, Department of Computer and Information Science, University of Pennsylvania, USA, 1993.

Eric Brill. Transformation-based error-driven learning and natural language processing: A case study in part-of-speech tagging. Computational Linguistics, 21(4):543-565, December 1995.

Harald Baayen and Richard Sproat. Estimating lexical priors for low-frequency morphologically ambiguous forms. Computational Linguistics, 22(2):155-166, June 1996.

Jacques Courtin, Danièle Dujardin, Damian Genthial, and Irène Kowarski. Outils lexicaux de l'équipe trilan: bilans et perspectives. In Séminaire Lexique, PRC Communication Homme-Machine, Pôle Langage Naturelle, Toulouse, France, January 1992.

Jacques Courtin, Danièle Dujardin, Irène Kowarski, Damien Gential, and Vera Lucia Strube de Lima. Towards a complete detection/correction system. In International Conference on Current Issues in Computational Linguistics, Penang, Malaysia, June 1991.

Jacques Courtin, Damien Genthial, and Jacques Menézo. Intégration de stratégies de correction dans un systemème de détection/correction d'erreurs. In Colloque Informatique et Langue Naturelle (ILN'93), Nantes, France, 1993.

Jaime G. Carbonell and Philip J. Hayes. Recovery strategies for parsing extragrammatical language. American Journal of Computational Linguistics, 9(3-4):123-146, July-December 1983.

Doug Cutting, Julian Kupiec, Jan Pedersen, and Penelope Sibun. A practical part-of-speech tagger. In Proceedings of the Third Conference on Applied Natural Language Processing, Trento, Italy, 1992. ACL. Also available as Xerox PARC technical report SSL-92-01.

Jean-Pierre Chanod and Pasi Tapanainen. Creating a tagset, lexicon and guesser for a french tagger. In ACL SIGDAT workshop on "From Texts To Tags: Issues in Multilingual Language Analysis", pages 58-64, University College Dublin, Ireland, 1995. ACL.

Jan Daciuk. Dopisywanie polskich znaków diakrytycznych za pomoca automatów. In Krajowe Sympozjum Telekomunikacji '97, volume D, pages 77-82, Bydgoszcz, September 1997. Akademia Techniczno-Rolnicza w Bydgoszczy, Instytut Telekomunikacji Politechniki Warszawskiej.

F. J. Damerau. A technique for computer detection and correction of spelling errors. Communications of the ACM, 7(3):171-176, March 1964.

M. W. Du and S. C. Chang. A model and a fast algorithm for multiple errors spelling correction. Acta Informatics, 29(3):281-302, 1992.

I. Durham, D. A. Lamb, and J. B. Saxe. Spelling correction in user interfaces. Communications of the ACM, 26(10):764-773, October 1983.

Jan Daciuk, Richard E. Watson, and Bruce W. Watson. Incremental construction of acyclic finite-state automata and transducers. In Finite State Methods in Natural Language Processing, Bilkent University, Ankara, Turkey, June - July 1998.

Damien Genthial and Jacques Courtin. From detection/correction to computer aided writing. In COLING'92, Nantes, France, July 1992.

Damien Genthial. Souplesse et robustesse de l'analyse syntaxique: apports d'une hiérarchie de catégories. In Colloque Informatique et Langue Naturelle (ILN'91), Nantes, France, 1991.

Dan Gildea and Dan Jurafsky. Automatic induction of finite state transducers for simple phonological rules. Technical Report TR-94-052, International Computer Science Institute, Berkeley, California, October 1994.

Dennis Grinberg, John Lafferty, and Daniel Sleator. A robust parsing algorithm for link grammars. Technical Report CMU-CS-95-125, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA, August 1995.

G. E. Heidorn, K. Jensen, L. A. Miller, R. J. Byrd, and M. S. Chodorow. The epistle text-critiquing system. IBM System Journal, 21(3):305-326, 1982.

John E. Hopcroft and Jefferey D. Ullman. Introduction to Automata Theory, Languages, and Computation. Adison-Wesley Publishing Company, Reading, Massachusets, USA, 1979.

K. Jensen, G. E. Heidorn, L. A. Miller, and Y. Ravin. Parse fitting and prose fixing: Getting a hold on ill-formedness. American Journal of Computational Linguistics, 9(3-4):147-160, July-December 1983.

Lauri Karttunen. Constructing lexical transducers. In COLING-94, Kyoto, Japan, 1994.

Ronald M. Kaplan and Martin Kay. Regular models of phonological rule systems. Computational Linguistics, 20(3):331-378, September 1994.

Tomasz Kowaltowski, Cláudio L. Lucchesi, and Jorge Stolfi. Application of finite automata in debugging natural language vocabularies. In First South American String Processing Workshop, Belo Horizonte, Brasil, 1993.

Tomasz Kowaltowski, Cláudio L. Lucchesi, and Jorge Stolfi. Minimization of binary automata. In First South American String Processing Workshop, Belo Horizonte, Brasil, 1993.

Kimmo Koskenniemi. Two-level model for morphological analysis. In IJCAI-83, pages 683-685, Karlsruhe, Germany, 1983.

Kimmo Koskenniemi. A general computational model for word-form recognition and production. In COLING-84, pages 178-181, Stanford University, California, USA, 1984. Association for Computational Linguistics.

Stan C. Kwasny and Norman K. Sondheimer. Relaxation techniques for parsing grammatically ill-formed input in natural language understanding systems. American Journal of Computational Linguistics, 7(2):99-108, April-June 1981.

Andrei Mikheev. Learning part-of-speech guessing rules from lexicon: Extension to non-concatenative operations. In Coling-96, The 16th Internatinal Conference on Computational Linguistics, volume 2, pages 770-775, Copenhagen, Denmark, August 5-9 1996.

Andrei Mikheev. Automatic rule induction for unknown-word guessing. Computational Linguistics, 23(3):405-423, September 1997.

Mehryar Mohri. Compact representations by finite-state transducers. In ACL'94, San Francisco, California, 1994. Association for Computational Linguistics, Morgan Kaufmann.

Mehryar Mohri. Syntactic analysis by local grammars automata: an efficient algorithm. In International Conference on Computational Lexicography (COMPLEX '94), Budapest, Hungary, 1994.

Mehryar Mohri. Finite-state transducers in language and speech processing. Computational Linguistics, 23(2):269-311, June 1997.

Kemal Oflazer. Error-tolerant finite state recognition with applications to morphological analysis and spelling correction. Computational Linguistics, 22(1):73-89, March 1996.

Kemal Oflazer and Cemalettin Güzey. Spelling correction in agglutinative languages. In 4th Conference on Applied Natural Language Processing, pages 194-195, Stuttgart, Germany, October 1994.

J. L. Peterson. Computer programs for detecting and correcting spelling errors. Communications of the ACM, 23(12):676-687, December 1980.

Joseph Pentheroudakis and Lucy Vanderwende. Automatically identifying morphological relations in machine-readable dictionaries. In Ninth Annual Conference of the UW Centre for the New OED and Text Research, pages 114-131, 1993.

Joseph J. Pollock and Antonio Zamora. Automatic spelling correction in scientific and scholary text. Communications of the ACM, 27(4):358-368, April 1984.

Dominique Revuz. Dictionnaires et lexiques: méthodes et algorithmes. PhD thesis, Institut Blaise Pascal, Paris, France, 1991. LITP 91.44.

Emmanuel Roche. Finite-state tools for language processing. In ACL'95. Association for Computational Linguistics, 1995. Tutorial.

Graeme D. Ritchie, Graham J. Russell, Alan W. Black, and Stephen G. Pulman. Computational Morphology. Bradford Books. MIT Press, Cambridge, Massachusetts, USA, 1992.

Emmanuel Roche and Yves Schabes. Deterministic part-of-speech tagging with finite-state transducers. Computational Linguistics, 21(2):227-253, June 1995.

Emmanuel Roche and Yves Schabes. Finite-State Language Processing. Bradford Book. MIT Press, Cambridge, Massachusetts, USA, 1997.

Bruno Maximilian Schulze, Ulrich Heid, Helmut Schmid, Anne Schiller, Mats Rooth, Gregory Grefenstette, Jean Gaschler, Annie Zaenen, and Simone Teufel. Decide. MLAP-Project 93-19 D-1b I, STR and RXRC, November 1994.

Richard Sproat. Morphology and Computation. Bradford Books. MIT Press, Cambridge, Massachusetts, USA, 1992.

Pieter Theron and Ian Cloete. Automatic acquisition of two-level morphological rules. In Fifth Conference on Applied Natural Language Processing, pages 103-110, Washington, DC, USA, April 1997. Association for Computational Linguistics, Association for Computational Linguistics.

Robert Endre Tarjan and Andrew Chi-Chih Yao. Storing a sparse table. Communications of the ACM, 22(11):606-611, November 1979.

Jean Veronis. Morphosyntactic correction in natural language interfaces. In international Conference on Computational Linguistics, pages 708-713. International Comittee on Computational Linguistics, 1988.

Zygmunt Vetulani, Bogdan Walczak, Tomasz Obrebski, and Grazyna Vetulani. Unambiguous coding of the inflection of Polish nouns and its application in electronic dictionaries - format POLEX. Wydawnictwo Naukowe UAM, 1998.

Bruce W. Watson. A taxonomy of finite automata construction algorithms. Computing Science Note 93/43, Eindhoven University of Technology, The Netherlands, 1993.

Bruce W. Watson. A taxonomy of finite automata minimization algorithmes. Computing Science Note 93/44, Eindhoven University of Technology, The Netherlands, 1993.

Bruce W. Watson. Taxonomies and Toolkits of Regular Language Algorithms. PhD thesis, Eindhoven University of Technology, the Netherlands, 1995.

Ralph Weischedel, Marie Meteer, Richard Schwartz, Lance Ramshaw, and Jeff Palmucci. Coping with ambiguity and unknown words through probabilistic models. Computational Linguistics, 19(2):359-382, 1993.

David Yarowsky. A comparison of corpus-based techniques for restoring accents in Spanish and French texts. In 2nd Annual Workshop on Very Large Text Corpora, Kyoto, Japan, 1994.

David Yarowsky. Decision lists for lexical ambiguity resolution: Application to accent restoration in Spanish and French. In Proceeding of the ACL'94, San Francisco, California, 1994. Association for Computational Linguistics, Morgan Kaufmann.

Jan Daciuk
Wed Jun 3 14:37:17 CEST 1998

Software at