Patents by Inventor Daniel Bernhardt

Daniel Bernhardt 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: 10783150
    Abstract: Systems, methods, and non-transitory computer-readable media can receive a social network post associated with a poster. The social network post is analyzed, and one or more potential viewers are ranked based on viewer ranking criteria. A predicted relevant audience is determined based on the ranking of the one or more potential viewers.
    Type: Grant
    Filed: December 28, 2015
    Date of Patent: September 22, 2020
    Assignee: Facebook, Inc.
    Inventor: Daniel Bernhardt
  • Patent number: 10535081
    Abstract: This disclosure generally covers systems and methods that schedule posts of one or more images, videos, or other digital content items through an account of a social networking system in a way that optimizes user engagement. In particular, certain embodiments of the disclosed systems and methods determine when to post digital content items by calculating data-driven user engagement scores and updating those scores with data tracked by the social networking system.
    Type: Grant
    Filed: December 20, 2016
    Date of Patent: January 14, 2020
    Assignee: Facebook, Inc.
    Inventors: Rui Andre Augusto Ferreira, Daniel Bernhardt, Victor Lassance Oliveira E Silva, Ian Douglas Hegerty
  • Patent number: 10303731
    Abstract: In one embodiment, a method includes, receiving, from a client system of a user, a search query including n-grams. The method includes associating each n-gram with verticals based on an analysis of the n-grams by language models. The method includes determining, for each n-gram, if a bloom filter for a vertical associated with the n-gram indicates, based on sub-bloom filters of the bloom filter, the n-gram does exist or does not exist in a set of object names associated with the vertical. Each sub-bloom filter is associated with a subset of the set of object names and indicates the n-gram does exist or does not exist in its subset of object names. The method includes sending, to the client system, an indication that an n-gram of the n-grams is misspelled if a bloom filter indicates the n-gram does not exist in the set of object names associated with the vertical.
    Type: Grant
    Filed: May 1, 2017
    Date of Patent: May 28, 2019
    Assignee: Facebook, Inc.
    Inventors: Ian Douglas Hegerty, Daniel Bernhardt, Feng Liang, Agnieszka Anna Podsiadlo
  • Publication number: 20190079854
    Abstract: A computer-implemented method for executing tests may include (i) identifying a debugger that enables a developer to execute a test version of an application while collecting debug data about an execution of the test version of the application, (ii) retrieving, from a test configuration repository, a test configured to specify at least one predefined input and at least one expected output for the test version of the application, (iii) initiating an execution, via the debugger, of the test version of the application with the predefined input from the test retrieved from the test configuration repository, and (iv) determining, based on data collected by the debugger during the execution of the test version of the application with the predefined input, whether the execution of the test version of the application produced the expected output. Various other methods, systems, and computer-readable media are also disclosed.
    Type: Application
    Filed: September 12, 2017
    Publication date: March 14, 2019
    Inventors: Victor Lassance Oliveira E Silva, Ian Douglas Hegerty, Daniel Bernhardt, Luka Sterbic, Shival Vashisht Maharaj
  • Publication number: 20190057154
    Abstract: In one embodiment, a method includes receiving a search query, searching a reverse index to identify one or more objects having one or more tokens that match the search query, and accessing a forward index that has several records that each correspond to an object posted to an online social network. Each record may comprise a first field of tokens, and one or more second fields corresponding to metadata associated with each of the tokens. The method may further include scoring each identified object based on its respective record. The score for each identified object may be calculated based on the metadata associated with each of the tokens. The method may also include sending, to the client system in response to the received search query, instructions for presenting one or more search results corresponding to the identified objects having a score greater than a threshold score.
    Type: Application
    Filed: August 17, 2017
    Publication date: February 21, 2019
    Inventors: Rose Marie Philip, Giuseppe Ottaviano, Daniel Bernhardt
  • Patent number: 10095683
    Abstract: In one embodiment, a method includes receiving a search query including one or more n-grams, determining for each n-gram if a contextual speller model indicates the n-gram is misspelled, identifying for each misspelled n-gram one or more variant-tokens based at least on the search query and a contextual speller model, generating one or more unique combinations of the n-grams and variant-tokens, where each unique combination includes a variant-token corresponding to each misspelled n-gram, calculating a relevance-score for each unique combination based at least in part on the search query and the contextual speller model, generating one or more corrected queries, where each corrected query includes a unique combination having a relevance-score greater than a threshold relevance-score, and sending one or more of the corrected queries to a user for display.
    Type: Grant
    Filed: April 10, 2015
    Date of Patent: October 9, 2018
    Assignee: Facebook, Inc.
    Inventors: Ian Douglas Hegerty, Daniel Bernhardt, Marcus Holland-Moritz, Rafal Krzysztof Sadziak
  • Patent number: 10049099
    Abstract: In one embodiment, a method includes receiving a search query including one or more n-grams, where the n-grams include one or more misspelled n-grams, identifying one or more variant-tokens for each misspelled n-gram, calculating a feature value for each identified variant-token based at least on the identified variant-token, the misspelled n-gram, and one or more variant-tokens corresponding to one or more n-grams preceding the misspelled n-gram, generating one or more unique combinations of the n-grams and variant-tokens, calculating a sequence-score for each unique combination based at least in part on the calculated feature values of the variant-tokens of the unique combination, generating one or more corrected queries, where each corrected query includes a unique combination having a sequence-score greater than a threshold sequence-score, and sending one or more of the corrected queries to a user for display.
    Type: Grant
    Filed: April 10, 2015
    Date of Patent: August 14, 2018
    Assignee: Facebook, Inc.
    Inventors: Hongcheng Zhu, Daniel Bernhardt
  • Publication number: 20180174190
    Abstract: This disclosure generally covers systems and methods that schedule posts of one or more images, videos, or other digital content items through an account of a social networking system in a way that optimizes user engagement. In particular, certain embodiments of the disclosed systems and methods determine when to post digital content items by calculating data-driven user engagement scores and updating those scores with data tracked by the social networking system.
    Type: Application
    Filed: December 20, 2016
    Publication date: June 21, 2018
    Inventors: Rui Andre Augusto Ferreira, Daniel Bernhardt, Victor Lassance Oliveira E Silva, Ian Douglas Hegerty
  • Patent number: 9842149
    Abstract: One or more techniques and/or systems are provided for populating and/or animating a spatial visualization, such as a map, a timeline, and/or other 2D and/or 3D visual representations of locations. The spatial visualization may be populated with events extracted from a data source (e.g., real-time events, news events, social network events, etc.), and may include relationships between events (e.g., based upon time, location, contextual similarity (e.g., social network check-in events at a restaurant), events referencing one another (e.g., an article describing a first event may comprise a hyperlink to an article describing a second event) etc.). Filter criteria (e.g., date, event type, location, etc.) may be applied to events and/or relationships when populating the spatial visualization. A sequence of events and corresponding relationships may be animated within the spatial visualization (e.g., as the events unfold over a (user) designated period of time).
    Type: Grant
    Filed: March 30, 2015
    Date of Patent: December 12, 2017
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Daniel Bernhardt, Michael Kaisser, Antonino Gulli
  • Patent number: 9798786
    Abstract: One or more techniques and/or systems are provided for populating and/or animating a spatial visualization, such as a map, a timeline, and/or other 2D and/or 3D visual representations of locations. The spatial visualization may be populated with events extracted from a data source (e.g., real-time events, news events, social network events, etc.), and may include relationships between events (e.g., based upon time, location, contextual similarity (e.g., social network check-in events at a restaurant), events referencing one another (e.g., an article describing a first event may comprise a hyperlink to an article describing a second event) etc.). Filter criteria (e.g., date, event type, location, etc.) may be applied to events and/or relationships when populating the spatial visualization. A sequence of events and corresponding relationships may be animated within the spatial visualization (e.g., as the events unfold over a (user) designated period of time).
    Type: Grant
    Filed: March 30, 2015
    Date of Patent: October 24, 2017
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Daniel Bernhardt, Michael Kaisser, Antonino Gulli
  • Publication number: 20170235842
    Abstract: In one embodiment, a method includes, receiving, from a client system of a user, a search query including n-grams. The method includes associating each n-gram with verticals based on an analysis of the n-grams by language models. The method includes determining, for each n-gram, if a bloom filter for a vertical associated with the n-gram indicates, based on sub-bloom filters of the bloom filter, the n-gram does exist or does not exist in a set of object names associated with the vertical. Each sub-bloom filter is associated with a subset of the set of object names and indicates the n-gram does exist or does not exist in its subset of object names. The method includes sending, to the client system, an indication that an n-gram of the n-grams is misspelled if a bloom filter indicates the n-gram does not exist in the set of object names associated with the vertical.
    Type: Application
    Filed: May 1, 2017
    Publication date: August 17, 2017
    Inventors: Ian Douglas Hegerty, Daniel Bernhardt, Feng Liang, Agnieszka Anna Podsiadlo
  • Publication number: 20170185903
    Abstract: Systems, methods, and non-transitory computer-readable media can receive a social network post associated with a poster. The social network post is analyzed, and one or more potential viewers are ranked based on viewer ranking criteria. A predicted relevant audience is determined based on the ranking of the one or more potential viewers.
    Type: Application
    Filed: December 28, 2015
    Publication date: June 29, 2017
    Inventor: Daniel Bernhardt
  • Patent number: 9679024
    Abstract: In one embodiment, a method includes receiving a search query, determining if a bloom filter indicates an n-gram of the query does not exist in a set of object names associated with a vertical, identifying variant-tokens for each n-gram that does not exist in the set of object names, generating unique combinations of the n-grams and variant-tokens, where each unique combination includes a variant-token corresponding to each n-gram that does not exist in the set of object names for the n-gram, calculating a confidence score for each unique combination based at least in part on the search query and whether the unique combination exists in the set of object names, identifying objects matching each unique combination, where the unique combination has a confidence score greater than a threshold confidence score, and sending a search-results page responsive to the search query to the client device of the user.
    Type: Grant
    Filed: December 1, 2014
    Date of Patent: June 13, 2017
    Assignee: Facebook, Inc.
    Inventors: Ian Douglas Hegerty, Daniel Bernhardt, Feng Liang, Agnieszka Anna Podsiadlo
  • Patent number: 9529823
    Abstract: Architecture that provides fully automatic generation of a geo-ontology and does not use pre-existing geo-ontologies or other location entity repositories (e.g., a licensed location). The architecture extracts the formal administrative structure of a geographical region of interest (e.g., country) (a geo-ontology of locations with attributes and relations) from a collection of entities with spatial attributes, extracts the informal administrative structure of a geographical region of interest (e.g., country) (informal administrative regions and names and informal neighborhoods and their attributes), and extracts location static rank features for all these entities (attributes used for ranking locations from the geo-ontology that appear in user queries).
    Type: Grant
    Filed: September 7, 2011
    Date of Patent: December 27, 2016
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Daniel Voinea, Tomasz A. Marciniak, Daniel Bernhardt, Xavier Sloane Dupre, Ian Hegerty
  • Publication number: 20160299882
    Abstract: In one embodiment, a method includes receiving a search query including one or more n-grams, determining for each n-gram if a contextual speller model indicates the n-gram is misspelled, identifying for each misspelled n-gram one or more variant-tokens based at least on the search query and a contextual speller model, generating one or more unique combinations of the n-grams and variant-tokens, where each unique combination includes a variant-token corresponding to each misspelled n-gram, calculating a relevance-score for each unique combination based at least in part on the search query and the contextual speller model, generating one or more corrected queries, where each corrected query includes a unique combination having a relevance-score greater than a threshold relevance-score, and sending one or more of the corrected queries to a user for display.
    Type: Application
    Filed: April 10, 2015
    Publication date: October 13, 2016
    Inventors: Ian Douglas Hegerty, Daniel Bernhardt, Marcus Holland-Moritz, Rafal Krzysztof Sadziak
  • Publication number: 20160299883
    Abstract: In one embodiment, a method includes receiving a search query including one or more n-grams, where the n-grams include one or more misspelled n-grams, identifying one or more variant-tokens for each misspelled n-gram, calculating a feature value for each identified variant-token based at least on the identified variant-token, the misspelled n-gram, and one or more variant-tokens corresponding to one or more n-grams preceding the misspelled n-gram, generating one or more unique combinations of the n-grams and variant-tokens, calculating a sequence-score for each unique combination based at least in part on the calculated feature values of the variant-tokens of the unique combination, generating one or more corrected queries, where each corrected query includes a unique combination having a sequence-score greater than a threshold sequence-score, and sending one or more of the corrected queries to a user for display.
    Type: Application
    Filed: April 10, 2015
    Publication date: October 13, 2016
    Inventors: Hongcheng Zhu, Daniel Bernhardt
  • Publication number: 20160154861
    Abstract: In one embodiment, a method includes receiving a search query, determining if a bloom filter indicates an n-gram of the query does not exist in a set of object names associated with a vertical, identifying variant-tokens for each n-gram that does not exist in the set of object names, generating unique combinations of the n-grams and variant-tokens, where each unique combination includes a variant-token corresponding to each n-gram that does not exist in the set of object names for the n-gram, calculating a confidence score for each unique combination based at least in part on the search query and whether the unique combination exists in the set of object names, identifying objects matching each unique combination, where the unique combination has a confidence score greater than a threshold confidence score, and sending a search-results page responsive to the search query to the client device of the user.
    Type: Application
    Filed: December 1, 2014
    Publication date: June 2, 2016
    Inventors: Ian Douglas Hegerty, Daniel Bernhardt, Feng Liang, Agnieszka Anna Podsiadlo
  • Publication number: 20150205843
    Abstract: One or more techniques and/or systems are provided for populating and/or animating a spatial visualization, such as a map, a timeline, and/or other 2D and/or 3D visual representations of locations. The spatial visualization may be populated with events extracted from a data source (e.g., real-time events, news events, social network events, etc.), and may include relationships between events (e.g., based upon time, location, contextual similarity (e.g., social network check-in events at a restaurant), events referencing one another (e.g., an article describing a first event may comprise a hyperlink to an article describing a second event) etc.). Filter criteria (e.g., date, event type, location, etc.) may be applied to events and/or relationships when populating the spatial visualization. A sequence of events and corresponding relationships may be animated within the spatial visualization (e.g., as the events unfold over a (user) designated period of time).
    Type: Application
    Filed: March 30, 2015
    Publication date: July 23, 2015
    Inventors: Daniel Bernhardt, Michael Kaisser, Antonino Gulli
  • Patent number: 9009159
    Abstract: One or more techniques and/or systems are provided for populating and/or animating a spatial visualization, such as a map, a timeline, and/or other 2D and/or 3D visual representations of locations. The spatial visualization may be populated with events extracted from a data source (e.g., real-time events, news events, social network events, etc.), and may include relationships between events (e.g., based upon time, location, contextual similarity (e.g., social network check-in events at a restaurant), events referencing one another (e.g., an article describing a first event may comprise a hyperlink to an article describing a second event) etc.). Filter criteria (e.g., date, event type, location, etc.) may be applied to events and/or relationships when populating the spatial visualization. A sequence of events and corresponding relationships may be animated within the spatial visualization (e.g., as the events unfold over a (user) designated period of time).
    Type: Grant
    Filed: January 23, 2012
    Date of Patent: April 14, 2015
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Daniel Bernhardt, Michael Kaisser, Antonino Gulli
  • Publication number: 20140359519
    Abstract: Various embodiments provide a web platform, e.g., a web browser, which is designed to facilitate user access to websites in a quick and efficient manner. The web platform includes an address bar and, as keystrokes are entered into the address bar, a user interface container is populated with relevant suggestions from a combination of various data sources based on matching character input. Data sources can include a user's browsing history, favorites, and domain suggestions from a remote source, such as a service provider.
    Type: Application
    Filed: May 31, 2013
    Publication date: December 4, 2014
    Applicant: Microsoft Corporation
    Inventors: Kevin Y. Luu, Sean Lyndersay, Alexandra M. Feldman, Martin J. Hall, Zachary J. Shallcross, Anthony G. Amatino, Daniel Bernhardt, Ambarish Chitnis, Robert E. Kolba, JR., John B. Bravenec, Jatinder Singh Mann, Swathi Ganapathi