Patents by Inventor Kobi Reiter
Kobi Reiter 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: 9471682Abstract: Implementations generally relate to providing information associated with a profile owner to a target user in a social network system. In one implementation, a method includes receiving profile data associated with a profile owner. The method also includes receiving contact data associated with the profile owner, where the profile data and the contact data are provided by different users. The method also includes generating one or more views, where the one or more views include an interleaved view, and where the profile data and the contact data are displayed in an interleaved manner in a same section of the interleaved view.Type: GrantFiled: August 28, 2012Date of Patent: October 18, 2016Assignee: Google Inc.Inventors: Bryant Fong, Kobi Reiter, Nashant Atul Thakkar, Sean Edward Purcell, Corinna Hinke
-
Patent number: 8954864Abstract: Systems, methods and computer readable media for integrating a contact list with a social network are disclosed. Some implementations can include displaying a user interface that permits a user to add a profile linked to a contact to one or more selected groups of the social network. The user interface can then be updated to display the groups of the social network to which the profile has been added.Type: GrantFiled: September 13, 2012Date of Patent: February 10, 2015Assignee: Google Inc.Inventors: Nishant Atul Thakkar, Kobi Reiter, Sean Edward Purcell, Matthew Frederick Hillman, Corinna Hinke
-
Patent number: 8689117Abstract: Systems and techniques for generating a markup language document that has content to be conditionally display are disclosed. The markup language document includes JavaScript code and one or more comment tags indicating that content between the one or more comment tags is not to be processed for display by a client computer. The markup language document further defines a variable to hold a value. When the variable is a first value, at least one of the comment tags is ignored as a comment tag such that the content between the comment tags is processed for display. When the variable is a second value, the one or more comment tags are processed normally, such that the content between the comment tags is not displayed.Type: GrantFiled: October 30, 2009Date of Patent: April 1, 2014Assignee: Google Inc.Inventors: Kenneth Eric Vasilik, Kobi Reiter
-
Patent number: 8489385Abstract: A translation graph is created using a plurality of reference sources that include translations between a plurality of different languages. Each entry in a source is used to create a wordsense entry, and each new word in a source is used to create a wordnode entry. A pair of wordnode and wordsense entries corresponds to a translation. In addition, a probability is determined for each wordsense entry and is decreased for each translation entry that includes more than a predefined number of translations into the same language. Bilingual translation entries are removed if subsumed by a multilingual translation entry. Triangulation is employed to identify pairs of common wordsense translations between a first, second, and third language. Translations not found in reference sources can also be inferred from the data comprising the translation graph. The translation graph can then be used for searches of a data collection in different languages.Type: GrantFiled: June 25, 2012Date of Patent: July 16, 2013Assignee: University of WashingtonInventors: Oren Etzioni, Kobi Reiter, Marcus Sammer, Michael Schmitz, Stephen Soderland
-
Publication number: 20120271622Abstract: A translation graph is created using a plurality of reference sources that include translations between a plurality of different languages. Each entry in a source is used to create a wordsense entry, and each new word in a source is used to create a wordnode entry. A pair of wordnode and wordsense entries corresponds to a translation. In addition, a probability is determined for each wordsense entry and is decreased for each translation entry that includes more than a predefined number of translations into the same language. Bilingual translation entries are removed if subsumed by a multilingual translation entry. Triangulation is employed to identify pairs of common wordsense translations between a first, second, and third language. Translations not found in reference sources can also be inferred from the data comprising the translation graph. The translation graph can then be used for searches of a data collection in different languages.Type: ApplicationFiled: June 25, 2012Publication date: October 25, 2012Applicant: UNIVERSITY OF WASHINGTONInventors: Oren Etzioni, Kobi Reiter, Marcus Sammer, Michael Schmitz, Stephen Soderland
-
Patent number: 8209164Abstract: A translation graph is created using a plurality of reference sources that include translations between a plurality of different languages. Each entry in a source is used to create a wordsense entry, and each new word in a source is used to create a wordnode entry. A pair of wordnode and wordsense entries corresponds to a translation. In addition, a probability is determined for each wordsense entry and is decreased for each translation entry that includes more than a predefined number of translations into the same language. Bilingual translation entries are removed if subsumed by a multilingual translation entry. Triangulation is employed to identify pairs of common wordsense translations between a first, second, and third language. Translations not found in reference sources can also be inferred from the data comprising the translation graph. The translation graph can then be used for searches of a data collection in different languages.Type: GrantFiled: November 21, 2007Date of Patent: June 26, 2012Assignee: University of WashingtonInventors: Oren Etzioni, Kobi Reiter, Marcus Sammer, Michael Schmitz, Stephen Soderland
-
Publication number: 20090132233Abstract: A translation graph is created using a plurality of reference sources that include translations between a plurality of different languages. Each entry in a source is used to create a wordsense entry, and each new word in a source is used to create a wordnode entry. A pair of wordnode and wordsense entries corresponds to a translation. In addition, a probability is determined for each wordsense entry and is decreased for each translation entry that includes more than a predefined number of translations into the same language. Bilingual translation entries are removed if subsumed by a multilingual translation entry. Triangulation is employed to identify pairs of common wordsense translations between a first, second, and third language. Translations not found in reference sources can also be inferred from the data comprising the translation graph. The translation graph can then be used for searches of a data collection in different languages.Type: ApplicationFiled: November 21, 2007Publication date: May 21, 2009Applicant: University of WashingtonInventors: Oren Etzioni, Kobi Reiter, Marcus Sammer, Michael Schmitz, Stephen Soderland