IP Library › Granted Patent US 11,586,819
Granted Patent B2
US 11,586,819 · App. 16/855,445 · Granted Feb 21, 2023

Interpreting meaning of content

Inventors: Frank John Williams (Rossmoor, CA); David Ralph Lazzara (Huntington Beach, CA); Donald Joseph Wurzel (Savannah, GA); Stephen Emerson Sundberg (Chicago, IL); Ameeta Vasant Reed (Deerfield, IL); Dennis Arlen Roberson (Chapin, SC); Thomas James MacTavish (Inverness, IL); Karl Olaf Knutson (Palatine, IL); Jessy Thomas (Palatine, IL); Niklas Josiah MacTavish (Inverness, IL); David Michael Corns, II (Elgin, IL); Andrew Chu (St. Charles, IL); Theodore Mazurkiewicz (Lake Zurich, IL); Gary W. Grube (Barrington Hills, IL)
Assignee: entigenlogic LLC
G06F40/284G06F16/90332G06F16/90344G06F40/253
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,586,819
App. No.
16/855,445
Granted
Feb 21, 2023
Kind
B2
Abstract

A method for execution by a computing device includes obtaining a phrase that includes string of words and generating a valid sequence of words utilizing the phrase. The method further includes identifying a set of identigens for each word of the valid sequence of words to produce sets of identigens. The method further includes identifying, for each identigen of the sets of identigens, a word type associated with phrase structure grammar rules to produce sets of identigen-type associations. The method further includes interpreting, utilizing the phrase structure grammar rules, the sets of identigen-type associations to produce an entigen group. The entigen group represents a most likely interpretation of the phrase.

Claims (72)

1. A method for execution by a computing device, the method comprises:

obtaining a phrase that includes string of words;

generating a valid sequence of words utilizing the phrase;

identifying a set of identigens for each word of the valid sequence of words to produce a plurality of sets of identigens, wherein a first set of identigens of the plurality of sets of identigens includes one or more different meanings of a first word of the valid sequence of words;

identifying, for each identigen of the plurality of sets of identigens, a word type of a plurality of word types associated with phrase structure grammar rules to produce a plurality of sets of identigen-type associations, wherein a first set of identigen-type associations of the plurality of sets of identigen-type associations includes one or more identigen-type associations of the first word of the valid sequence of words, wherein the identifying, for each identigen of the plurality of sets of identigens, the word type of the plurality of word types associated with the phrase structure grammar rules to produce the plurality of sets of identigen-type associations includes:

accessing, for each identigen of the plurality of sets of identigens, a knowledge database to recover the word type, and

associating, for each identigen of the plurality of sets of identigens, the identigen with the corresponding word type to produce the plurality of sets of identigen-type associations; and

interpreting, utilizing the phrase structure grammar rules, the plurality of sets of identigen-type associations to produce an entigen group, wherein the entigen group represents a most likely interpretation of the phrase, wherein a first entigen of the entigen group corresponds to an identigen of the first set of identigens having a most likely meaning of the one or more different meanings of the first word of the valid sequence of words.

2. The method of claim 1 further comprises:

facilitating storage of the entigen group in the knowledge database; and

outputting the entigen group to a receiving entity.

3. The method of claim 1 , wherein the identifying the set of identigens for each word of the valid sequence of words to produce the plurality of sets of identigens comprises one or more of:

accessing, for each word of the valid sequence of words, the knowledge database to recover the set of identigens; and

interpreting a query response from another computing device to produce the set of identigens, wherein the query response is received in response to an identigen query with regards to the word.

4. The method of claim 1 , wherein the interpreting, utilizing the phrase structure grammar rules, the plurality of sets of identigen-type associations to produce the entigen group comprises:

identifying, for each set of identigen-type associations of the plurality of sets of identigen-type associations, a valid identigen-type association of a sequence of identigen-type associations complying with the phrase structure grammar rules, wherein the sequence of identigen-type associations complying with the phrase structure grammar rules includes a first identigen-type association of a first set of identigen-type associations and a first identigen-type association of a second set of identigen-type associations; and

identifying a sequence of identigens of the sequence of identigen-type associations complying with the phrase structure grammar rules to produce the entigen group.

5. The method of claim 1 , wherein the interpreting, utilizing the phrase structure grammar rules, the plurality of sets of identigen-type associations to produce the entigen group further comprises:

eliminating, for each set of identigen-type associations of the plurality of sets of identigen-type associations, an invalid identigen-type association of an invalid sequence of identigen-type associations based on non-compliance with the phrase structure grammar rules, wherein the invalid sequence of identigen-type associations includes a first invalid identigen-type association of a first set of identigen-type associations and a first invalid identigen-type association of a second set of identigen-type associations;

identifying, for each set of identigen-type associations of the plurality of sets of identigen-type associations, a remaining identigen-type association of another sequence of identigen-type associations complying with the phrase structure grammar rules, wherein the sequence of identigen-type associations complying with the phrase structure grammar rules includes a first valid identigen-type association of the first set of identigen-type associations and a first valid identigen-type association of the second set of identigen-type associations; and

identifying a sequence of identigens of the other sequence of identigen-type associations complying with the phrase structure grammar rules to produce the entigen group.

6. A computing device of a computing system, the computing device comprises:

an interface;

a local memory; and

a processing module operably coupled to the interface and the local memory, wherein the processing module functions to:

obtain a phrase that includes string of words;

generate a valid sequence of words utilizing the phrase;

identify a set of identigens for each word of the valid sequence of words to produce a plurality of sets of identigens, wherein a first set of identigens of the plurality of sets of identigens includes one or more different meanings of a first word of the valid sequence of words;

identify, for each identigen of the plurality of sets of identigens, a word type of a plurality of word types associated with phrase structure grammar rules to produce a plurality of sets of identigen-type associations, wherein a first set of identigen-type associations of the plurality of sets of identigen-type associations includes one or more identigen-type associations of the first word of the valid sequence of words, wherein the processing module functions to identify, for each identigen of the plurality of sets of identigens, the word type of the plurality of word types associated with the phrase structure grammar rules to produce the plurality of sets of identigen-type associations by:

accessing, via the interface, for each identigen of the plurality of sets of identigens,

a knowledge database to recover the word type, and

associating, for each identigen of the plurality of sets of identigens, the identigen with the corresponding word type to produce the plurality of sets of identigen-type associations; and

interpret, utilizing the phrase structure grammar rules, the plurality of sets of identigen-type associations to produce an entigen group, wherein the entigen group represents a most likely interpretation of the phrase, wherein a first entigen of the entigen group corresponds to an identigen of the first set of identigens having a most likely meaning of the one or more different meanings of the first word of the valid sequence of words.

7. The computing device of claim 6 , wherein the processing module further functions to:

facilitate storage, via the interface, of the entigen group in the knowledge database; and

output, via the interface, the entigen group to a receiving entity.

8. The computing device of claim 6 , wherein the processing module functions to identify the set of identigens for each word of the valid sequence of words to produce the plurality of sets of identigens by one or more of:

accessing, via the interface, for each word of the valid sequence of words, the knowledge database to recover the set of identigens; and

interpreting a query response from another computing device to produce the set of identigens, wherein the query response is received in response to an identigen query with regards to the word.

9. The computing device of claim 6 , wherein the processing module functions to interpret, utilizing the phrase structure grammar rules, the plurality of sets of identigen-type associations to produce the entigen group by:

identifying, for each set of identigen-type associations of the plurality of sets of identigen-type associations, a valid identigen-type association of a sequence of identigen-type associations complying with the phrase structure grammar rules, wherein the sequence of identigen-type associations complying with the phrase structure grammar rules includes a first identigen-type association of a first set of identigen-type associations and a first identigen-type association of a second set of identigen-type associations; and

identifying a sequence of identigens of the sequence of identigen-type associations complying with the phrase structure grammar rules to produce the entigen group.

10. The computing device of claim 6 , wherein the processing module functions to interpret, utilizing the phrase structure grammar rules, the plurality of sets of identigen-type associations to produce the entigen group further by:

eliminating, for each set of identigen-type associations of the plurality of sets of identigen-type associations, an invalid identigen-type association of an invalid sequence of identigen-type associations based on non-compliance with the phrase structure grammar rules, wherein the invalid sequence of identigen-type associations includes a first invalid identigen-type association of a first set of identigen-type associations and a first invalid identigen-type association of a second set of identigen-type associations;

identifying, for each set of identigen-type associations of the plurality of sets of identigen-type associations, a remaining identigen-type association of another sequence of identigen-type associations complying with the phrase structure grammar rules, wherein the sequence of identigen-type associations complying with the phrase structure grammar rules includes a first valid identigen-type association of the first set of identigen-type associations and a first valid identigen-type association of the second set of identigen-type associations; and

identifying a sequence of identigens of the other sequence of identigen-type associations complying with the phrase structure grammar rules to produce the entigen group.

11. A computer readable memory comprises:

a first memory element that stores operational instructions that, when executed by a processing module, causes the processing module to:

obtain a phrase that includes string of words; and

generate a valid sequence of words utilizing the phrase;

a second memory element that stores operational instructions that, when executed by the processing module, causes the processing module to:

identify a set of identigens for each word of the valid sequence of words to produce a plurality of sets of identigens, wherein a first set of identigens of the plurality of sets of identigens includes one or more different meanings of a first word of the valid sequence of words;

a third memory element that stores operational instructions that, when executed by the processing module, causes the processing module to:

identify, for each identigen of the plurality of sets of identigens, a word type of a plurality of word types associated with phrase structure grammar rules to produce a plurality of sets of identigen-type associations, wherein a first set of identigen-type associations of the plurality of sets of identigen-type associations includes one or more identigen-type associations of the first word of the valid sequence of words, wherein the processing module functions to execute the operational instructions stored by the third memory element to cause the processing module to identify, for each identigen of the plurality of sets of identigens, the word type of the plurality of word types associated with the phrase structure grammar rules to produce the plurality of sets of identigen-type associations by:

accessing, for each identigen of the plurality of sets of identigens, a knowledge database to recover the word type, and

associating, for each identigen of the plurality of sets of identigens, the identigen with the corresponding word type to produce the plurality of sets of identigen-type associations; and

a fourth memory element that stores operational instructions that, when executed by the processing module, causes the processing module to:

interpret, utilizing the phrase structure grammar rules, the plurality of sets of identigen-type associations to produce an entigen group, wherein the entigen group represents a most likely interpretation of the phrase, wherein a first entigen of the entigen group corresponds to an identigen of the first set of identigens having a most likely meaning of the one or more different meanings of the first word of the valid sequence of words.

12. The computer readable memory of claim 11 further comprises:

a fifth memory element that stores operational instructions that, when executed by the processing module, causes the processing module to:

facilitate storage of the entigen group in the knowledge database; and

output the entigen group to a receiving entity.

13. The computer readable memory of claim 11 , wherein the processing module functions to execute the operational instructions stored by the second memory element to cause the processing module to identify the set of identigens for each word of the valid sequence of words to produce the plurality of sets of identigens by one or more of:

accessing, for each word of the valid sequence of words, the knowledge database to recover the set of identigens; and

interpreting a query response from another computing device to produce the set of identigens, wherein the query response is received in response to an identigen query with regards to the word.

14. The computer readable memory of claim 11 , wherein the processing module functions to execute the operational instructions stored by the fourth memory element to cause the processing module to interpret, utilizing the phrase structure grammar rules, the plurality of sets of identigen-type associations to produce the entigen group by:

identifying, for each set of identigen-type associations of the plurality of sets of identigen-type associations, a valid identigen-type association of a sequence of identigen-type associations complying with the phrase structure grammar rules, wherein the sequence of identigen-type associations complying with the phrase structure grammar rules includes a first identigen-type association of a first set of identigen-type associations and a first identigen-type association of a second set of identigen-type associations; and

identifying a sequence of identigens of the sequence of identigen-type associations complying with the phrase structure grammar rules to produce the entigen group.

15. The computer readable memory of claim 11 , wherein the processing module functions to execute the operational instructions stored by the fourth memory element to cause the processing module to interpret, utilizing the phrase structure grammar rules, the plurality of sets of identigen-type associations to produce the entigen group further by:

eliminating, for each set of identigen-type associations of the plurality of sets of identigen-type associations, an invalid identigen-type association of an invalid sequence of identigen-type associations based on non-compliance with the phrase structure grammar rules, wherein the invalid sequence of identigen-type associations includes a first invalid identigen-type association of a first set of identigen-type associations and a first invalid identigen-type association of a second set of identigen-type associations;

identifying, for each set of identigen-type associations of the plurality of sets of identigen-type associations, a remaining identigen-type association of another sequence of identigen-type associations complying with the phrase structure grammar rules, wherein the sequence of identigen-type associations complying with the phrase structure grammar rules includes a first valid identigen-type association of the first set of identigen-type associations and a first valid identigen-type association of the second set of identigen-type associations; and

identifying a sequence of identigens of the other sequence of identigen-type associations complying with the phrase structure grammar rules to produce the entigen group.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 23, 2020
From: WILLIAMS, FRANK JOHN; LAZZARA, DAVID RALPH; WURZEL, DONALD JOSEPH; SUNDBERG, STEPHEN EMERSON; REED, AMEETA VASANT; ROBERSON, DENNIS ARLEN; MACTAVISH, THOMAS JAMES; KNUTSON, KARL OLAF; THOMAS, JESSY; MACTAVISH, NIKLAS JOSIAH; CORNS, DAVID MICHAEL, II; CHU, ANDREW; MAZURKIEWICZ, THEODORE; GRUBE, GARY W.
To: ENTIGENLOGIC LLC
Reel/Frame 052473/0469 →
Continuity (2)
Provisional Application 62839892 · Apr 29, 2019
Related Publication 20200342171A1 · Oct 29, 2020