The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Patent No.:

US 9336195 B1

PDF
Full Text
Expired
Date of Patent:
May. 10, 2016

Filed:

Aug. 27, 2013
Applicant:

Nuance Communications, Inc., Burlington, MA (US);

Inventor:

Neil D. Barrett, Montreal, CA;

Assignee:

Nuance Communications, Inc., Burlington, MA (US);

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06F 17/27 (2006.01); G06F 17/30 (2006.01); G06F 19/00 (2011.01);
U.S. Cl.
CPC ...
G06F 17/2735 (2013.01); G06F 17/30737 (2013.01); G06F 19/345 (2013.01);
Abstract

A method and system of removing noise from a dictionary using a weighted graph is presented. The method can include mapping, by a noise reducing agent executing on a processor, a plurality of dictionaries to a plurality of vertices of a graphical representation, wherein the plurality of vertices is connected by weighted edges representing noise. The plurality of dictionaries may further comprise a plurality of entries, wherein each entry further comprises a plurality of tokens. The method can include selecting a subset of the weighted edges, constructing an acyclic graphical representation from the selected subset of weighted edges, and determining an ordering based on the acyclic graphical representation. The selected subset of weighted edges may approximate a solution to the Maximum Acyclic Subgraph problem. The method can include removing noise from the plurality of dictionaries according to the determined ordering.


Find Patent Forward Citations

Loading…