On-line connected handwritten word recognition by a probabilistic method

Methods and apparatus are disclosed for recognizing handwritten words in response to an input signal from a handwriting transducer. The method includes the steps of: (a) partitioning the input signal into N frames; and (b) processing words from a vocabulary model to determine, for each processed wor...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: NATHAN, KRISHNA S, FUJISAKI, TETSUNOSUKE
Format: Patent
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator NATHAN
KRISHNA S
FUJISAKI
TETSUNOSUKE
description Methods and apparatus are disclosed for recognizing handwritten words in response to an input signal from a handwriting transducer. The method includes the steps of: (a) partitioning the input signal into N frames; and (b) processing words from a vocabulary model to determine, for each processed word, a probability that the word represents a written word that is conveyed by the input signal. The determined probability is a function of N letter-frame alignment probabilities and also a probability based on a grouping of the N frames into L groups, where L is a number of letters in the word. A further step (c) identifies a word having a highest determined probability as being a most-likely word that is conveyed by the input signal. The determined probability is also a function of (a) a probability based on a frequency of occurrence of words and portions of words within a selected language model; and (b) when processing a frame other than the Nth frame, a number of frames that remain to be processed. In one embodiment of the invention all words in the vocabulary model are searched in parallel, thereby significantly reducing the recognition time. The use of a beam search technique is illustrated to perform the parallel search. Also, this invention teaches the use of hashing to increase the speed of the beam search technique.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US5392363A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US5392363A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US5392363A3</originalsourceid><addsrcrecordid>eNqFyrEKAjEMANAuDqJ-g_mBWywKjnIotzmo89Gm0QvUpLSBw793cXd6y1u64SpdZiFAFSE0SjAFSXNlMxKYtSaohPoSNlaB-IEApWoMkTM3Y4Q32aRp7RbPkBttfq7c9nK-90NHRUdqJSAJ2fi47f1x5w_-5P-PLwF2NAU</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>On-line connected handwritten word recognition by a probabilistic method</title><source>esp@cenet</source><creator>NATHAN; KRISHNA S ; FUJISAKI; TETSUNOSUKE</creator><creatorcontrib>NATHAN; KRISHNA S ; FUJISAKI; TETSUNOSUKE</creatorcontrib><description>Methods and apparatus are disclosed for recognizing handwritten words in response to an input signal from a handwriting transducer. The method includes the steps of: (a) partitioning the input signal into N frames; and (b) processing words from a vocabulary model to determine, for each processed word, a probability that the word represents a written word that is conveyed by the input signal. The determined probability is a function of N letter-frame alignment probabilities and also a probability based on a grouping of the N frames into L groups, where L is a number of letters in the word. A further step (c) identifies a word having a highest determined probability as being a most-likely word that is conveyed by the input signal. The determined probability is also a function of (a) a probability based on a frequency of occurrence of words and portions of words within a selected language model; and (b) when processing a frame other than the Nth frame, a number of frames that remain to be processed. In one embodiment of the invention all words in the vocabulary model are searched in parallel, thereby significantly reducing the recognition time. The use of a beam search technique is illustrated to perform the parallel search. Also, this invention teaches the use of hashing to increase the speed of the beam search technique.</description><edition>6</edition><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; HANDLING RECORD CARRIERS ; PHYSICS ; PRESENTATION OF DATA ; RECOGNITION OF DATA ; RECORD CARRIERS</subject><creationdate>1995</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=19950221&amp;DB=EPODOC&amp;CC=US&amp;NR=5392363A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25563,76318</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=19950221&amp;DB=EPODOC&amp;CC=US&amp;NR=5392363A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>NATHAN; KRISHNA S</creatorcontrib><creatorcontrib>FUJISAKI; TETSUNOSUKE</creatorcontrib><title>On-line connected handwritten word recognition by a probabilistic method</title><description>Methods and apparatus are disclosed for recognizing handwritten words in response to an input signal from a handwriting transducer. The method includes the steps of: (a) partitioning the input signal into N frames; and (b) processing words from a vocabulary model to determine, for each processed word, a probability that the word represents a written word that is conveyed by the input signal. The determined probability is a function of N letter-frame alignment probabilities and also a probability based on a grouping of the N frames into L groups, where L is a number of letters in the word. A further step (c) identifies a word having a highest determined probability as being a most-likely word that is conveyed by the input signal. The determined probability is also a function of (a) a probability based on a frequency of occurrence of words and portions of words within a selected language model; and (b) when processing a frame other than the Nth frame, a number of frames that remain to be processed. In one embodiment of the invention all words in the vocabulary model are searched in parallel, thereby significantly reducing the recognition time. The use of a beam search technique is illustrated to perform the parallel search. Also, this invention teaches the use of hashing to increase the speed of the beam search technique.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>HANDLING RECORD CARRIERS</subject><subject>PHYSICS</subject><subject>PRESENTATION OF DATA</subject><subject>RECOGNITION OF DATA</subject><subject>RECORD CARRIERS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>1995</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqFyrEKAjEMANAuDqJ-g_mBWywKjnIotzmo89Gm0QvUpLSBw793cXd6y1u64SpdZiFAFSE0SjAFSXNlMxKYtSaohPoSNlaB-IEApWoMkTM3Y4Q32aRp7RbPkBttfq7c9nK-90NHRUdqJSAJ2fi47f1x5w_-5P-PLwF2NAU</recordid><startdate>19950221</startdate><enddate>19950221</enddate><creator>NATHAN; KRISHNA S</creator><creator>FUJISAKI; TETSUNOSUKE</creator><scope>EVB</scope></search><sort><creationdate>19950221</creationdate><title>On-line connected handwritten word recognition by a probabilistic method</title><author>NATHAN; KRISHNA S ; FUJISAKI; TETSUNOSUKE</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US5392363A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>1995</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>HANDLING RECORD CARRIERS</topic><topic>PHYSICS</topic><topic>PRESENTATION OF DATA</topic><topic>RECOGNITION OF DATA</topic><topic>RECORD CARRIERS</topic><toplevel>online_resources</toplevel><creatorcontrib>NATHAN; KRISHNA S</creatorcontrib><creatorcontrib>FUJISAKI; TETSUNOSUKE</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>NATHAN; KRISHNA S</au><au>FUJISAKI; TETSUNOSUKE</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>On-line connected handwritten word recognition by a probabilistic method</title><date>1995-02-21</date><risdate>1995</risdate><abstract>Methods and apparatus are disclosed for recognizing handwritten words in response to an input signal from a handwriting transducer. The method includes the steps of: (a) partitioning the input signal into N frames; and (b) processing words from a vocabulary model to determine, for each processed word, a probability that the word represents a written word that is conveyed by the input signal. The determined probability is a function of N letter-frame alignment probabilities and also a probability based on a grouping of the N frames into L groups, where L is a number of letters in the word. A further step (c) identifies a word having a highest determined probability as being a most-likely word that is conveyed by the input signal. The determined probability is also a function of (a) a probability based on a frequency of occurrence of words and portions of words within a selected language model; and (b) when processing a frame other than the Nth frame, a number of frames that remain to be processed. In one embodiment of the invention all words in the vocabulary model are searched in parallel, thereby significantly reducing the recognition time. The use of a beam search technique is illustrated to perform the parallel search. Also, this invention teaches the use of hashing to increase the speed of the beam search technique.</abstract><edition>6</edition><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US5392363A
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
HANDLING RECORD CARRIERS
PHYSICS
PRESENTATION OF DATA
RECOGNITION OF DATA
RECORD CARRIERS
title On-line connected handwritten word recognition by a probabilistic method
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-11T13%3A44%3A31IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=NATHAN;%20KRISHNA%20S&rft.date=1995-02-21&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS5392363A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true