Patent Document ID: 8229921
Application ID: 12036681

Base Claim:
1. A computer implemented method for indexing and retrieving documents in a database, comprising the steps of: constructing a set of particles and a simultaneously optimized particle-based language model using training documents, and in which a perplexity of the particle-based language model is at least ten times lower than the perplexity of a word-based language model constructed from the same training documents, wherein the set of particles applies expectation maximization to an objective function, and where the objective function considers any combination of: a size of the set of particles; errors in representing all documents in a document training set and a query training set; a retrieval accuracy of using the set of particles; an entropy of a statistical models that represent the set of particles; and a particle-level language model derived from the documents and the queries in the training sets; converting each document in a collection of documents to a document particle graph, the document particle graph including particles selected from the set of the particles; extracting, for each document, a set of document keys from the corresponding particle graph; storing the document keys for each document in an index to a database storing the collection of documents; converting a query to a query particle graph including a set of query particles, the query graph including particles selected from the set of the particles; extracting a set of query keys from the query particle graph; retrieving relevant documents from the database according to the query keys and the document keys stored in the index; and outputting the relevant documents to a user.

---

Claim 12:
12. The method of claim 1 , in which the document particle graph and the query particle graph are normalized by a spelling-to-pronunciation mechanism.