Patents by Inventor Dmitry Korolev
Dmitry Korolev 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: 11429650Abstract: An example embodiment may involve a software application executable on a computing device of a computational instance of a remote network management platform associated with a managed network. The software application may receive, from a client device of the managed network, a natural language query, determine that a first term of the query does not match any term in a list of predetermined terms, and revise the query by (i) applying a set of linguistic rules that modify the first term to generate a replacement term, (ii) determining whether the replacement term matches at least one term in the list, and (iii) after determining that the replacement term matches at least one term in the list, replacing the first term in the query with the replacement term. The software application may then parse the revised query, search the database, and transmit a result to the client device.Type: GrantFiled: August 13, 2019Date of Patent: August 30, 2022Assignee: ServiceNow, Inc.Inventors: Aliaksei Vertsel, Dmitry Korolev, Mikhail Rumiantsau
-
Patent number: 11249992Abstract: An example embodiment may involve a software application executable on a computing device of a computational instance of a remote network management platform associated with a managed network. The computational instance may contain a database from which information associated with the managed network can be delivered to the client device. The software application may receive, from a client device of the managed network, a natural language query, parse the query using context-free grammar rules in Backus-Naur form (BNF), generate a search sentence based on the parsed query, search the database using the search sentence as a search query, and transmit, to the client device, a result of the search query. The context-free grammar rules may include an extended context-free grammar rule that defines a non-terminal symbol and comprises a Boolean NOT operator that eliminates one or more potential definitions of the non-terminal symbol from consideration when parsing the query.Type: GrantFiled: August 13, 2019Date of Patent: February 15, 2022Assignee: ServiceNow, Inc.Inventors: Aliaksei Vertsel, Dmitry Korolev, Mikhail Rumiantsau
-
Publication number: 20200097494Abstract: An example embodiment may involve a software application executable on a computing device of a computational instance of a remote network management platform associated with a managed network. The software application may receive, from a client device of the managed network, a natural language query, determine that a first term of the query does not match any term in a list of predetermined terms, and revise the query by (i) applying a set of linguistic rules that modify the first term to generate a replacement term, (ii) determining whether the replacement term matches at least one term in the list, and (iii) after determining that the replacement term matches at least one term in the list, replacing the first term in the query with the replacement term. The software application may then parse the revised query, search the database, and transmit a result to the client device.Type: ApplicationFiled: August 13, 2019Publication date: March 26, 2020Inventors: Aliaksei Vertsel, Dmitry Korolev, Mikhail Rumiantsau
-
Publication number: 20200097472Abstract: An example embodiment may involve a software application executable on a computing device of a computational instance of a remote network management platform associated with a managed network. The computational instance may contain a database from which information associated with the managed network can be delivered to the client device. The software application may receive, from a client device of the managed network, a natural language query, parse the query using context-free grammar rules in Backus-Naur form (BNF), generate a search sentence based on the parsed query, search the database using the search sentence as a search query, and transmit, to the client device, a result of the search query. The context-free grammar rules may include an extended context-free grammar rule that defines a non-terminal symbol and comprises a Boolean NOT operator that eliminates one or more potential definitions of the non-terminal symbol from consideration when parsing the query.Type: ApplicationFiled: August 13, 2019Publication date: March 26, 2020Inventors: Aliaksei Vertsel, Dmitry Korolev, Mikhail Rumiantsau
-
Publication number: 20180081992Abstract: Architecture that automatically determines relationships between vector spaces of disparate media types, and outputs ranker signals based on these relationships, all in a single process. The architecture improves search result relevance by simultaneously clustering queries and documents, and enables the training of a model for creating one or more ranker signals using simultaneous clustering of queries and documents in their respective spaces.Type: ApplicationFiled: November 30, 2017Publication date: March 22, 2018Inventors: Mikhail Parakhin, Dmitry Korolev, Alexey Poyarkov
-
Patent number: 9864817Abstract: Architecture that automatically determines relationships between vector spaces of disparate media types, and outputs ranker signals based on these relationships, all in a single process. The architecture improves search result relevance by simultaneously clustering queries and documents, and enables the training of a model for creating one or more ranker signals using simultaneous clustering of queries and documents in their respective spaces.Type: GrantFiled: January 28, 2012Date of Patent: January 9, 2018Assignee: Microsoft Technology Licensing, LLCInventors: Mikhail Parakhin, Dmitry Korolev, Alexey Poyarkov
-
Patent number: 9104972Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for classifying resources using scores from multiple classifiers. In general, one aspect of the subject matter described in this specification can be embodied in methods that include the actions of receiving identifying a collection of documents to classify; receiving a plurality of classifiers for scoring a document with respect to a specified property; for each document in the collection, applying each of the plurality of classifiers, each classifier generating a score associated with a likelihood that the document has the specified property, combining the scores from each classifier including applying a multiple classifier model that uses monotonic regression to combine the plurality of classifiers, and classifying the document as having the specified property based on the combined score.Type: GrantFiled: March 24, 2014Date of Patent: August 11, 2015Assignee: Google Inc.Inventors: Dmitry Korolev, Hartmut Maennel
-
Patent number: 8868402Abstract: Methods, systems, and apparatus, including computer program products, for constructing text classifiers. The method includes receiving a collection of candidate phrases for a given topic; filtering the received candidate phrases to remove erroneously included candidate phrases; assigning weights to the candidate phrases including scoring each candidate phrase using an initial classifier and assigning weights to the candidate phrases based on the scores; and generating a linear classifier using the filtered and weighted candidate phrases, where the linear classifier varies the weights for each phrase candidate depending on the length of the document being classified.Type: GrantFiled: December 30, 2009Date of Patent: October 21, 2014Assignee: Google Inc.Inventors: Dmitry Korolev, Hartmut Maennel, Matthias Heiler, Michael Schaer, Thomas Hofmann, Wojciech Gajewski, Justyna Sidorska
-
Patent number: 8713007Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for classifying resources using scores from multiple classifiers. In general, one aspect of the subject matter described in this specification can be embodied in methods that include the actions of receiving identifying a collection of documents to classify; receiving a plurality of classifiers for scoring a document with respect to a specified property; for each document in the collection, applying each of the plurality of classifiers, each classifier generating a score associated with a likelihood that the document has the specified property, combining the scores from each classifier including applying a multiple classifier model that uses monotonic regression to combine the plurality of classifiers, and classifying the document as having the specified property based on the combined score.Type: GrantFiled: March 13, 2009Date of Patent: April 29, 2014Assignee: Google Inc.Inventors: Dmitry Korolev, Hartmut Maennel
-
Publication number: 20130198186Abstract: Architecture that automatically determines relationships between vector spaces of disparate media types, and outputs ranker signals based on these relationships, all in a single process. The architecture improves search result relevance by simultaneously clustering queries and documents, and enables the training of a model for creating one or more ranker signals using simultaneous clustering of queries and documents in their respective spaces.Type: ApplicationFiled: January 28, 2012Publication date: August 1, 2013Applicant: MICROSOFT CORPORATIONInventors: Mikhail Parakhin, Dmitry Korolev, Alexey Poyarkov
-
Publication number: 20130138641Abstract: Methods, systems, and apparatus, including computer program products, for constructing text classifiers. The method includes receiving a collection of candidate phrases for a given topic; filtering the received candidate phrases to remove erroneously included candidate phrases; assigning weights to the candidate phrases including scoring each candidate phrase using an initial classifier and assigning weights to the candidate phrases based on the scores; and generating a linear classifier using the filtered and weighted candidate phrases, where the linear classifier varies the weights for each phrase candidate depending on the length of the document being classified.Type: ApplicationFiled: December 30, 2009Publication date: May 30, 2013Applicant: GOOGLE INC.Inventors: Dmitry Korolev, Hartmut Maennel, Matthias Heiler, Michael Schaer, Thomas Hofmann, Wojciech Gajewski, Justyna Sidorska