Abstract
There has been much interest recently in two-level and associative models for handling morphologically rich inflectional languages. Such models are claimed to have advantages over generative, rule-based approaches in terms of not just conceptual appropriateness but also computational efficiency. The claim with regard to the former is that, whilst generative approaches to morphology may well be useful for inflectionally simple natural languages such as English (where most of the processing is carried out at the sentence level, with dictionaries and lexicons being accessed to identify secondary inflectional information once primitive words are found), this approach is not at all suitable for inflectionally rich languages where grammatical information is carried not by the combination or pattern of distinct and separate words which make up the sentence but by the combination or pattern of inflections within a ‘word’ where, for instance, there are no clear boundaries between morphological constituents. The claim with regard to the latter is that many generative approaches to natural language are inefficient and, in some cases, computationally intractable, because of the heavy memory and processing demand placed on implementing actual models based on these approaches for anything more than a constrained fragment of a language. This paper describes an application of finite-state automata for Arabic noun inflections which leads to abstractions based on network topology as well as the form and content of network arcs. The idea of specific automata for specific inflection types inheriting some or all of the nodes, arc form and arc content of abstract automata representing more abstract classes of inflection is also introduced. This can lead to novel linguistic generalities and applications, as well as advantages in terms of procedural efficiency and representation.
Similar content being viewed by others
References
Alam, Y. (1983). A Two-Level Morphological Analysis of Japanese.Texas Linguistic Forum 22: 229–243.
Barton, G., Berwick, R. & Ristad, E. (1987).Computational Complexity and Natural Language. MIT Press: Cambridge, MA.
Beesley, K. (1990). Finite-State Descriptions of Arabic Morphology. InProceedings of the Second Conference on Bilingual Computing in Arabic and English. Cambridge, UK: Literary and Linguistic Computing Centre, Cambridge University.
Beesley, K., Buckwalter, T. & Newton, S. (1989). Two-Level Finite State Analysis of Arabic. InProceedings of the First Conference on Bilingual Computing in Arabic and English. Cambridge, UK: Literary and Linguistic Computing Centre, Cambridge University.
Beesley, K. & Newton, S. (1989). Computer Analysis Aymara Morphology: A Two-Level, Finite State Approach. In Cox, S. (ed.)Proceedings of the 15th Annual Deseret Language and Linguistics Symposium, 126–144. Deseret Language and Literary Society, Brigham Young University.
Bird, S. & Blackburn, P. (1990). A Logical Approach to Arabic Phonology. InProceedings of the Fifth Conference of the European Chapter of the Association for Computational Linguistics, 89–94.
Blåberg, O. (1985). A Two-Level Description of Swedish. In Karlsson, F. (ed.)Computational Morphosyntax: Report on Research 1981–1984, 43–62. University of Helsinki Press: Helsinki, Finland.
Cowan, D. (1958).Modern Literary Arabic. Cambridge University Press: Cambridge, UK.
DeSmedt, W. M. (1984). Using Object-Oriented Knowledge Representation Techniques in Morphology and Syntax Programming. InProceedings of the 1984 European Conference on Artificial Intelligence, 181–184.
El-Naggar, A. (1989). A Finite State Automaton of the Arabic Grammar. InProceedings of the IEEE International Workshop on Tools for AI, 693–699.
Evans, R. & Gazdar, G. (eds.) (1990).The DATR Papers, Volume 1. School of Cognitive and Computing Sciences, University of Sussex.
Flickinger, D. P., Pollard, C. J. & Wasow, T. (1985). Structure-Sharing in Lexical Representation. InProceedings of the 23rd Annual Meeting of the Association for Computational Linguistics, 262–267.
Gazdar, G., Klein, E., Pullum, G. K. & Sag, A. (1985).Generalized Phrase Structure Grammar. Blackwell: Oxford.
Gazdar, G. & Mellish, C. (1989).Natural Language Processing in Prolog. Addison-Wesley Publishing Company: Wokingham, UK.
Görz, G. & Paulus, D. (1988). A Finite State Approach to German Verb Morphology. InProceedings of the International Conference on Computational Linguistics (COLING88), 212–215.
Hankamer, J. (1986). Finite State Morphology and Left to Right Phonology. In Dalrymple, M., Goldberg, J., Hanson, K., Inman, M., Pinon, C. & Wechsler, S. (eds.)Proceedings of the Fifth West Coast Conference on Formal Linguistics, 29–34. Stanford Linguistics Association.
Hashem, L. (1991).Morphological Analysis of the Arabic Language Using the Two-Level Model. MSc thesis, Department of Computer Science, University of Exeter, Exeter, UK.
Hopkin, D. & Moss, B. (1976).Automata. Macmillan.
Hunter, R. (1985).Compilers: Their Design and Construction Using Pascal. Wiley: Chichester, UK.
Jäppinen, H., Lehtola, A., Nelimarkka, E. & Ylilammi, M. (1983a). Knowledge Engineering Approach to Morphological Analysis. InProceedings of the 1st Conference of the European Chapter of the Association of Computational Linguistics, 49–51. Pisa, Italy.
Jäppinen, H., Lehtola, A., Nelimarkka, E. & Ylilammi, M. (1983b).Morphological Analysis of Finnish: A Heuristic Approach. Technical Report B26, Helsinki University of Technology, Digital Systems Laboratory, Helsinki, Finland.
Jäppinen, H. & Ylilammi, M. (1986). Associative Models of Morphological Analysis: An Empirical Enquiry.Computational Linguistics 12: 257–272.
Johnson, C. D. (1972).Formal Aspects of Phonological Description. Mouton: The Hague, The Netherlands.
Kaplan, R. & Bresnan, J. (1983). Lexical Functional Grammar: A Formal System for Grammatical Representation. In Bresnan, J. (ed.)The Mental Representation of Grammatical Relations, 173–281. MIT Press: Boston.
Karttunen, L. (1983). KIMMO: A Two-Level Morphological Analyzer.Texas Linguistic Forum 22: 163–186.
Karttunen, L. & Wittenburg, K. (1983). A Two-Level Morphological Analysis of English.Texas Linguistic Forum 22: 217–228.
Kataja, L. & Koskenniemi, K. (1988). Finite-State Description of Semitic Morphology: A Case Study in Ancient Akkadian. InProceedings of the International Conference on Computational Linguistics (COLING88), 313–315.
Kay, M. (1983). When Meta-Rules Are Not Meta-Rules. In Jones, K. S. & Wilks, Y. A. (eds.)Automatic Natural Language Parsing. Ellis Horwood: Chichester, UK.
Kay, M. (1985). Parsing in Functional Unification Grammar. In Dowty, D., Karttunen, L. & Zwicky, A. M. (eds.)Natural Language Processing: Psychological, Computational and Theoretical Perspectives. Cambridge University Press: Cambridge, UK.
Kay, M. (1987). Nonconcatenative Finite State Morphology. InProceedings of the 3rd Conference of the European Chapter of the Association for Computational Linguistics, 2–10.
Khan, R. (1983). A Two-Level Morphological Analysis of Rumanian.Texas Linguistic Forum 22: 253–270.
Kornai, A. (1991).Formal Phonology. PhD thesis, Department, Stanford University,
Koskenniemi, K. (1983). Two-Level Model for Morphological Analysis. InProceedings of IJCAI, 683–685.
Koskenniemi, K. (1984). A General Computational Model for Word-Form Recognition and Production. InProceedings of the International Conference on Computational Linguistics (COLING84), 178–181.
Koskenniemi, K. & Church, K. W. (1988). Complexity, Two-Level Morphology and Finnish. InProceedings of the International Conference on Computational Linguistics (COLING88).
Lindstedt, J. (1984). A Two-Level Description of Old Church Slavonic Morphology.Scando-Slavica 30: 165–189.
Lun, S. (1983). A Two-Level Morphological Analysis of French.Texas Linguistic Forum 22: 271–278.
McCarthy, J. J. (1981). A Prosodic Theory of Nonconcatenative Morphology.Linguistic Inquiry 12: 373–418.
Meya, M. (1987). Morphological Analysis of Spanish for Retrieval.Literary and Linguistic Computing 2: 166–170.
Narayanan, A. & Hashem, L. (1993). On Abstract, Finite-State Morphology. InProceedings of the 6th Conference of the European Chapter of the Association for Computational Linguistics, 297–304.
Narayanan, A. & Mehdi, S. (1991). A Computer Model for Transliterated Arabic.Applied Computer Translation 1(3): 5–28.
Nasr, R. (1967).The Structure of Arabic. Libraire du Liban: Beirut
Oflazer, K. (1983). Two-Level Description of Turkish Morphology. Unpublished research report. Department of Computer Engineering and Information Science, Bilkent University, Bilkent, Ankara 06533, Turkey.
Pereira, F. C. N. & Warren, H. D. (1980). Definite Clause Grammar for Language Analysis — A Survey of the Formalism and Comparison with Augmented Transition Networks.Artificial Intelligence 13: 231–278.
Porter, H. H. (1987). Incorporating Inheritance and Feature Structures into Logic Grammar Formalism. InProceedings of the 25th Annual Meeting of the Association for Computational Linguistics, 228–234.
Reinhard, S. & Gibbon, D. (1991). Prosodic Inheritance and Morphological Generalisations. InProceedings of the Fifth Conference of the European Chapter of the Association for Computational Linguistics, 131–136.
Rychlik, P. (1989). Multiple Inheritance Systems with Exceptions.Artificial Intelligence Review 3(2, 3): 159–176.
Shieber, S. M. (1986).An Introduction to Unification-Based Approaches to Grammar. CSLI: Stanford.
Smart, J. (1986).Teach Yourself Arabic. Hodder and Stoughton: Sevenoaks, UK.
Sproat, R. W. (1992).Morphology and Computation. MIT Press: Cambridge, USA.
Wiebe, B. (1992).Modelling Autosegmental Phonology with Multi-Tape Finite State Transducers. PhD diss., Simon Fraser University, Burnaby, Canada.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Narayanan, A., Hashem, L. Finite-state abstractions on Arabic morphology. Artif Intell Rev 7, 373–399 (1993). https://doi.org/10.1007/BF00849932
Issue Date:
DOI: https://doi.org/10.1007/BF00849932