1887
Volume 54, Issue 1
  • ISSN 0019-0829
  • E-ISSN: 1783-1490
USD
Buy:$35.00 + Taxes

Abstract

In this paper a system will be described that enables the design of a series of computer programs ("modules") for the automatic treatment of homography.By homography we mean the ambiguity between the graphic representation of word forms belonging to different syntactic classes.By automatic treatment of homography we mean assigning the correct syntactic class to homographs with the help of an algorithm.Homography is a problem connected with written text only.In our opinion it is not a linguistic problem,but a problem of information processing using linguistic and extralinguistic signs.

As linguistic signs the syntactic rules of the so-called surface structure are used.They are used from two different points of view:the string properties are used to shape the algorithm; the constituent structure is used to find out which branch is to be taken in the algorithm.Thus the design of the system is more or less comparable with Winograd's model for semantic information processing or Salkoff's String Grammar (Salkoff,1973).

However,we are not developing a model for parsing structures.The paper is devoted to homography because the systems developed in the past neglected this kind oflinguistic information processing.

On the other hand the output of homography solving programs forms useful input for a variety of sciences studying aspects of languages use.Not only purely linguistic studies could use text input free from homography,but also literary,sociological and even legal text studies or question answering systems using data bases (Berry-Rogghe,1978; Kragelöh;

Lockemann) needsuchinput.A more detailed description will be given of a concrete problem:the definition of the information that should be computed to disambiguate the homography of the German determiner.We developed a linear bounded automaton,because this proved to be the most efficient way to solve,the problem of homography.

Loading

Article metrics loading...

/content/journals/10.1075/itl.54.04boo
1981-01-01
2019-12-05
Loading full text...

Full text loading...

References

  1. Bates, M.
    (1978): The theory and practic of Augmented Transition Network Grammars”. In: L. Bolc (ed.): Natural Language Communication with Computers.
    [Google Scholar]
  2. Bense, M.
    (1969): Einführung in die Informationstheoretische Ästhetik, Grundlegung und Anwendung in der Texttheorie. Reinbeck bei Hamburg.
    [Google Scholar]
  3. Berry-Rogghe, G.L. & Wulz, N.
    (1978): An overview of PLIDIS. In: L. Bolc (ed.): Natural Language Communication with Computers.
    [Google Scholar]
  4. Boot, M.
    (1974): Automatische Cursusanalyse en Syntaxis. In: Levende Talen.
    [Google Scholar]
  5. (1977): Key words in Natural Languages. A problem of System Analysis. In: Annals of System Research.
    [Google Scholar]
  6. (1978a): Ambiguity and automated content analysis. In: MDN3, 1.
    [Google Scholar]
  7. (1978b): Sprache, Redundanz und Automation. Entwurf einer Prozesslinguistik. In: Studien zur Linguistik und Didaktik. Leiden.
    [Google Scholar]
  8. Dietrich, R.
    (1973): Automatische Textwörterbücher, Studien zur maschinellen Lemmatisierung verbaler Wortformen des Deutschen. Tübingen.
  9. Dietrich, R. & Klein, W.
    (1974): Computerlinguistik. Stuttgart.
  10. Eggers, H.
    e.a. (1969): Elektronische Syntaxanalyse der deutschen Gegenwartssprache. Tübingen.
  11. Engel, U. & Vogel, I.
    (ed.) (1974): Zur Maschinellen Syntaxanalyse. Mannheim.
  12. van Gestel, F.
    (1972): On the article. In: Linguistics in the Netherlands. Assen.
    [Google Scholar]
  13. Gleason, H.A.
    (1961): An Introduction to descriptive Linguistics. Revised edition, Holt, Rinehart and Winston . New York, Chicago, San Fransisco, Toronto, London.
  14. Harris, Z.
    (1970): Discourse Analysis. In: Harris, Z. Papers in Structural and Transformational Linguistics. Dordrecht.
    [Google Scholar]
  15. Hays, D.
    (1967): Introduction to Computational Linguistics. New York.
  16. Kallmeyer
    (ed.) (1974): Lektürekollege zur Textlinguistik. Frankfurt.
  17. Kragelöh, K.D. & Lockemann, P.C.
    (1978): Access to data base systems via natural language. In: Bolc, L. (ed.): Natural Language Communication with Computers.
    [Google Scholar]
  18. Mempham, M.
    (1973): Computation in Language Text Analysis. Quebec.
  19. Meyer, H.
    (1976): Deutsche Sprachstatistik. Mannheim.
  20. Peirce, C.S.
    : Collected Papers1931–1958. Cambridge, Harvard University Press.
  21. Pelc, C.
    (1971): Studies in Functional Logical Semiotics of Natural Language. The Hague.
  22. Salkoff, M.
    (1973): La Grammaire en chaine du Français. Paris.
  23. Schweisthal, K.
    (1971): Präpositionen in der maschinellen Sprachbearbeitung. Bonn.
  24. von Stechow, A.
    (1976): Deutsche Wortstellung und Lambda – kategoriale Sprachen. Konstanz.
  25. Weber, H.
    (1974): Mehrdeutige Wortformen im heutigen Deutsch. Tübingen.
  26. Wilks, Y.
    (1972): Grammar, Meaning and the Machine Analysis of Language. London.
  27. (1975): An intelligent Analyser and understander of English. In: CACM, vol18, nr.5.
    [Google Scholar]
  28. Winograd, T.
    (1972): Understanding Natural Language. In: Cognitive Psychology.
    [Google Scholar]
  29. Woods, W.
    (1973): An experimental parsing system for Transition Network Grammars. In: Rustin, R. (ed.): Natural Processing. New York, CIMS.
    [Google Scholar]
  30. Zimmermann, H.
    (1973): Das Lexikon in der maschinellen Sprachanalyse. Frankfurt.
http://instance.metastore.ingenta.com/content/journals/10.1075/itl.54.04boo
Loading
  • Article Type: Research Article
This is a required field
Please enter a valid email address
Approval was successful
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error