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:
Nov. 15, 2005

Filed:

Nov. 20, 2001
Applicants:

Matthew N. Dailey, San Diego, CA (US);

Dayne B. Freitag, La Mesa, CA (US);

Chalaporn Hathaidharm, Walnut, CA (US);

Anu K. Pathria, La Jolla, CA (US);

Inventors:

Matthew N. Dailey, San Diego, CA (US);

Dayne B. Freitag, La Mesa, CA (US);

Chalaporn Hathaidharm, Walnut, CA (US);

Anu K. Pathria, La Jolla, CA (US);

Assignee:

Burning Glass Technologies, LLC, San Diego, CA (US);

Attorney:
Assistant Examiner:
Int. Cl.
CPC ...
G06F017/27 ;
U.S. Cl.
CPC ...
Abstract

A Hidden Markov model is used to segment a data sequence. To reduce the potential for error that may result from the Markov assumption, the Viterbi dynamic programming algorithm is modified to apply a multiplicative factor if a particular set of states is re-entered. As a result, structural domain knowledge is incorporated into the algorithm by expanding the state space in the dynamic programming recurrence. In a specific example of segmenting resumes, the factor is used to reward or penalize (even require or prohibit) a segmentation of the resume that results in the re-entry into a section such as Experience or Contact Information. The method may be used to impose global constraints in the processing of an input sequence or to impose constraints to local sub-sequences.


Find Patent Forward Citations

Loading…