Skip to main content

Relating Templates to Language and Logic

  • Conference paper
  • First Online:
Information Extraction (SCIE 1999)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1714))

Included in the following conference series:

Abstract

Syntactic theories relate sentence structure to the details of morphemes, inflections, and word order. Semantic theories relate sentences to the details of formal logic and model theory. But many of the most successful programs for information extraction (IE) are based on domain-dependent templates that ignore the details at the center of attention of the major theories of syntax and semantics. This paper shows that it is possible to find a more primitive set of operations, called the canonical formation rules, which underlie both the template-filling operations of IE and the more formal operations of parsers and theorem provers. These rules are first stated in terms of conceptual graphs and then generalized to any knowledge representation, including predicate calculus, frames, and the IE templates. As a result, the template-filling operations of IE become part of a more general set of operations that can be used in various combinations to process knowledge of any kind,

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. E. Appelt, J. R. Hobbs, J. Bear, D. Israel, and M. Tyson. Fastus:A finite-state processor for information-extraction from real-world text. In Proceedigs of IJCAI 93, 1993.

    Google Scholar 

  2. A. Church. The Calculi of Lambda Conversion. Princeton University Press, Princeton, NJ, 1941.

    Google Scholar 

  3. J. Cowie and W. Lehnert. Information extraction. In Communications of the ACM, volume 39, pages 80–91, 1996.

    Article  Google Scholar 

  4. G. F. DeJong. Prediction and substantiation. In Cognitive Science, volume 3, pages 251–273, 1979.

    Article  Google Scholar 

  5. G. F. DeJong. An overview of the frump system. In W. G. Lehnert & M. H. Ringle,editor, Strategies for Natual Language Processing,pages 149–176. Kluwer Academic Publishers, Erlbaum, Hillsdale, NJ, 1982.

    Google Scholar 

  6. G. Ellis, R. A. Levinson, and P. J. Robinson. Managing complex objects in peirce. In International J. of Human-Computer Studies, volume 41, pages 109–148, 1994.

    Article  Google Scholar 

  7. L. Hirschman and M. Vilain. Extracting information from the muc. In ACL Tutorial, volume 41,pages 109–148, 1995.

    Google Scholar 

  8. J. R. Hobbs, D. Appelt, J. Bear, D. Israel, M. Kameyama, M. Stickel, and M. Tyson.Fastus:A cascaded finite-state transducer for extracting information from natural-language text. In E. Roche & Y. Schabes, editor, Finite-State Language Processing, pages 383–406. MIT Press,Cambridge,MA, 1997.

    Google Scholar 

  9. J. R. Hobbs, M. Stickel, D. Appelt, and P. Martin. Interpretation as abduction. In Artificial Intelligence, volume 63, 1-2, pages 69–142, 1993.

    Article  Google Scholar 

  10. C. S. Peirce. On the algebra of logic. In American Journal of Mathematics, volume 7, pages 180–202, 1885.

    Article  MathSciNet  Google Scholar 

  11. Don D. Roberts. The Existential Graphs of Charles S. Peirce. Mouton, The Hague, 1973. 85

    Google Scholar 

  12. J. F. Sowa. Conceptual Structures:Information Processing in Mind and Machine. Addison-Wesley, Reading, MA, 1984.

    MATH  Google Scholar 

  13. J. F. Sowa. The infinite variety of logics. In O. Herzog & A. Günter, editor, KI-98: Advances in Artificial Intelligence, LNAI 1504,pages 31–53. Springer-Verlag, Berlin, 1998.

    Chapter  Google Scholar 

  14. J. F. Sowa. Knowledge Representation:Logical, Computational, and Philosophical Foundations. PWS, Pacific Grove, CA,1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin heidelberg

About this paper

Cite this paper

Sowa, J.F. (1999). Relating Templates to Language and Logic. In: Pazienza, M.T. (eds) Information Extraction. SCIE 1999. Lecture Notes in Computer Science(), vol 1714. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48089-7_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-48089-7_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66625-7

  • Online ISBN: 978-3-540-48089-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics