U.S. patents available from 1976 to present.
U.S. patent applications available from 2005 to present.

Concept matching of natural language queries with a database of document concepts

Patent 5418948 Issued on May 23, 1995. Estimated Expiration Date: Icon_subject September 8, 2013. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.

Patent References

Finite state automaton with multiple state types
Patent #: 4241402
Issued on: 12/23/1980
Inventor: Mayper, Jr. ,   et al.

Automated information input, storage, and retrieval system
Patent #: 4270182
Issued on: 05/26/1981
Inventor: Asija

Office correspondence storage and retrieval system
Patent #: 4358824
Issued on: 11/09/1982
Inventor: Glickman ,   et al.

Retrieval of related linked linguistic expressions including synonyms and antonyms
Patent #: 4384329
Issued on: 05/17/1983
Inventor: Rosenbaum ,   et al.

Digital data processing method and means for word classification by pattern analysis
Patent #: 4471459
Issued on: 09/11/1984
Inventor: Dickinson ,   et al.

Locating digital coded words which are both acceptable misspellings and acceptable inflections of digital coded query words
Patent #: 4499553
Issued on: 02/12/1985
Inventor: Dickinson ,   et al.

Keyword search automatic limiting method
Patent #: 4554631
Issued on: 11/19/1985
Inventor: Reddington

Indexing subject-locating method
Patent #: 4580218
Issued on: 04/01/1986
Inventor: Raye

Artificial intelligence system
Patent #: 4670848
Issued on: 06/02/1987
Inventor: Schramm

Natural-language interface generating system
Patent #: 4688195
Issued on: 08/18/1987
Inventor: Thompson ,   et al.

More ...

Inventor

Assignee

Application

No. 118033 filed on 09/08/1993

US Classes:

707/4Query formulation, input preparation, or translation

Examiners

Primary: Black, Thomas G.
Assistant: Amsbury, Wayne

Attorney, Agent or Firm

International Class

G06F 017/30

Abstract

A computer implemented process for creating a search query for an information retrieval system in which a database is provided containing a plurality of stopwords and phrases. A natural language input query defines the composition of the text of documents to be identified. Each word of the natural language input query is compared to the database in order to remove stopwords from the query. The remaining words of the input query are stemmed to their basic roots, and the sequence of stemmed words in the list is compared to phrases in the database to identify phrases in the search query. The phrases are substituted for the sequence of stemmed words from the list so that the remaining elements, namely the substituted phrases and unsubstituted stemmed words, form the search query. The completed search query elements are query nodes of a query network used to match representation nodes of a document network of an inference network. The database includes as options a topic and key database for finding numerical keys, and a synonym database for finding synonyms, both of which are employed in the query as query nodes.

Other References

  • Croft et al, "A Retrieval Model Incorporating Hypertext Links", Hypertex '89 Proceedings, Association for Computer Machinery, pp. 213-224 (Nov. 1989)
  • Turtle et al, "Inference Networks for Document Retrieval", COINS Technical Report 90-07, University of Massachusetts (Mar. 1990
  • Turtle et al, "Inference Network for Document Retrieval", SIGIR 90, Association for Computing Machinery, pp. 1-24 (Sep. 1990)
  • Turtle, "Inference Network for Document Retrieval", Ph.D. Dissertation, COINS Technical Report 90-92, University of Massachusetts (Oct. 1990)
  • Turtle et al, "Efficient Probabilistic Inference for Text Retrieval", RIAO '91 Conference Proceedings, Recherche d'Informaion Assistee par Ordinateur, Universitat Autonoma de Barcelona, Spain, pp. 644-661 (Apr. 1991)
  • Turtle et al., "Evaluation of an Inference Network-Based Retrieval Model", Transactions on Information Systems, Association for Computer Machinery, vol. 9, No. 3. pp. 187-223 (Jul. 1991)
  • Croft et al., "Interactive Retrieval of Complex Documents", Information Processing and Management, vol. 26, No. 5, pp. 593-613 (1990)
  • Haynes, "Designing a System for the Specialized User: A Case Study", Proceedings--1985 National Online Meeting, Learning Information Inc., pp. 205-213, Apr. 30, 1985
  • Porter, "An Algorithm for Suffix Skipping", Program, vol. 14, pp. 130-137 (1980)
  • Sembok et al. "SILOL: A Simple Logic-Linguistic Document Retrieval System" Information Processing & Management, vol. 26, No. 1, pp. 111-134 (1990
PatentsPlus Images
Enhanced PDF formats
loading...
PatentsPlus: add to cart
PatentsPlus: add to cartSearch-enhanced full patent PDF image
$9.95more info
PatentsPlus: add to cart
PatentsPlus: add to cartIntelligent turbocharged patent PDFs with marked up images
$18.95more info
 
Sign InRegister
Username  
Password   
forgot password?