Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
1999-03-19
2003-06-24
Alam, Hosain T. (Department: 2172)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000
Reexamination Certificate
active
06584464
ABSTRACT:
BACKGROUND OF THE INVENTION
The present invention relates to information query systems in general and to interactive query systems more particularly.
With the increasing popularity of the Internet, the global internetwork of networks, many services have come into being that seek to provide information for users of those services. One such service is the GOPHER service, wherein a user is presented with lists of information in the form of menus, and the user is provided with options to select a menu item, which might lead to another menu or to a document of interest, or to initiate a search with a particular set of keywords. The GOPHER system was primarily text based, with the underlying structure being directories on file servers, usually spanning many interlinked and independent servers.
With the advent of a more graphical interface, many such search services continue today, albeit with a graphical interface for use with a Web browser. Here, “Web” refers to the hyperlinked collection of dynamic and static hypertext pages available over the Internet using the HTTP (HyperText Transport Protocol) and commonly referred to as the “World Wide Web” or “WWW”, and a Web browser is a client program which allows a user to navigate the Web.
A typical navigation involves setting up an initial query with a set of search terms and viewing the results. If the results are provided as a hypertext page, the user can then select a link on that hypertext page to view the results in more detail.
A disadvantage of searching using search terms is that the English language is imprecise without context and computers are not good at context. For example, asking a human librarian about “freedom and values in the Victorian era” might yield a book of essays on what the social mores were in the late nineteenth century in Europe and North America. However, performing a search with a search engine against a database of documents might result in the computer returning listings of real estate values for homes with Victorian architecture in Freedom, Calif.
Many providers of search services have attempted to automate the process of determining the proper context of a query so that the correct meaning is ascribed to each term. For example, a server might be programmed to note the ambiguity in the term “Victorian” and to further note that “era” refers to a time period and therefore, “Victorian” should be interpreted as the time period. Such processing is quite complex and often still fails to understand the context in which the user asks the question.
SUMMARY OF THE INVENTION
One embodiment of an information server according to the present invention directs users of the information server to desired sources of information where the desired sources of information are determined, at least in part, based on user input. The information server includes a query input processor, a question processor and an answer processor. The query input processor is used for accepting an initial user query. The question processor processes the initial user query to identify a set of possible well-formed questions selected from the question database, where a well-formed question is a question in the database that is coupled to at least one answer reference. The answer reference is typically either an answer or a pointer to a possible location of an answer.
In a specific embodiment, the information server is coupled to the Internet so that users can pose questions using a Web browser from any Internet-connected device. In some systems, the question processor includes a tokenizer for tokenizing the initial user query into a list of words, a parser for generating a syntactic structure from the list of words, a normalizer for reducing the syntactic structure to a canonical syntactic structure, and a matcher for matching the canonical syntactic structure against a semantic network to obtain a weighted list of well-formed questions representative of possible semantic meanings for the initial user query.
REFERENCES:
patent: 4270182 (1981-05-01), Asija
patent: 4358824 (1982-11-01), Glickman et al.
patent: 4730270 (1988-03-01), Okajima et al.
patent: 4837689 (1989-06-01), Tanaka et al.
patent: 4839853 (1989-06-01), Deerwester et al.
patent: 4931926 (1990-06-01), Tanaka et al.
patent: 4931935 (1990-06-01), Ohira et al.
patent: 5067070 (1991-11-01), Miyao et al.
patent: 5115390 (1992-05-01), Fukuda et al.
patent: 5123103 (1992-06-01), Ohtaki et al.
patent: 5140522 (1992-08-01), Ito et al.
patent: 5148541 (1992-09-01), Lee et al.
patent: 5161225 (1992-11-01), Abraham et al.
patent: 5197005 (1993-03-01), Shwartz et al.
patent: 5259766 (1993-11-01), Sack et al.
patent: 5261100 (1993-11-01), Fujinami et al.
patent: 5265065 (1993-11-01), Turtle
patent: 5268839 (1993-12-01), Kaji
patent: 5297039 (1994-03-01), Kanaegami et al.
patent: 5338976 (1994-08-01), Anwyl et al.
patent: 5369575 (1994-11-01), Lamberti et al.
patent: 5383392 (1995-01-01), Kowalewski et al.
patent: 5384894 (1995-01-01), Vassiliadis et al.
patent: 5404295 (1995-04-01), Katz et al.
patent: 5418948 (1995-05-01), Turtle
patent: 5442780 (1995-08-01), Takanashi et al.
patent: 5454106 (1995-09-01), Burns et al.
patent: 5457794 (1995-10-01), Azumatani et al.
patent: 5519608 (1996-05-01), Kupiec
patent: 5523945 (1996-06-01), Satoh et al.
patent: 5542090 (1996-07-01), Henderson et al.
patent: 5715444 (1998-02-01), Danish et al.
patent: 5802493 (1998-09-01), Sheflott et al.
patent: 5819265 (1998-10-01), Ravin et al.
patent: 5836771 (1998-11-01), Ho et al.
patent: 5870737 (1999-02-01), Dockter et al.
patent: 5878423 (1999-03-01), Anderson et al.
patent: 5893219 (1999-04-01), Danish et al.
patent: 6081774 (2000-02-01), de Hita et al.
patent: 6076088 (2000-06-01), Paik et al.
patent: 6289513 (2000-09-01), Bentwich
patent: 6182068 (2001-01-01), Culliss
patent: 0196064 (1986-03-01), None
patent: WO 99/66378 (1999-12-01), None
patent: WO 00/57302 (2000-09-01), None
Peter G. Annick, “Integrating Natural Language Processing and Information Retrieval in a Troubleshooting Help Desk”, IEEE Expert, vol. 8, No. 6 pp. 9-17 (Dec., 1993).
Anon., “SQL Statement Library List”, IBM Technical Disclosure Bulletin, vol. 36, No. 1, pp. 82-83 (Jan., 1993).
Jakobovits et al., “Implementing Multi-level Queries in a Database Environment for Vision Research”, SPIE, vol. 2420, pp. 95-103 (1995).
Christopher Wisdo, “Position Paper”, AAAI Fall Symposium—AI Applications in Knowledge Navigation and Retrieval, p. 154 (1995).
Swanson, D.R. “Word Correlation and Automatic Indexing Progress Report No. 2.” Submission to the Council on Library Resources by Ramo-Wooldridge; Dec. 21, 1959.
Swanson, D.R. “Word Correlation and Automatic Indexing, Phase 1 Final Report: An Experiment in Automatic Text Searching.” Submission to the Council on Library Resources by Ramo-Wooldridge; Apr. 30, 1960.
Swanson, D.R.. “Searching Natural Language Text by Computer Machine Indexing and Text Searching Offers an Approach to the Basic Problems of Library Automation.”Science132 (1960): 1099-1104.
Bobrow, D.G. “Natural Language Input for a Computer Problem Solving System.” Ph.D. diss., Massachusetts Institute of Technology, 1964. NTIS: ADA015689.
Salton, G. “Information Storage and Retrieval” Scientific Report No. ISR-11 to The National Science Foundation, Jun. 1966.
Rubinoff et al. “Easy English, a Language for Information Retrieval Through a Remote Typewriter Console.” University of Pennsylvania, Moore School of Electrical Engineering, Apr. 1967. NTIS: AD660081.
Green, C.G. and B. Raphael. “Research on Intelligent Question-Answering Systems.” SRI Project 6001, Scientific Report 1. Stanford Research Institute, Menlo Park, CA, May 1967, NTIS: AD656789.
Stogniy, A.A. and V.N. Afanassiev. “Some Design Problems for Automatic Fact Information Retrieval and Storage Systems.” InMechanized Information Storage Retrieval and Dissemination,289-299. New York: North-Holland, 1968.
Vallee, J.F. et al. “Retrieval Formulae for Inquiry Systems.”Inform. Stor. Retr. 4(1968): 13-26.
Schank, R.C. “The Use of Conceptual Relations in Content Analysis and Data Base Storage.”
Alam Hosain T.
Ask Jeeves, Inc.
Ly Anh
Townsend & Townsend & Crew LLP
LandOfFree
Grammar template query system does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Grammar template query system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Grammar template query system will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3138455