10. A computer implemented method for searching and ranking a list of files-of-interest, comprising: receiving an user input query comprising a plurality of keywords; for each file in the list: aâ€”determine a number of unmatched query-keywords during searching each paragraph of the file, and if the number of unmatched query-keywords is greater than a portion of a total number of keywords in the query, set the paragraph score to zero and skip to a next paragraph, bâ€”determine a number of unique matched query-keywords for each paragraph of the file, câ€”determine a number of matched keywords occurred in each paragraph of the file, dâ€”determine a plurality of distances between matched keywords within each paragraph, eâ€”determine a number of distances less than a threshold distance within each paragraph, fâ€”determine a plurality of paragraph scores, wherein each paragraph score is calculated based on said number of matched keywords, said number of unique matched query-keywords, a distance from said plurality of distances, and said number of distances less than said threshold distance, gâ€”determine an overall score based on at least two of said plurality of paragraph scores, wherein each overall score comprises a plurality of scores; sorting and ranking said files based on the overall scores of said files; and presenting results of said ranking to the user, wherein said sorting and ranking is based on both priority levels and score values of said plurality of scores, said priority levels of said plurality of scores are initially set according to a default setting, in response to the score values of at least two current compared scores are equal, the score values of at least two respective scores with lower priority are used for ranking.
10. A computer implemented method for searching and ranking a list of files-of-interest, comprising: receiving an user input query comprising a plurality of keywords; for each file in the list: aâ€”determine a number of unmatched query-keywords during searching each paragraph of the file, and if the number of unmatched query-keywords is greater than a portion of a total number of keywords in the query, set the paragraph score to zero and skip to a next paragraph, bâ€”determine a number of unique matched query-keywords for each paragraph of the file, câ€”determine a number of matched keywords occurred in each paragraph of the file, dâ€”determine a plurality of distances between matched keywords within each paragraph, eâ€”determine a number of distances less than a threshold distance within each paragraph, fâ€”determine a plurality of paragraph scores, wherein each paragraph score is calculated based on said number of matched keywords, said number of unique matched query-keywords, a distance from said plurality of distances, and said number of distances less than said threshold distance, gâ€”determine an overall score based on at least two of said plurality of paragraph scores, wherein each overall score comprises a plurality of scores; sorting and ranking said files based on the overall scores of said files; and presenting results of said ranking to the user, wherein said sorting and ranking is based on both priority levels and score values of said plurality of scores, said priority levels of said plurality of scores are initially set according to a default setting, in response to the score values of at least two current compared scores are equal, the score values of at least two respective scores with lower priority are used for ranking. 15. The method according to claim 10 , wherein at least one of said plurality of scores of each file comprises a combination of at least two of: a highest paragraph score; an average score of top N paragraph scores, where N is a predetermined number; a special paragraph score; a total number of unique matched query-keywords in the file; a total number of matched keywords in the file; a total number of distances less than the threshold distance within the file; a distance between a first matched keyword and a last matched keyword within the file.