Skip to main content

The CG mars lander

  • Conceptual Graph Tools
  • Conference paper
  • First Online:
Book cover Conceptual Structures: Fulfilling Peirce's Dream (ICCS 1997)

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

Included in the following conference series:

Abstract

The name of the system is “THE CG MARS LANDER”, which stands for Type Hierarchy Enhanced CG Matching And Retrieval System Linear Associative N-tuple Deductive Embedded Representation. The application is text retrieval. The technique involves translation of text fragments into an informationally ordered form (CGs) and retrieval on the induced subsumption ordering. This application is a linearized CG, NLP, query, matching and retrieving system. English discourse is converted into CGs which are stored in an associative database. The hierarchical database is guided by content morphology and associated ontological type hierarchy, to produce a partially ordered “more general than” hierarchy based on subgraph containment. Due to the nature of the ADB a query is answered by being inserted into the DB. The query's successors in the DB are the answers to the query, as well as the (more specific) retrieved relevancies.

in collaboration with Text Wise, Syracuse, New York

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. C. Colin and R. Levinson, “Partial order maintenance,” Special Interest Group on Information Retrieval Forum, vol. 23, no. 3,4, pp. 34–59, 1988.

    Google Scholar 

  2. G. Ellis, R. Levinson, and P. Robinson, “Managing complex objects in PEIRCE,” Special Issue on Object-Oriented Approaches in Artificial Intelligence and Human-Computer Interaction (IJMMS), 1994. To Appear.

    Google Scholar 

  3. R. Hughey, R. Levinson, and J. D. Roberts, eds., Issues in Parallel Hardware for Graph Retrieval, 1993.

    Google Scholar 

  4. R. Levinson, “A self-organizing retrieval system for graphs,” in AAAI-84, pp. 203–206, Morgan Kaufman, 1984.

    Google Scholar 

  5. R. Levinson, “Pattern associativity and the retrieval of semantic networks,” Computers and Mathematics with Applications, vol. 23, no. 6–9, pp. 573–600, 1992. Part 2 of Special Issue on Semantic Networks in Artificial Intelligence, Fritz Lehmann, editor. Also reprinted on pages 573–600 of the book, Semantic Networks in Artificial Intelligence, Fritz Lehmann, editor, Pergammon Press, 1992.

    Google Scholar 

  6. R. Levinson and G. Ellis, “Multilevel hierarchical retrieval,” Knowledge-Based Systems, vol. 5, pp. 233–244, September 1992. Special Issue on Conceptual Graphs.

    Google Scholar 

  7. R. Levinson and G. Fuchs, “A pattern-weight formulation of search knowledge,” Tech. Rep. UCSC-CRL-91-15, University of California Santa Cruz, 1994a. Revision to appear in Computational Intelligence.

    Google Scholar 

  8. R. A. Levinson, “Uds: A universal data structure,” in Proc. 2nd International Conference on Conceptual Structures, (College Park, Maryland USA), pp. 230–250, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Dickson Lukose Harry Delugach Mary Keeler Leroy Searle John Sowa

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fuchs, G., Levinson, R. (1997). The CG mars lander. In: Lukose, D., Delugach, H., Keeler, M., Searle, L., Sowa, J. (eds) Conceptual Structures: Fulfilling Peirce's Dream. ICCS 1997. Lecture Notes in Computer Science, vol 1257. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027907

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63308-2

  • Online ISBN: 978-3-540-69424-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics