10. The system of claim 9 wherein said search query comprises a pre-existing document.
9. A system for ranking the relevance of each of a plurality of documents in a corpus to a search query comprising: a) a processing unit capable of performing calculations; b) a storage device on which is stored a corpus of documents; c) an input device for receiving the search query; d) an output device for displaying the results of the ranking; wherein the processing unit groups words in the search query by synonym into one or more word groups; wherein the processing unit, for each word group, counts the number of instances (the “FQ” value) that a word from the word group appears in the search query; wherein the processing unit determines the maximum FQ value among all the word groups; wherein the processing unit calculates a scaling factor K; wherein the processing unit, for each word group, calculates a term frequency (“TF”) value by dividing the FQ value for the word group by the maximum FQ value and applying scaling factor K to the resulting quotient; wherein the processing unit, for each word group, counts the number of documents (“FC”) in the corpus that contain at least one word from the word group; wherein the processing unit counts the number of documents (“N”) in the corpus; wherein the processing unit, for each word group, calculates an inverse document frequency (“IDF”) value by dividing N by FC, adding one to the resulting quotient, and taking the natural logarithm of the resulting sum; wherein the processing unit, for each word group, calculates a TF-IDF value by multiplying said TF value by said IDF value; and wherein the processing unit ranks the relevance of each document in the corpus utilizing the TF-IDF values for the word groups in the search query.