Patents by Inventor Nawaaz Ahmed
Nawaaz Ahmed has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 8296288Abstract: A computer-implemented method for processing user entered query data to improve results of a search of pages using a database, when searching the internet, is disclosed. The method includes receiving the user entered query data and parsing each word of the query data and segmenting words using probability to determine a likelihood that the word is for a particular name. And, associating the particular names with a name tag to create one or more tagged name terms. Then, normalizing each of the tagged name terms and the normalizing including boosting information if found in the database and determining proximity between selected ones of the tagged name terms. The method then generates an optimized search query that incorporates normalized terms and operators. The optimized search query being applied to the internet to enable search results to be produced and displayed to the user in response to the entered query data.Type: GrantFiled: July 1, 2011Date of Patent: October 23, 2012Assignee: Yahoo! Inc.Inventors: Yumao Lu, Nawaaz Ahmed, Fuchun Peng, Marco Zagha
-
Publication number: 20110264647Abstract: A computer-implemented method for processing user entered query data to improve results of a search of pages using a database, when searching the internet, is disclosed. The method includes receiving the user entered query data and parsing each word of the query data and segmenting words using probability to determine a likelihood that the word is for a particular name. And, associating the particular names with a name tag to create one or more tagged name terms. Then, normalizing each of the tagged name terms and the normalizing including boosting information if found in the database and determining proximity between selected ones of the tagged name terms. The method then generates an optimized search query that incorporates normalized terms and operators. The optimized search query being applied to the internet to enable search results to be produced and displayed to the user in response to the entered query data.Type: ApplicationFiled: July 1, 2011Publication date: October 27, 2011Applicant: Yahoo!, Inc.Inventors: Yumao Lu, Nawaaz Ahmed, Fuchun Peng, Marco Zagha
-
Patent number: 7996410Abstract: Techniques for determining when and how to transform words in a query to its plural or non-plural form in order to provide the most relevant search results while minimizing computational overhead are provided. A dictionary is generated based upon the words used in a specified number of previous most frequent search queries and comprises lists of transformations from plural to singular and singular to plural. Unnecessary transformations are removed from the dictionary based upon language modeling. The word to transform is determined by finding the last non-stop re-writable word of the query. The context of the transformed word is confirmed in the search documents and a version of the query is executed using both the original form of the word and the transformation of the word.Type: GrantFiled: February 1, 2007Date of Patent: August 9, 2011Assignee: Yahoo! Inc.Inventors: Fuchun Peng, Nawaaz Ahmed, Xin Li, Yumao Lu
-
Patent number: 7974971Abstract: A computer-implemented method for processing user entered query data to improve results of a search of pages using a local search database, when searching the internet, is disclosed. The method includes receiving the user entered query data and parsing each word of the query data and segmenting words using a probabilistic dictionary to determine a likelihood that the word is for a particular name. And, associating the particular names with a name tag to create one or more tagged name terms. Then, normalizing each of the tagged name terms and the normalizing including boosting information if found in the local search database and determining proximity between selected ones of the tagged name terms. The method then generates an optimized search query that incorporates normalized terms and operators. The optimized search query being applied to the internet to enable search results to be produced and displayed to the user in response to the entered query data.Type: GrantFiled: June 17, 2010Date of Patent: July 5, 2011Assignee: Yahoo! Inc.Inventors: Yumao Lu, Nawaaz Ahmed, Fuchun Peng, Marco Zagha
-
Patent number: 7827523Abstract: A system and method for dynamically composing a class is provided. A query is parsed and a compiler object tree is generated that corresponds to the operators in the query. A set of feature requests and responses are initiated and a set of feature objects are generated that are executed at runtime. The language of the query may be extended by registering a new operator, and optionally a new feature for a query language, with a search engine without modifying the source code of the search engine. The new operator may be specified in a plug-in and provided to the search engine via the plug-in. An application converts an end user query into an application query that conforms to the query language supported by the search engine and includes the new operator. The application query may also include references to traditional programming constructs and search engine primitives.Type: GrantFiled: February 22, 2006Date of Patent: November 2, 2010Assignee: Yahoo! Inc.Inventors: Nawaaz Ahmed, Robert L. Travis, Jr., Chad P. Walters
-
Publication number: 20100257150Abstract: A computer-implemented method for processing user entered query data to improve results of a search of pages using a local search database, when searching the internet, is disclosed. The method includes receiving the user entered query data and parsing each word of the query data and segmenting words using a probabilistic dictionary to determine a likelihood that the word is for a particular name. And, associating the particular names with a name tag to create one or more tagged name terms. Then, normalizing each of the tagged name terms and the normalizing including boosting information if found in the local search database and determining proximity between selected ones of the tagged name terms. The method then generates an optimized search query that incorporates normalized terms and operators. The optimized search query being applied to the internet to enable search results to be produced and displayed to the user in response to the entered query data.Type: ApplicationFiled: June 17, 2010Publication date: October 7, 2010Applicant: Yahoo!, Inc.Inventors: Yumao Lu, Nawaaz Ahmed, Fuchun Peng, Marco Zagha
-
Patent number: 7788276Abstract: Techniques for determining when and how to transform words in a query to return the most relevant search results while minimizing computational overhead are provided. A dictionary is generated based upon words used in a specified number of previous most frequent search queries and comprises lists of transformations that may include variants based upon the stems of words, synonyms, and abbreviation expansions. When a query is received from a user, candidate queries are generated based upon replacing particular words in the query with a transformation of the particular words. Candidate queries are selected that have a high probability of returning relevant results by computing values of the query using language model scoring and translation scoring. The selected candidate queries and the original query are executed to return search results. The search results are displayed to the user with the words in the original query and the transformed words in bold.Type: GrantFiled: August 22, 2007Date of Patent: August 31, 2010Assignee: Yahoo! Inc.Inventors: Fuchun Peng, Nawaaz Ahmed, Yumao Lu, Marco J. Zagha
-
Patent number: 7769746Abstract: Computer-implemented methods and systems for processing user entered query data to improve results of a search of pages using a local search database are provided, when searching the internet. The method includes receiving the user entered query data and parsing each word of the query data and examining each word to determine if the word is associated with one of a business name, a city name or a state name. The examining uses probabilistic dictionaries to determine a likelihood that the word is for a particular term or intent. The method further includes normalizing each of the tagged business terms. The normalizing includes boosting information if found in the local search database and determining proximity between selected ones of the tagged terms. Then, generating an optimized internal search query that incorporates constraints and ranking based on at least the boosting information and the determined proximity between the selected tagged terms.Type: GrantFiled: January 16, 2008Date of Patent: August 3, 2010Assignee: Yahoo! Inc.Inventors: Yumao Lu, Nawaaz Ahmed, Fuchun Peng, Marco Zagha
-
Patent number: 7693865Abstract: To accurately classify a query as navigational, thousands of available features are explored, extracted from major commercial search engine results, user Web search click data, query log, and the whole Web's relational content. To obtain the most useful features for navigational query identification, a three level system is used which integrates feature generation, feature integration, and feature selection in a pipeline. Because feature selection plays a key role in classification methodologies, the best feature selection method is coupled with the best classification approach to achieve the best performance for identifying navigational queries. According to one embodiment, linear Support Vector Machine (SVM) is used to rank features and the top ranked features are fed into a Stochastic Gradient Boosting Tree (SGBT) classification method for identifying whether or not a particular query is a navigational query.Type: GrantFiled: August 30, 2006Date of Patent: April 6, 2010Assignee: Yahoo! Inc.Inventors: Yumao Lu, Fuchun Peng, Xin Li, Nawaaz Ahmed
-
Patent number: 7630978Abstract: Techniques for rewriting queries submitted to a query engine are provided. A query is submitted by a user and sent to a search mechanism. Based on the query, one or more query suggestions are generated. Features are generated based on the query and the query suggestions. Those features are input to a trained machine learning mechanism that generates a rewrite score. The rewrite score signifies a confidence score that indicates how confident the search mechanism is that the user intended to submit the original query. If the rewrite score is below a certain threshold, then the original query is rewritten to a second query. Results of executing the original query may be sent to the user along with a reference to the second query. Additionally or alternatively, results of executing the second query are sent to the user.Type: GrantFiled: December 14, 2006Date of Patent: December 8, 2009Assignee: Yahoo! Inc.Inventors: Xin Li, Nawaaz Ahmed, Fuchun Peng, Yumao Lu
-
Publication number: 20090248595Abstract: Computer-enabled methods, apparatus, and computer-readable media are provided for verifying that a given network name, such as a URL, is an official, e.g., registered, approved, or otherwise officially recognized, network name that refers to or identifies a principal, such as a business. These techniques involve receiving a principal name and a given network name, receiving at least one feature attribute from at least one database of feature attributes, wherein the at least one feature attribute comprises a characteristic of the principal name or a characteristic of the network name, and invoking a logistic regression method to generate a probability, based upon the at least one feature attribute, that the given network name is an official network name for the principal name. The logistic regression method may include a gradient boosting tree model that generates the probability based upon the at least one feature attribute.Type: ApplicationFiled: March 31, 2008Publication date: October 1, 2009Inventors: Yumao Lu, Nawaaz Ahmed, Fuchun Peng, Benoit Dumoulin
-
Publication number: 20090234836Abstract: Generally, a method and apparatus provides for search results in response to a web search request having at least two search terms in the search request. The method and apparatus includes generating a plurality of term groupings of the search terms and determining a relevance factor for each of the term groupings. The method and apparatus further determines a set of the term groupings based on the relevance factors and therein conducts a web resource search using the set of term groupings, to thereby generate search results. The method and apparatus provides the search results to the requesting entity.Type: ApplicationFiled: March 14, 2008Publication date: September 17, 2009Applicant: YAHOO! INC.Inventors: Fuchun Peng, Yumao Lu, Nawaaz Ahmed, Bin Tan
-
Publication number: 20090182729Abstract: Computer-implemented methods and systems for processing user entered query data to improve results of a search of pages using a local search database are provided, when searching the internet. The method includes receiving the user entered query data and parsing each word of the query data and examining each word to determine if the word is associated with one of a business name, a city name or a state name. The examining uses probabilistic dictionaries to determine a likelihood that the word is one of the business name, the city name or the state name. Then, associating the words that were determined to be: (i) the business name with a business name tag to create one or more tagged business terms; (ii) the city name with a city name tag to create one or more tagged city terms; and (iii) the state name with a state name tag to create one or more tagged state terms. The method further includes normalizing each of the tagged business terms, the tagged city terms and the tagged state terms.Type: ApplicationFiled: January 16, 2008Publication date: July 16, 2009Applicant: Yahoo!, Inc.Inventors: Yumao Lu, Nawaaz Ahmed, Fuchun Peng, Marco Zagha
-
Publication number: 20090132515Abstract: A method and apparatus for performing multi-phase ranking of web search results by re-ranking results using feature and label calibration are provided. According to one embodiment of the invention, a ranking function is trained by using machine learning techniques on a set of training samples to produce ranking scores. The ranking function is used to rank the set of training samples according to its ranking score, in order of its relevance to a particular query. Next, a re-ranking function is trained by the same training samples to re-rank the documents from the first ranking. The features and labels of the training samples are calibrated and normalized before they are reused to train the re-ranking function. By this method, training data and training features used in past trainings are leveraged to perform additional training of new functions, without requiring the use of additional training data or features.Type: ApplicationFiled: November 19, 2007Publication date: May 21, 2009Inventors: Yumao Lu, Fuchun Peng, Xin Li, Nawaaz Ahmed
-
Publication number: 20090055380Abstract: Techniques for determining when and how to transform words in a query to return the most relevant search results while minimizing computational overhead are provided. A dictionary is generated based upon words used in a specified number of previous most frequent search queries and comprises lists of transformations that may include variants based upon the stems of words, synonyms, and abbreviation expansions. When a query is received from a user, candidate queries are generated based upon replacing particular words in the query with a transformation of the particular words. Candidate queries are selected that have a high probability of returning relevant results by computing values of the query using language model scoring and translation scoring. The selected candidate queries and the original query are executed to return search results. The search results are displayed to the user with the words in the original query and the transformed words in bold.Type: ApplicationFiled: August 22, 2007Publication date: February 26, 2009Inventors: Fuchun PENG, Nawaaz Ahmed, Yumao Lu, Marco J. Zagha
-
Publication number: 20080189262Abstract: Techniques for determining when and how to transform words in a query to its plural or non-plural form in order to provide the most relevant search results while minimizing computational overhead are provided. A dictionary is generated based upon the words used in a specified number of previous most frequent search queries and comprises lists of transformations from plural to singular and singular to plural. Unnecessary transformations are removed from the dictionary based upon language modeling. The word to transform is determined by finding the last non-stop re-writable word of the query. The context of the transformed word is confirmed in the search documents and a version of the query is executed using both the original form of the word and the transformation of the word.Type: ApplicationFiled: February 1, 2007Publication date: August 7, 2008Inventors: Fuchun Peng, Nawaaz Ahmed, Xin Li, Yumao Lu
-
Publication number: 20080147637Abstract: Techniques for rewriting queries submitted to a query engine are provided. A query is submitted by a user and sent to a search mechanism. Based on the query, one or more query suggestions are generated. Features are generated based on the query and the query suggestions. Those features are input to a trained machine learning mechanism that generates a rewrite score. The rewrite score signifies a confidence score that indicates how confident the search mechanism is that the user intended to submit the original query. If the rewrite score is below a certain threshold, then the original query is rewritten to a second query. Results of executing the original query may be sent to the user along with a reference to the second query. Additionally or alternatively, results of executing the second query are sent to the user.Type: ApplicationFiled: December 14, 2006Publication date: June 19, 2008Inventors: Xin Li, Nawaaz Ahmed, Fuchun Peng, Yumao Lu
-
Publication number: 20080059508Abstract: To accurately classify a query as navigational, thousands of available features are explored, extracted from major commercial search engine results, user Web search click data, query log, and the whole Web's relational content. To obtain the most useful features for navigational query identification, a three level system is used which integrates feature generation, feature integration, and feature selection in a pipeline. Because feature selection plays a key role in classification methodologies, the best feature selection method is coupled with the best classification approach to achieve the best performance for identifying navigational queries. According to one embodiment, linear Support Vector Machine (SVM) is used to rank features and the top ranked features are fed into a Stochastic Gradient Boosting Tree (SGBT) classification method for identifying whether or not a particular query is a navigational query.Type: ApplicationFiled: August 30, 2006Publication date: March 6, 2008Inventors: Yumao Lu, Fuchun Peng, Xin Li, Nawaaz Ahmed
-
Publication number: 20070198484Abstract: A system and method for dynamically composing a class is provided. A query is parsed and a compiler object tree is generated that corresponds to the operators in the query. A set of feature requests and responses are initiated and a set of feature objects are generated that are executed at runtime. The language of the query may be extended by registering a new operator, and optionally a new feature for a query language, with a search engine without modifying the source code of the search engine. The new operator may be specified in a plug-in and provided to the search engine via the plug-in. An application converts an end user query into an application query that conforms to the query language supported by the search engine and includes the new operator. The application query may also include references to traditional programming constructs and search engine primitives.Type: ApplicationFiled: February 22, 2006Publication date: August 23, 2007Inventors: Nawaaz Ahmed, Robert Travis, Chad Walters
-
Patent number: 6357041Abstract: A framework for improving program performance by locality-enhancing transformations is presented. This framework is appropriate for modern high-performance machines that have a memory hierarchy. The invention orchestrates the flow of data through the memory hierarchy directly, and is thus able to overcome limitations of existing approaches. This new approach allows for efficient execution of imperfectly nested loop programs which are ubiquitous in numerical calculations and database operations, and it can be integrated into high-performance optimizing compilers.Type: GrantFiled: November 29, 1999Date of Patent: March 12, 2002Assignee: Cornell Research Foundation, Inc.Inventors: Keshav K. Pingali, Induprakas Kodukula, Nawaaz Ahmed