[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Management of uncertainty in the attachment problem in natural language processing

  • 8. Uncertainty In Intelligent Systems
  • Conference paper
  • First Online:
Uncertainty in Knowledge Bases (IPMU 1990)

Abstract

The problem of choosing the most plausible attachment for a prepositional phrase (PP) or a relative clause (RC) is one of the most significant challenges to a NL Processing system, since it presupposes an in-depth understanding of the interaction between the different sources of knowledge involved in the task of processing a sentence (in particular, we consider syntactic and semantic knowledge). In the paper, we argue that traditional categorical approaches do not adequately face the intrinsic complexity of the attachment problem and we describe a more flexible approach, based on management of uncertainty: both syntax and semantics provide a Confidence Degree (CD) for the linguistic connections, and a weighed combination of these CDs allow the system to select the most plausible connection when different alternatives are possible.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Altmann, G. and Steedman, M., “Interaction with context during human sentence processing,” Cognition 30 pp. 191–238 (1988).

    Article  PubMed  Google Scholar 

  2. Bhatnagar, R.K. and Kanal, L.N., “Handling Uncertain Information: A Review of Numeric and Non-numeric Methods,” pp. 3–26 in Uncertainty in Artificial Intelligence, ed. L.N. Kanal, J.F. Lemmer, North-Holland (1986).

    Google Scholar 

  3. Chamiak, E., “Six topics in Search of a Parser,” pp. 1079–1087 in Proc.7th IJCAI, Vancouver (1981).

    Google Scholar 

  4. Connine, C., Ferreira, F., Jones, C., Clifton, C., and Frazier, L., “Verb frame preferences: Descriptive norms,” Journal of psycholinguistic research 13(4) pp. 407–428 (1975).

    Google Scholar 

  5. Crain, S. and Steedman, M., “On Not Being Led Up The Garden Path: The Use of Context by the Psychological Parser,” in Syntactic Theory and How People Parse Sentences, ed. D.R. Dowty, L.J. Karttunen, A.M. Zwicky, Cambridge Univ. Press (1984).

    Google Scholar 

  6. DiEugenio, B. and Lesmo, L., “Representation and interpretation of determiners in natural language,” pp. 648–654 in Proc. IJCAI 87, Milano (1987).

    Google Scholar 

  7. Dubois, D. and Prade, H., Fuzzy sets and systems: theory and applications, Academic Press (1980).

    Google Scholar 

  8. Fillmore, C., “The case for case,” in Universals in linguistic theory, ed. Bach and Harms, Holt, Rinehart and Winston, New York (1968).

    Google Scholar 

  9. Ford, M., Bresnan, J.V., and Kaplan, R.M., “A competence based theory of syntactic closure,” in The mental representation of grammatical relations, ed. Bresnan, MIT Press (1982).

    Google Scholar 

  10. Frazier, L. and Fodor, J.D., “The sausage machine: A new two-stage parsing model,” Cognition 6 (4), pp. 291–235 (December 1978).

    Article  Google Scholar 

  11. Hirst, G., Semantic interpretation and the resolution of ambiguity, Cambridge University Press (1987).

    Google Scholar 

  12. Lesmo, L., Berti, M., and Terenziani, P., “A Network Formalism for Representing Natural Language Quantifiers,” pp. 473–478 in Proc. European Conference on Artificial Intelligence 88, Munich (1988).

    Google Scholar 

  13. Lesmo, L., Saitta, L., and Torasso, P., “Evidence Combination in Expert Systems,” Man-Machine Studies 22 pp. 307–326 (1985).

    Google Scholar 

  14. Lesmo, L. and Torasso, P., “Analysis of Conjunctions in a Rule Based Parser,” pp. 180–187 in Proc. 23rd Annual Meeting of Association Computational Linguistics, (1985).

    Google Scholar 

  15. Lesmo, L. and Torasso, P., “A Flexible Natural Language Parser based on a two-level Representation of Syntax,” pp. 114–121 in Proc. 1st Conf. ACL Europe, Pisa (1983).

    Google Scholar 

  16. Lesmo, L. and Torasso, P., “Weighted Interaction of Syntax and Semantics in Natural Language Analysis,” pp. 772–778 in Proc. 9th Int. Joint Conf. on Artificial Intelligence, Los Angeles (1985).

    Google Scholar 

  17. Marcus, M., A Theory of Syntactic Recognition for Natural Language, MIT Press (1980).

    Google Scholar 

  18. Sagalowicz, D., “Mechanical Intelligence: Research and Applications,” Tech. Report, SRI Int., Menlo Park (1980).

    Google Scholar 

  19. Schank, R., Conceptual information processing, North Holland, Amsterdam (1975).

    Google Scholar 

  20. Terenziani, P., “A Rule Based Approach to the Semantic Interpretation of Natural Language,” to appear in Computers and Artificial Intelligence, (1991).

    Google Scholar 

  21. Tyler, L.K. and Marslen-Wilson, W.D., “Speech Comprehension Process,” pp. 169–184 in Perspectives on mental representation: Experimental and Theoretical studies of cognitive processes, ed. Mehler, Walker, Garret,Lawrence Erlbaum Associates (1982).

    Google Scholar 

  22. Wilks, Y.A., Huang, X., and Fass, D., “Syntax, preference and right attachment,” pp. 779–784 in Proc.9th IJCAI, Los Angeles (1985).

    Google Scholar 

  23. Wilks, Y.A., “A preferential Pattern-Seeking Semantics for Natural Language Inference,” Artificial Intelligence 6 pp. 53–74 (1975).

    Article  Google Scholar 

  24. Winograd, T., Language as a Cognitive Process — Syntax —, Addison-Wesley (1983).

    Google Scholar 

  25. Winograd, T., Understanding Natural Language, Academic Press, New York (1972).

    Google Scholar 

  26. Woods, W.A., Kaplan, R.M., and Nash-Webber, B.L., “The Lunar Sciences Natural Language Information System: Final Report,” Tech. Report 2378, BBN Inc., Cambridge (1972).

    Google Scholar 

  27. Woods, W.A., “Semantics for a question answering system,” Outstanding dissertations in Computer Sciences, (1979).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Bernadette Bouchon-Meunier Ronald R. Yager Lotfi A. Zadeh

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Terenziani, P., Lesmo, L., Gerbino, E. (1991). Management of uncertainty in the attachment problem in natural language processing. In: Bouchon-Meunier, B., Yager, R.R., Zadeh, L.A. (eds) Uncertainty in Knowledge Bases. IPMU 1990. Lecture Notes in Computer Science, vol 521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028133

Download citation

  • DOI: https://doi.org/10.1007/BFb0028133

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54346-6

  • Online ISBN: 978-3-540-47580-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics