Patents by Inventor Kostas Tsioutsiouliklis
Kostas Tsioutsiouliklis 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: 10832008Abstract: Disclosed are systems and methods for improving interactions with and between computers in content searching, generating, hosting and/or providing systems supported by or configured with personal computing devices, servers and/or platforms. The disclosure provides a computerized framework for automatically generating chatbot responses to produce domain-specific responses that mimic native styles unique to particular domains. The disclosed systems and methods construct domain-specific word-graphs based on account activity from specific domains and generate word-patterns. New words obtained from the patterns in the graph are introduced to transform the regular response. The graph is then pruned using data-driven thresholds in order to avoid spurious transformations, and paragraph vectors are also utilized to assign relevance scores to generated patterns such that only the patterns that are contextually similar to the original response (generic/regular response) are used.Type: GrantFiled: December 12, 2018Date of Patent: November 10, 2020Assignee: OATH INC.Inventors: Siddhartha Banerjee, Prakhar Biyani, Kostas Tsioutsiouliklis
-
Patent number: 10783879Abstract: Methods, programming, and system for modifying a slot value are described herein. In a non-limiting embodiment, an intent may be determined based on a first utterance. A first slot-value pair may be obtained for the first utterance based on the intent, the first slot-value pair including a first slot and a first value associated with the first slot. A second value associated with the first slot may be identified, the second value being identified from a second utterance that was previously received. Based on the intent and the first slot, a type of update to be performed with respect to the second value may be determined. The second value may then be updated based on the first value and the type of update.Type: GrantFiled: February 22, 2018Date of Patent: September 22, 2020Assignee: Oath Inc.Inventors: Prakhar Biyani, Cem Akkaya, Kostas Tsioutsiouliklis
-
Publication number: 20200027034Abstract: The present teaching relates to method, system, and medium for generating training data for generating a relationship identification model. Sentences are received as input. Each of the sentences is aligned with a fact previously stored to create an alignment. Confidence scores for the alignments are computed and then used, together with the alignments to train a relationship identification model.Type: ApplicationFiled: July 20, 2018Publication date: January 23, 2020Inventors: Siddhartha Banerjee, Kostas Tsioutsiouliklis
-
Publication number: 20190258710Abstract: Methods, programming, and system for identifying one or more variable slots within an utterance are described herein. In a non-limiting embodiment, a first slot-value pair for an utterance may be obtained. The first slot-value pair may include a first slot and a first value associated with the slot. The first slot may be of a first entity type, where an intent and a data object are estimated based on the first utterance. A data structure representing the data object may be identified. Based on the intent, a first variable slot in the data structure associated with the first entity type may be determined, where the first variable slot may be associated with at least one of: multiple values and an adjustable value. Based on the intent, the first value may be assigned to the first variable slot in the data structure.Type: ApplicationFiled: February 22, 2018Publication date: August 22, 2019Inventors: Prakhar Biyani, Cem Akkaya, Kostas Tsioutsiouliklis
-
Publication number: 20190259380Abstract: Methods, programming, and system for modifying a slot value are described herein. In a non-limiting embodiment, an intent may be determined based on a first utterance. A first slot-value pair may be obtained for the first utterance based on the intent, the first slot-value pair including a first slot and a first value associated with the first slot. A second value associated with the first slot may be identified, the second value being identified from a second utterance that was previously received. Based on the intent and the first slot, a type of update to be performed with respect to the second value may be determined. The second value may then be updated based on the first value and the type of update.Type: ApplicationFiled: February 22, 2018Publication date: August 22, 2019Inventors: Prakhar Biyani, Cem Akkaya, Kostas Tsioutsiouliklis
-
Publication number: 20190121850Abstract: Disclosed are systems and methods for improving interactions with and between computers in content searching, generating, hosting and/or providing systems supported by or configured with personal computing devices, servers and/or platforms. The disclosure provides a computerized framework for automatically generating chatbot responses to produce domain-specific responses that mimic native styles unique to particular domains. The disclosed systems and methods construct domain-specific word-graphs based on account activity from specific domains and generate word-patterns. New words obtained from the patterns in the graph are introduced to transform the regular response. The graph is then pruned using data-driven thresholds in order to avoid spurious transformations, and paragraph vectors are also utilized to assign relevance scores to generated patterns such that only the patterns that are contextually similar to the original response (generic/regular response) are used.Type: ApplicationFiled: December 12, 2018Publication date: April 25, 2019Inventors: Siddhartha BANERJEE, Prakhar BIYANI, Kostas TSIOUTSIOULIKLIS
-
Patent number: 10162816Abstract: Disclosed are systems and methods for improving interactions with and between computers in content searching, generating, hosting and/or providing systems supported by or configured with personal computing devices, servers and/or platforms. The disclosure provides a computerized framework for automatically generating chatbot responses to produce domain-specific responses that mimic native styles unique to particular domains. The disclosed systems and methods construct domain-specific word-graphs based on account activity from specific domains and generate word-patterns. New words obtained from the patterns in the graph are introduced to transform the regular response. The graph is then pruned using data-driven thresholds in order to avoid spurious transformations, and paragraph vectors are also utilized to assign relevance scores to generated patterns such that only the patterns that are contextually similar to the original response (generic/regular response) are used.Type: GrantFiled: June 15, 2017Date of Patent: December 25, 2018Assignee: OATH INC.Inventors: Siddhartha Banerjee, Prakhar Biyani, Kostas Tsioutsiouliklis
-
Publication number: 20180365212Abstract: Disclosed are systems and methods for improving interactions with and between computers in content searching, generating, hosting and/or providing systems supported by or configured with personal computing devices, servers and/or platforms. The disclosure provides a computerized framework for automatically generating chatbot responses to produce domain-specific responses that mimic native styles unique to particular domains. The disclosed systems and methods construct domain-specific word-graphs based on account activity from specific domains and generate word-patterns. New words obtained from the patterns in the graph are introduced to transform the regular response. The graph is then pruned using data-driven thresholds in order to avoid spurious transformations, and paragraph vectors are also utilized to assign relevance scores to generated patterns such that only the patterns that are contextually similar to the original response (generic/regular response) are used.Type: ApplicationFiled: June 15, 2017Publication date: December 20, 2018Inventors: Siddhartha BANERJEE, Prakhar BIYANI, Kostas TSIOUTSIOULIKLIS
-
Publication number: 20170193074Abstract: Software generates an article signature for each article in a plurality of articles. The software initializes a clustering algorithm with a plurality of initial clusters that are non-overlapping. A centroid signature is generated for each initial cluster from the article signatures of the articles in the initial cluster. The software performs a succession of alternating merges and splits using the centroid signatures to create a plurality of non-overlapping coherent clusters from the plurality of initial clusters. The software identifies an article that is related to a specific article by mapping the article signature for the specific article to the centroid signature for at least one coherent cluster and comparing that article signature to the article signatures of the articles in the coherent cluster, using at least one similarity measure. The software displays the specific article and the related article in proximity to each other in a content stream.Type: ApplicationFiled: December 30, 2015Publication date: July 6, 2017Inventors: Sainath Vellal, Kostas Tsioutsiouliklis
-
Patent number: 8849775Abstract: A system and method is described herein that cache web documents in two or more caches in an optimized manner. The web documents result from a plurality of queries presented to a web search engine. Each web document has a tier score indicating a position of the web document in the caches. The tier scores are modified in a manner that rearranges the web documents in caches. This rearrangement of the web documents in the caches can advantageously improve the retrieval time for the web documents.Type: GrantFiled: December 15, 2010Date of Patent: September 30, 2014Assignee: Yahoo! Inc.Inventors: Alexander Smola, Kostas Tsioutsiouliklis, Novi Quadrianto, Gilbert Leung
-
Patent number: 8543406Abstract: Disclosed is a method and system for interacting with an IVR system. In one aspect, a computing device receives a user request to connect to an IVR system to perform an action. A request for information (e.g., a request to select from a plurality of menu options) is obtained from the IVR system. In response to the request, the computing device automatically supplies an answer to the request for information to the IVR system. In one embodiment, the answer is a dual-tone multi-frequency (DTMF) signal. The obtaining and supplying steps are repeated until the action has been performed.Type: GrantFiled: January 22, 2009Date of Patent: September 24, 2013Assignee: Yahoo! Inc.Inventors: Su-Lin Wu, Kostas Tsioutsiouliklis, Arkady Borkovsky
-
Patent number: 8290986Abstract: Techniques are provided for generating quality measures for items, including web pages, based on a “random searcher” behavior model. The random searcher behavior model takes into account “implicit” links between items, instead of or in addition to the explicit links. After identifying the implicit links between items, the implicit links may be used as the basis for generating quality measures for the items to which the implicit links point. A variety of types of implicit links are described. To facilitate the generation of quality measures for items based on implicit links, a graph of the implicit links may be constructed in a manner similar to a webgraph.Type: GrantFiled: June 27, 2007Date of Patent: October 16, 2012Assignee: Yahoo! Inc.Inventors: Alexandrin Popescul, Clifford A. Brunk, Nadav A. Zimak, Kostas Tsioutsiouliklis
-
Publication number: 20120158740Abstract: A system and method is described herein that cache web documents in two or more caches in an optimized manner. The web documents result from a plurality of queries presented to a web search engine. Each web document has a tier score indicating a position of the web document in the caches. The tier scores are modified in a manner that rearranges the web documents in caches. This rearrangement of the web documents in the caches can advantageously improve the retrieval time for the web documents.Type: ApplicationFiled: December 15, 2010Publication date: June 21, 2012Applicant: YAHOO! INC.Inventors: Alexander Smola, Kostas Tsioutsiouliklis, Novi Quadrianto, Gilbert Leung
-
Patent number: 7974970Abstract: A system for detecting artificial promotion of a resource, including a search engine operative to index a set incoming links (“inlinks”) which reference the resource, a log module coupled with the search engine and configured to store log data associated with the set of inlinks, a partitioning module coupled with log module and operative to partition the set of inlinks into a plurality of groups of inlinks based on at least one partitioning scheme, a statistics module coupled with the partitioning module and operative to compute a statistic associated with the inlinks within each of the plurality of groups of inlinks, and a computation module coupled with the statistics module and operative to process the computed statistic associated with the inlinks of each of the plurality of groups of inlinks and compute a metric associated with set of inlinks where the metric indicates a level of uniformity of a distribution of values of the respective computed statistics among the plurality of groups of inlinks, and wheType: GrantFiled: October 9, 2008Date of Patent: July 5, 2011Assignee: Yahoo! Inc.Inventors: Gilbert Leung, Lei Duan, Dmitri Pavlovski, Su Han Chan, Kostas Tsioutsiouliklis
-
Patent number: 7966341Abstract: Techniques are provided maintaining data that indicates for a plurality of query terms whether the plurality of query terms are date-qualified query terms. A query is received, and in response to receiving the query, the query is inspected to determine that the query contains a particular date-qualified query term. Then it is determined that the particular date-qualified query term has been associated with a plurality of dates, and it is determined which of the plurality of dates with which to associate the date-qualified query term for the query, based at least in part on the frequency with which each particular date of the plurality of dates has been associated with the particular date-qualified query term.Type: GrantFiled: August 6, 2007Date of Patent: June 21, 2011Assignee: Yahoo! Inc.Inventors: Farzin Maghoul, Kostas Tsioutsiouliklis
-
Publication number: 20100287129Abstract: Embodiments of methods, apparatuses, devices and systems associated with categorizing or selecting potential search engine results are disclosed.Type: ApplicationFiled: May 7, 2009Publication date: November 11, 2010Applicant: Yahoo!, Inc., a Delaware corporationInventors: Kostas Tsioutsiouliklis, Su Han Chan, Sean Suchter, Andrew Tomkins, Arnab Bhattacharjee, Dmitri Pavlovski
-
Publication number: 20100185449Abstract: Disclosed is a method and system for interacting with an IVR system. In one aspect, a computing device receives a user request to connect to an IVR system to perform an action. A request for information (e.g., a request to select from a plurality of menu options) is obtained from the IVR system. In response to the request, the computing device automatically supplies an answer to the request for information to the IVR system. In one embodiment, the answer is a dual-tone multi-frequency (DTMF) signal. The obtaining and supplying steps are repeated until the action has been performed.Type: ApplicationFiled: January 22, 2009Publication date: July 22, 2010Applicant: Yahoo! Inc.Inventors: Su-Lin Wu, Kostas Tsioutsiouliklis, Arkady Borkovsky
-
Publication number: 20100094868Abstract: A system for detecting artificial promotion of a resource, including a search engine operative to index a set incoming links (“inlinks”) which reference the resource, a log module coupled with the search engine and configured to store log data associated with the set of inlinks, a partitioning module coupled with log module and operative to partition the set of inlinks into a plurality of groups of inlinks based on at least one partitioning scheme, a statistics module coupled with the partitioning module and operative to compute a statistic associated with the inlinks within each of the plurality of groups of inlinks, and a computation module coupled with the statistics module and operative to process the computed statistic associated with the inlinks of each of the plurality of groups of inlinks and compute a metric associated with set of inlinks where the metric indicates a level of uniformity of a distribution of values of the respective computed statistics among the plurality of groups of inlinks, and wheType: ApplicationFiled: October 9, 2008Publication date: April 15, 2010Applicant: Yahoo! Inc.Inventors: Gilbert Leung, Lei Duan, Dmitri Pavlovski, Su Han Chan, Kostas Tsioutsiouliklis
-
Publication number: 20090043749Abstract: Techniques are provided for storing queries received by a search engine are in a query log. For a particular query term in the query, it is determined how many queries in the query log contain that particular query term and an intent-indicating term, and determined how many queries in the query log contain that particular query term without an intent-indicating term. Based on the ratio between the number of queries in the query log that contain the particular query term and the intent-indicating term and the number of queries in the query log that contain the particular query term without the intent-indicating term, it is determined whether the particular query term is an intent-qualified query term. In response to determining that the particular query term is an intent-qualified query term, data is stored in a computer-readable medium that identifies the query term as an intent-qualified query term.Type: ApplicationFiled: August 6, 2007Publication date: February 12, 2009Inventors: Priyank S. Garg, Kostas Tsioutsiouliklis, Bruce T. Smith, Timothy M. Converse
-
Publication number: 20090043748Abstract: Techniques are provided maintaining data that indicates for a plurality of query terms whether the plurality of query terms are date-qualified query terms. A query is received, and in response to receiving the query, the query is inspected to determine that the query contains a particular date-qualified query term. Then it is determined that the particular date-qualified query term has been associated with a plurality of dates, and it is determined which of the plurality of dates with which to associate the date-qualified query term for the query, based at least in part on the frequency with which each particular date of the plurality of dates has been associated with the particular date-qualified query term.Type: ApplicationFiled: August 6, 2007Publication date: February 12, 2009Inventors: Farzin Maghoul, Kostas Tsioutsiouliklis