Tracy Vernell King

US Patent:

7313515, Dec 25, 2007

Filed:

May 1, 2006

Appl. No.:

11/415609

Inventors:

Richard S. Crouch - Cupertino CA, US
Tracy Holloway King - Mountain View CA, US

Assignee:

Palo Alto Research Center Incorporated - Palo Alto CA

International Classification:

G06F 17/27

US Classification:

704 9

Abstract:

Techniques are provided for detecting entailment and contradiction. Packed knowledge representations for a premise and conclusion text are determined comprising facts about the relationships between concept and/or context denoting terms. Concept and context alignments are performed based on alignments scores. A union is determined. Terms are marked as to their origin and conclusion text terms replaced with by corresponding terms from the premise text. Subsumption and specificity, instantiability, spatio-temporal and relationship based packed rewrite rules are applied in conjunction with the context denoting facts to remove entailed terms and to mark contradictory facts within the union. Entailment is indicated by a lack of any facts from the packed knowledge representation of the conclusion in the union. Entailment and contradiction markers are then displayed.

US Patent:

8271483, Sep 18, 2012

Filed:

Sep 10, 2008

Appl. No.:

12/208091

Inventors:

Jessica N. Staddon - Redwood City CA, US
Richard Chow - Sunnyvale CA, US
Valeria de Paiva - Cupertino CA, US
Philippe J. P. Golle - San Francisco CA, US
Ji Fang - Mountain View CA, US
Tracy Holloway King - Mountain View CA, US

Assignee:

Palo Alto Research Center Incorporated - Palo Alto CA

International Classification:

G06F 17/30

US Classification:

707730, 707706, 707707, 707727, 707728, 707736

Abstract:

One embodiment of the present invention provides a system that detects sensitive content in a document. In doing so, the system receives a document, identifies a set of terms in the document that are candidate sensitive terms, and generates a combination of terms based on the identified terms that is associated with a semantic meaning. Next, the system performs searches through a corpus based on the combination of terms and determines hit counts returned for each term in the combination and for the combination. The system then determines whether the combination of terms is sensitive based on the hit count for the combination and the hit counts for the individual terms in the combination, and generates a result that indicates portions of the document which contain sensitive combinations.

US Patent:

8402542, Mar 19, 2013

Filed:

Aug 24, 2009

Appl. No.:

12/546493

Inventors:

Tracy H. King - Mountain View CA, US
Philippe J. P. Golle - San Francisco CA, US
Jessica N. Staddon - Redwood City CA, US

Assignee:

Palo Alto Research Center Incorporated - Palo Alto CA

International Classification:

H04L 29/06

US Classification:

726 23

Abstract:

One embodiment provides a system that detects sensitive passages. During operation, the system receives a document and disassembles the document into a plurality of passages. For a respective passage, the system performs a search through a non-sensitive-passage database to determine whether the passage is a known non-sensitive passage. If so, the system marks the passage as non-sensitive, and if not, the system determines whether the passage triggers a cut-and-paste attack detection. If so, the system forwards the passage to an administrator and allows the administrator to determine whether the passage is non-sensitive and, further, to add the passage to the non-sensitive-passage database responsive to the administrator determining the passage to be non-sensitive.

US Patent:

20040230415, Nov 18, 2004

Filed:

May 12, 2003

Appl. No.:

10/435036

Inventors:

Stefan Riezler - San Francisco CA, US
Richard Crouch - Cupertino CA, US
Tracy King - Mountain View CA, US
Annie Zaenen - Redwood City CA, US
Alexander Vasserman - Malden MA, US

International Classification:

G06F017/28

US Classification:

704/005000

Abstract:

Techniques are provided for determining grammatical condensed text structures. Packed structures are determined for text structures based on a parsing grammar. Reduced packed structures are determined by applying transformation rules to packed and/or unpacked elements of the packed structures. A disambiguation model is applied to the reduced packed structure to determine candidate structures. A grammatically correct generation grammar is applied to the candidate structures to determine grammatical condensed text structures.

US Patent:

20090077027, Mar 19, 2009

Filed:

Sep 18, 2007

Appl. No.:

11/856874

Inventors:

Tracy Holloway King - Mountain View CA, US
Kurt E. Partridge - Palo Alto CA, US
Nicolas Ducheneaut - Sunnyvale CA, US
Ji Fang - Mountain View CA, US

Assignee:

PALO ALTO RESEARCH CENTER INCORPORATED - Palo Alto CA

International Classification:

G06F 17/30

US Classification:

707 3, 707E17108

Abstract:

Some embodiments of the present invention provide a system that infers activity-related context information from a message. Upon receiving the message, the system looks for activity-related keywords in the message, wherein the activity-related keywords are from a content database. If one or more activity-related keywords are found in the message, the system infers message-related context information from the one or more activity-related keywords. Next, the system uses the message-related context information to facilitate recommending an activity to a user.

US Patent:

20090187467, Jul 23, 2009

Filed:

Jan 23, 2008

Appl. No.:

12/018511

Inventors:

Ji Fang - Mountain View CA, US
Victoria M.E. Bellotti - San Francisco CA, US
Daniel G. Bobrow - Palo Alto CA, US
Tracy Holloway King - Mountain View CA, US

Assignee:

PALO ALTO RESEARCH CENTER INCORPORATED - Palo Alto CA

International Classification:

G06Q 99/00
G06F 12/00
G06F 17/30

US Classification:

705 10, 705 1, 707100, 707206, 707E17005

Abstract:

One embodiment of the present invention provides a system that recommends activities. During operation, the system receives a piece of content obtained from text or converted to text from speech. The system then analyzes the received content to identify any activity type, indication of willingness to participate in any type of activities, and at least one piece of temporal information, which can be implicitly and/or explicitly stated in the content, and/or one piece of location information associated with the activity type. The system further recommends one or more activities, venues, and/or services that afford or support activities for a user based on the information extracted from the content.

US Patent:

20110282651, Nov 17, 2011

Filed:

May 11, 2010

Appl. No.:

12/777323

Inventors:

VALERIE ROSE NYGAARD - SAN FRANCISCO CA, US
RICCARDO TURCHETTO - SAN FRANCISCO CA, US
JOANNA MUN YEE CHAN - REDWOOD CITY CA, US
CHRISTIAN BIEMANN - SAN FRANCISCO CA, US
DAVID DONGJAH AHN - SAN FRANCISCO CA, US
ANDREA RYERSON BURBANK - SAN FRANCISCO CA, US
FENG PAN - FOSTER CITY CA, US
TIMOTHY MCDONNELL CONVERSE - SAN FRANCISCO CA, US
JAMES MICHAEL REINHOLD - BERKELEY CA, US
TRACY HOLLOWAY KING - MOUNTAIN VIEW CA, US

Assignee:

MICROSOFT CORPORATION - REDMOND WA

International Classification:

G06F 17/27

US Classification:

704 9

Abstract:

Systems, methods, and computer storage media having computer-executable instructions embodied thereon that facilitate generation of snippets. In embodiments, text features within a keyword-sentence window are identified. The text features are utilized to determine break features that indicate favorability of breaking at a particular location of the keyword-sentence window. The break features are used to recognize features of partial snippets such that a snippet score to indicate the strength of the partial snippet can be calculated. Snippet scores associated with partial snippets are compared to select an optimal snippet, that is, the snippet having the highest snippet score.

US Patent:

20220253477, Aug 11, 2022

Filed:

Feb 8, 2021

Appl. No.:

17/170520

Inventors:

- San Jose CA, US
Vishwa Vinay - Bangalore, IN
Ryan Rossi - Santa Clara CA, US
Franck Dernoncourt - San Jose CA, US
Tracy Holloway King - Mountain View CA, US

International Classification:

G06F 16/532
G06N 5/02
G06F 16/56
G06F 16/55
G06F 40/20

Abstract:

The present disclosure describes systems and methods for information retrieval. Embodiments of the disclosure provide a retrieval network that leverages external knowledge to provide reformulated search query suggestions, enabling more efficient network searching and information retrieval. For example, a search query from a user (e.g., a query mention of a knowledge graph entity that is included in a search query from a user) may be added to a knowledge graph as a surrogate entity via entity linking. Embedding techniques are then invoked on the updated knowledge graph (e.g., the knowledge graph that includes additional edges between surrogate entities and other entities of the original knowledge graph), and entities neighboring the surrogate entity are retrieved based on the embedding (e.g., based on a computed distance between the surrogate entity and candidate entities in the embedding space). Search results can then be ranked and displayed based on relevance to the neighboring entity.