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,
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
A. Church. The Calculi of Lambda Conversion. Princeton University Press, Princeton, NJ, 1941.
J. Cowie and W. Lehnert. Information extraction. In Communications of the ACM, volume 39, pages 80–91, 1996.
G. F. DeJong. Prediction and substantiation. In Cognitive Science, volume 3, pages 251–273, 1979.
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.
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.
L. Hirschman and M. Vilain. Extracting information from the muc. In ACL Tutorial, volume 41,pages 109–148, 1995.
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.
J. R. Hobbs, M. Stickel, D. Appelt, and P. Martin. Interpretation as abduction. In Artificial Intelligence, volume 63, 1-2, pages 69–142, 1993.
C. S. Peirce. On the algebra of logic. In American Journal of Mathematics, volume 7, pages 180–202, 1885.
Don D. Roberts. The Existential Graphs of Charles S. Peirce. Mouton, The Hague, 1973. 85
J. F. Sowa. Conceptual Structures:Information Processing in Mind and Machine. Addison-Wesley, Reading, MA, 1984.
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.
J. F. Sowa. Knowledge Representation:Logical, Computational, and Philosophical Foundations. PWS, Pacific Grove, CA,1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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