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.

Date of Patent:
Mar. 18, 2025

Filed:

Oct. 13, 2020
Applicant:

Rev.com, Inc., San Francisco, CA (US);

Inventors:

Jean-Philippe Robichaud, Mercier, CA;

Miguel Jette, Squamish, CA;

Joshua Ian Dong, Austin, TX (US);

Quinten McNamara, Austin, TX (US);

Nishchal Bhandari, Austin, TX (US);

Michelle Kai Yu Huang, Austin, TX (US);

Assignee:

Rev.com, Inc., San Francisco, CA (US);

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G10L 15/06 (2013.01); G10L 15/14 (2006.01);
U.S. Cl.
CPC ...
G10L 15/06 (2013.01); G10L 15/14 (2013.01);
Abstract

A method of determining an alignment sequence between a reference sequence of symbols and a hypothesis sequence of symbols includes loading a reference sequence of symbols to a computing system and creating a reference finite state automaton for the reference sequence of symbols. The method further includes loading a hypothesis sequence of symbols to the computing system and creating a hypothesis finite state automaton for the hypothesis sequence of symbols. The method further includes traversing the reference finite state automaton, adding new reference arcs and new reference transforming properties arcs and traversing the hypothesis finite state automaton, adding new hypothesis arcs and new hypothesis transforming properties arcs. The method further includes composing the hypothesis finite state automaton with the reference finite state automaton creating alternative paths to form a composed finite state automaton and tracking a number of the alternative paths created. The method further includes pruning the alternative paths based on likely top paths, backtracking over most likely paths of the composed finite state automaton, and rescoring edit-distances of the composed finite state automaton.


Find Patent Forward Citations

Loading…