IP Library Granted Patent US 10,579,727
Granted Patent B2
US 10,579,727 · App. 16/399,040 · Granted Mar 3, 2020

Hybrid grammatical and ungrammatical parsing

Inventors: Naveen Sundar Govindarajulu (San Jose, CA); Nicholas L. Cassimatis (Sunnyvale, CA); Jonathan R. Scally (Arlington, VA)
Assignee: Oath Inc.
G06F17/271G06F17/2785
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 10,579,727
App. No.
16/399,040
Granted
Mar 3, 2020
Kind
B2
Abstract

A system and method for processing a natural language input. The natural language input is initially processed through a strict parser, which results in an initial parse. The initial parse is evaluated to determine if it exceeds a completeness threshold. If the initial parse does not pass the completeness threshold, any open slots are filled using type based slot filling. The final parse is then output for further processing by another system, such as a search engine.

Claims (45)

1. A method, comprising:

performing type based slot filling to fill a first open slot and obtain a final parse, wherein multiple entities are eligible for the first open slot, and performing the type based slot filling comprises:

selecting a single entity to fill the first open slot; and

outputting the final parse comprising at least one of:

outputting the final parse over an input/output interface, or

outputting the final parse to a search engine.

2. The method of claim 1 , further comprising:

determining a completeness of an initial parse; and

comparing the completeness of the initial parse to a threshold,

wherein performing type based slot filling comprises performing the type based slot filling in response to the initial parse not meeting the threshold.

3. The method of claim 1 , further comprising parsing an input to obtain an initial parse having the first open slot, wherein the initial parse outputs at least one text field.

4. The method of claim 1 , further comprising parsing an input to obtain an initial parse having the first open slot, wherein the final parse comprises the initial parse with the single entity being filled in the first open slot.

5. The method of claim 1 , wherein the single entity is selected based on the single entity being used a lowest number of time in an initial parse.

6. The method of claim 1 , wherein the single entity is selected based on the single entity being closest to an expected position of the first open slot.

7. The method of claim 1 , wherein outputting the final parse comprises outputting the final parse to the search engine.

8. A system, comprising:

a processor;

an input/output interface; and

memory storing computer executable instructions that when implemented by the processor cause the system to perform functions comprising:

performing type based slot filling to fill a first open slot and obtain a final parse, wherein multiple entities are eligible for the first open slot, and performing the type based slot filling comprises:

selecting a single entity to fill the first open slot; and

outputting the final parse over the input/output interface.

9. The system of claim 8 , wherein the functions further comprise:

determining a completeness of an initial parse; and

comparing the completeness of the initial parse to a threshold,

wherein performing type based slot filling comprises performing the type based slot filling in response to the initial parse not meeting the threshold.

10. The system of claim 8 , wherein the functions further comprise parsing an input to obtain an initial parse having the first open slot, wherein the initial parse outputs at least one text field.

11. The system of claim 8 , wherein the functions further comprise parsing an input to obtain an initial parse having the first open slot, wherein the final parse comprises the initial parse with the single entity being filled in the first open slot.

12. The system of claim 8 , wherein the single entity is selected based on the single entity being used a lowest number of time in an initial parse.

13. The system of claim 8 , wherein the single entity is selected based on the single entity being closest to an expected position of the first open slot.

14. The system of claim 8 , wherein outputting the final parse comprises outputting the final parse to a search engine.

15. A method, comprising:

performing type based slot filling to fill a first open slot and obtain a final parse, wherein multiple entities are eligible for the first open slot, and performing the type based slot filling comprises:

selecting a single entity to fill the first open slot, wherein the single entity is selected based upon at least one of:

a measure of a use of the single entity, or

a closeness of the single entity to an expected position of the first open slot; and

outputting the final parse to a search engine.

16. The method of claim 15 , further comprising:

determining a completeness of an initial parse; and

comparing the completeness of the initial parse to a threshold,

wherein performing type based slot filling comprises performing the type based slot filling in response to the initial parse not meeting the threshold.

17. The method of claim 15 , further comprising parsing an input to obtain an initial parse having the first open slot, wherein the initial parse outputs at least one text field.

18. The method of claim 15 , further comprising parsing an input to obtain an initial parse having the first open slot, wherein the final parse comprises the initial parse with the single entity being filled in the first open slot.

19. The method of claim 15 , wherein the single entity is selected based on the measure of the use of the single entity.

20. The method of claim 15 , wherein the single entity is selected based on the closeness of the single entity to the expected position of the first open slot.

Assignments (3)
PATENT SECURITY AGREEMENT (FIRST LIEN) Recorded Sep 29, 2022
From: YAHOO ASSETS LLC
To: ROYAL BANK OF CANADA, AS COLLATERAL AGENT
Reel/Frame 061571/0773 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 16, 2021
From: YAHOO AD TECH LLC (FORMERLY VERIZON MEDIA INC.)
To: YAHOO ASSETS LLC
Reel/Frame 058982/0282 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 26, 2020
From: OATH INC.
To: VERIZON MEDIA INC.
Reel/Frame 054258/0635 →
Continuity (3)
Continuation 16055701 · Aug 6, 2018
Continuation 15228610 · Aug 4, 2016
Related Publication 20190258711A1 · Aug 22, 2019