← Back to Patent Explorer
US5467407A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and apparatus for recognizing cursive writing from sequential input information

Assignee: Microsoft Technology Licensing LLC
•
Filing: 1994-03-23
•
Granted: 1995-11-14
•
Expires: 2014-03-23
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method and apparatus for cursive script recognition employs an intermediate cursive words description language constructed of elements in the form of metastrokes wherein each of the metastrokes is a member of a metric space, the metric space being expressible as a matrix of likelihood of matching between input metastrokes and predefined metastrokes forming a vocabulary. Typically, a minimum of twenty metastrokes is used to form the vocabulary or set of allowable stroke elemental shapes, although as many as seventy may be used, with a correlation factor or measurement of similarity being defined between strings of metastrokes. Techniques for interpreting the metastrokes as words include substituting, adding, and deleting metastrokes in an input sequence, measuring similarity and comparing with entries in a dictionary of words constructed of metastroke sequences and variants of metastroke sequences. Weighting of similarity may include penalties for lack of similarity.

Inventors

  • 👤 Shelja A. Guberman
  • 👤 Ilia Lossev
  • 👤 Alexander V. Pashintsev

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-30 17:58
CPC Classifications
G; G06; G06V; G06V30/00; G06V30/10; G06V30/14; G06V30/142; G06V30/1423; G06V30/22; G06V30/226; G06V30/2264; G06V30/2268; G06V30/2272; G06V30/26; G06V30/262; G06V30/32; G06V30/333; G06V30/347; G06V30/36; G06V30/373

Claims Analysis

Total Claims: 5
Claim 1
Independent Claim 149 words
A method for recognizing cursive handwritten words from stroke data, said method comprising the steps of: accepting digital information representing a sequence of points including a beginning point and an end point; selecting as a candidate word the sequence of points bounded by said beginning point and said ending point; replacing said candidate word sequence with a first plurality of metastrokes, said first plurality of metastrokes representing said candidate word sequence; compiling a list of possible matching word metastrokes using a dictionary of whole word metastrokes and said first plurality of metastrokes; comparing a first possible matching word metastrokes from said list of possible matching word metastrokes with said first plurality of metastrokes; computing a first word metric based on said comparison; and outputting a first possible matching word if said first word metric exceeds a predetermined threshold, said first possible matching word representing said first matching word metastrokes.
Claim 2
Independent Claim 149 words
A method for recognizing cursive handwritten words from stroke data, said method comprising the steps of: accepting digital information representing a sequence of points including a beginning point and an end point; selecting as a candidate word the sequence of points bounded by said beginning point and said ending point; replacing said candidate word sequence with a first plurality of metastrokes, said first plurality of metastrokes representing said candidate word sequence; compiling a list of possible matching word metastrokes using a dictionary of whole word metastrokes and said first plurality of metastrokes; comparing a first possible matching word metastrokes from said list of possible matching word metastrokes with said first plurality of metastrokes; computing a first word metric based on said comparison; and outputting a first possible matching word if said first word metric exceeds a predetermined threshold, said first possible matching word representing said first matching word metastrokes.
Claim 3
Dependent Claim 45 words
The method of claim 1 wherein said computing step comprises the steps of: substituting a first metastroke for a second metastroke, said second metastroke being part of said first plurality of metastrokes, and computing said first word metric taking into account a substitution weighing penalty.
Claim 4
Dependent Claim 37 words
The method of claim 2 wherein said computing step further comprises the steps of: inserting a third metastroke into said first plurality of metastrokes, and computing said first word metric taking into account an addition weighing penalty.
Claim 5
Dependent Claim 37 words
The method of claim 3 wherein said computing step further comprises the steps of: deleting a fourth metastroke from said first plurality of metastrokes, and computing said first word metric taking into account a deletion weighing penalty.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1998-11-13 1999-05-15 1999-11-14 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2002-11-13 2003-05-15 2003-11-14 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2006-11-13 2007-05-15 2007-11-14 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag