Abstract.
The web faces a major contradiction: it has been created to present information to human beings but the increase of available information sources on the web makes it more difficult for people to find the most relevant documents when browsing through numerous pages of URLs returned by search engines. Classic indexing and retrieval techniques have an important limitation: the retrieved documents do not necessarily match the meaning of the user’s query. In order to address this issue, we designed a system capable of matching conceptual structures extracted from both the user’s query and documents retrieved by a classic search engine like Google. This article presents our fully functional application and provides details about its behavior. The application provides a new framework for broader experiments in the manipulation of conceptual structures extracted from natural language documents and is built upon research and tools developped by the CG community.
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
Barrière, C.: From a Children’s First Dictionary to a Lexical Knowledge Base of Conceptual Graphs. PhD thesis, Université Simon Fraser (1997)
Mel’čuk, I.: Leçon inaugurale. Collège de France, Chaire Internatonale (1997), http://www.fas.umontreal.ca/ling/olst/FrEng/melcukColldeFr.pdf
Järvinen, T., Tapanainen, P.: Towards an implementable dependency grammar (1998), http://citeseer.nj.nec.com/73472.htm
Montes-y Gómez, M.: Minería de texto empleando la semenjanza entre estructuras semánticas. PhD thesis, Centro de Investigación en Computación, Instituto Polit’ecnico Nacional, Mexíco (2002)
Montes-y Gómez, M., Gelbukh, A., López López, A.: Flexible Comparison of Conceptual Graphs. In: Mayr, H.C., Lazanský, J., Quirchmayr, G., Vogel, P. (eds.) DEXA 2001. LNCS, vol. 2113, p. 102. Springer, Heidelberg (2001), http://cseg.inaoep.mx/~mmontesg/papers/FlexibleComparisonCG-dexa01.pdf
Nicolas, S., Moulin, B., Mineau, G.: Extracting Conceptual Structures from English Texts Using a Lexical Ontology and a Grammatical Parser. In: Sup. Proc. of 10th International Conference on Conceptual Structures, ICCS 2002 (2002), http://s-java.ift.ulaval.ca/~steff/iccs2002-final.pdf
Poole, J., Campbell, J.A.: A Novel Algorithm for Matching Conceptual and Related Graphs. In: Proceedings of ICCS 1995 (1995)
Roux, C., Proux, D., Rechennmann, F., Julliard, L.: An Ontology Enrichment Method for a Pragmatic Information Extraction System gathering Data on Genetic Interactions, http://citeseer.nj.nec.com/318185.htm
Southey, F., Linders, J.G.: Notio - A Java API for Developing CG Tools. In: Tepfenhart, W.M. (ed.) ICCS 1999. LNCS, vol. 1640, pp. 262–271. Springer, Heidelberg (1999), http://backtrack.math.uwaterloo.ca/CG/projects/notio/NotioForICCSFinal.ps.zip
Sowa, J.F., Way, E.C.: Implementing a semantic interpreter using conceptual graphs. IBM Journal of Research and Development (1986)
Tajarobi, A.: La reconnaissance automatique des hyponymes. Master’s thesis, Département de langues et linguistique, Université Laval (1998)
Tesnière, L.: Eléments de syntaxe structurale. Editions Klincksieck, Paris (1959)
Zhong, J., Zhu, H., Li, J., Yu, Y.: Conceptual Graph Matching for Semantic Search. In: Priss, U., Corbett, D.R., Angelova, G. (eds.) ICCS 2002. LNCS (LNAI), vol. 2393, pp. 93–106. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nicolas, S., Moulin, B., Mineau, G.W. (2003). Sesei: A CG-Based Filter for Internet Search Engines. In: Ganter, B., de Moor, A., Lex, W. (eds) Conceptual Structures for Knowledge Creation and Communication. ICCS 2003. Lecture Notes in Computer Science(), vol 2746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45091-7_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-45091-7_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40576-4
Online ISBN: 978-3-540-45091-7
eBook Packages: Springer Book Archive