Skip to main content
Springer Nature Link
Log in

Affix grammars for natural languages

  • Conference paper
  • First Online:
Attribute Grammars, Applications and Systems (SAGA School 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 545))

Abstract

Affix Grammars over a Finite Lattice (AGFLs), a simple form of two-level grammars admitting quite efficient implementations, are proposed as a formalism to express the syntax of natural languages. In this paper the concepts and notation of Agfls are described. A brief example is given of their use in describing a fragment of the English language, followed by a discussion of issues like parsing and ambiguity.

Prepared while the author was visiting the Technical University of Budapest on a TEMPUS-grant.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. AARTS, J. and VAN DEN HEUVEL, Th. (1985), Computational tools for the syntactic analysis of corpora. In: Linguistics 23, 303–335.

    Google Scholar 

  2. DITTERS, E. (1988), A Formal Grammar for Automatic Syntactic Analysis and other Applications, In: Proceedings of the Regional Conference on Informatics and Arabization, IRSIT, Tunis, Vol.1, 128–45.

    Google Scholar 

  3. EARLEY, J. (1970), An efficient context-free parsing algorithm. Communications of the ACM 13, 94–102.

    Article  Google Scholar 

  4. GAZDAR, G. et al. (1985), Generalized Phrase Structure Grammar, Harvard University Press, Cambridge Mass.

    Google Scholar 

  5. HALLEBEEK, J. (1987), Hacia un sistema de análisis sintáctico automatizado: el proyecto ASATE. In: Martin Vide, C. (Ed), Actas del II Congreso de Lenguajes Naturales y Lenguajes Formales. Universidad de Barcelona, 545–558.

    Google Scholar 

  6. HALLEBEEK, J. (1990), Een grammatica voor automatische analyse van het Spaans. Diss. University of Nijmegen. In Dutch, French translation to appear.

    Google Scholar 

  7. HARRISON, M.A. (1987), Introduction to Formal Language Theory. Addison-Wesley.

    Google Scholar 

  8. HEUVEL, Th. van de, et al. (1983), Extended Affix Grammars in Linguistics. A Manual. English Department, University of Nijmegen.

    Google Scholar 

  9. KÁROLY, S. (1972), The Grammatical System of Hungarian, In: Loránd Benkö and Samu Imre (Eds), The Hungarian Language, Akadémiai Kiadó, Budapest.

    Google Scholar 

  10. KOSTER, C.H.A. (1975), A technique for parsing ambiguous grammars, In: GI 4. Jahrestagung, D. Siefkes (Ed.), Lecture Notes in Computer Science 26, Springer Verlag.

    Google Scholar 

  11. KRULEE, G.K. (1991), Computer Processing of Natural Language, Prentice Hall.

    Google Scholar 

  12. LEO, J. (1986), On the Complexity of Top-Down Backtrack Parsers; A Reexamination, In: Proceedings Annual NGI Conference, Utrecht.

    Google Scholar 

  13. MEERTENS, L.G.L.Th. & C.H.A. KOSTER (1962), An affix grammar for a part of the English language, presented at Euratom Colloquium, University of Amsterdam, 1962. Not published. Reprints may be obtained from the author.

    Google Scholar 

  14. MEIJER, H. (1986), PROGRAMMAR a Translator Generator. Diss. University of Nijmegen.

    Google Scholar 

  15. MEIJER H. (1990), The project on Extended Affix Grammars at Nijmegen, In: Attribute Grammars and their Applications, SLNC 461, 130–142.

    Google Scholar 

  16. MORITZ, M.P.G. (1989), Description and Analysis of Static Semantics by Fixed Point Equations. Diss. University of Nijmegen.

    Google Scholar 

  17. Oostdijk, N. (1984), An Extended Affix Grammar for the English Noun Phrase, In: J. Aarts and W. Meijs (eds), Corpus Linguistics. Recent Developments in the Use of Computer Corpora in English Language Research, Amsterdam: Rodopi.

    Google Scholar 

  18. PULLUM, G. and GAZDAR, G. (1982) Natural Languages and Context Free Languages, Linguistics and Philosophy 4.

    Google Scholar 

  19. SCHOORL, J.J and BELDER, S. (1990), Computational Linguistics at Delft, a Status Report, Report WTM/TT 90–09, Delft University of Technology.

    Google Scholar 

  20. Tomita, M (1988), Efficient Parsing for Natural Language, a Fast Algorithm for Practical Systems. Kluwer.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, University of Nijmegen, Toernooiveld 1, 6525, ED Nijmegen, The Netherlands

    C. H. A. Koster

Authors
  1. C. H. A. Koster
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Henk Alblas Bořivoj Melichar

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Koster, C.H.A. (1991). Affix grammars for natural languages. In: Alblas, H., Melichar, B. (eds) Attribute Grammars, Applications and Systems. SAGA School 1991. Lecture Notes in Computer Science, vol 545. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54572-7_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-54572-7_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54572-9

  • Online ISBN: 978-3-540-38490-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics