METHOD AND DEVICE FOR ANALYZING MORPHEME

PROBLEM TO BE SOLVED: To efficiently execute analysis and to improve speed by previously preparing the list of words in a set, which can be connected to a candidate word, and executing a processing only on the group of the words that can be connected at the time of retrieval. SOLUTION: Words in a bl...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: HISAMITSU TORU, SAKURAI HIROBUMI
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 HISAMITSU TORU
SAKURAI HIROBUMI
description PROBLEM TO BE SOLVED: To efficiently execute analysis and to improve speed by previously preparing the list of words in a set, which can be connected to a candidate word, and executing a processing only on the group of the words that can be connected at the time of retrieval. SOLUTION: Words in a block 12 are given as candidate words W as WL= Wstart-2(S) from the content of a word dictionary D, which correspond to a retrieval character string 'hashiru (run)'. Words that can be connected between the candidate words W and 'ha' being a noticed word W'1 are limited to the three words of ('ha', ft noun, rt noun, 100), ('hashi', ft noun, rt noun, 100) and ('hashiru', ft verb, rt verb, 100). At the time of checking connection between the candidate word W in the block 12 and 'ha' being the word W'1 terminated in a position 2, it is sufficient to check the relation of the three words. Thus, data on the connection possibility of the word is previously prepared and a morpheme is analyzed between the words that can be connected.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_JP2000259629A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>JP2000259629A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_JP2000259629A3</originalsourceid><addsrcrecordid>eNrjZNDwdQ3x8HdRcPRzUXBxDfN0dlVw8w8Cch19IqM8_dwVfP2DAjxcfV15GFjTEnOKU3mhNDeDkptriLOHbmpBfnxqcUFicmpeakm8V4CRgYGBkamlmZGlozFRigA3jSRe</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>METHOD AND DEVICE FOR ANALYZING MORPHEME</title><source>esp@cenet</source><creator>HISAMITSU TORU ; SAKURAI HIROBUMI</creator><creatorcontrib>HISAMITSU TORU ; SAKURAI HIROBUMI</creatorcontrib><description>PROBLEM TO BE SOLVED: To efficiently execute analysis and to improve speed by previously preparing the list of words in a set, which can be connected to a candidate word, and executing a processing only on the group of the words that can be connected at the time of retrieval. SOLUTION: Words in a block 12 are given as candidate words W as WL= Wstart-2(S) from the content of a word dictionary D, which correspond to a retrieval character string 'hashiru (run)'. Words that can be connected between the candidate words W and 'ha' being a noticed word W'1 are limited to the three words of ('ha', ft noun, rt noun, 100), ('hashi', ft noun, rt noun, 100) and ('hashiru', ft verb, rt verb, 100). At the time of checking connection between the candidate word W in the block 12 and 'ha' being the word W'1 terminated in a position 2, it is sufficient to check the relation of the three words. Thus, data on the connection possibility of the word is previously prepared and a morpheme is analyzed between the words that can be connected.</description><edition>7</edition><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2000</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=20000922&amp;DB=EPODOC&amp;CC=JP&amp;NR=2000259629A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20000922&amp;DB=EPODOC&amp;CC=JP&amp;NR=2000259629A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>HISAMITSU TORU</creatorcontrib><creatorcontrib>SAKURAI HIROBUMI</creatorcontrib><title>METHOD AND DEVICE FOR ANALYZING MORPHEME</title><description>PROBLEM TO BE SOLVED: To efficiently execute analysis and to improve speed by previously preparing the list of words in a set, which can be connected to a candidate word, and executing a processing only on the group of the words that can be connected at the time of retrieval. SOLUTION: Words in a block 12 are given as candidate words W as WL= Wstart-2(S) from the content of a word dictionary D, which correspond to a retrieval character string 'hashiru (run)'. Words that can be connected between the candidate words W and 'ha' being a noticed word W'1 are limited to the three words of ('ha', ft noun, rt noun, 100), ('hashi', ft noun, rt noun, 100) and ('hashiru', ft verb, rt verb, 100). At the time of checking connection between the candidate word W in the block 12 and 'ha' being the word W'1 terminated in a position 2, it is sufficient to check the relation of the three words. Thus, data on the connection possibility of the word is previously prepared and a morpheme is analyzed between the words that can be connected.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2000</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZNDwdQ3x8HdRcPRzUXBxDfN0dlVw8w8Cch19IqM8_dwVfP2DAjxcfV15GFjTEnOKU3mhNDeDkptriLOHbmpBfnxqcUFicmpeakm8V4CRgYGBkamlmZGlozFRigA3jSRe</recordid><startdate>20000922</startdate><enddate>20000922</enddate><creator>HISAMITSU TORU</creator><creator>SAKURAI HIROBUMI</creator><scope>EVB</scope></search><sort><creationdate>20000922</creationdate><title>METHOD AND DEVICE FOR ANALYZING MORPHEME</title><author>HISAMITSU TORU ; SAKURAI HIROBUMI</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_JP2000259629A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2000</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>HISAMITSU TORU</creatorcontrib><creatorcontrib>SAKURAI HIROBUMI</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>HISAMITSU TORU</au><au>SAKURAI HIROBUMI</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>METHOD AND DEVICE FOR ANALYZING MORPHEME</title><date>2000-09-22</date><risdate>2000</risdate><abstract>PROBLEM TO BE SOLVED: To efficiently execute analysis and to improve speed by previously preparing the list of words in a set, which can be connected to a candidate word, and executing a processing only on the group of the words that can be connected at the time of retrieval. SOLUTION: Words in a block 12 are given as candidate words W as WL= Wstart-2(S) from the content of a word dictionary D, which correspond to a retrieval character string 'hashiru (run)'. Words that can be connected between the candidate words W and 'ha' being a noticed word W'1 are limited to the three words of ('ha', ft noun, rt noun, 100), ('hashi', ft noun, rt noun, 100) and ('hashiru', ft verb, rt verb, 100). At the time of checking connection between the candidate word W in the block 12 and 'ha' being the word W'1 terminated in a position 2, it is sufficient to check the relation of the three words. Thus, data on the connection possibility of the word is previously prepared and a morpheme is analyzed between the words that can be connected.</abstract><edition>7</edition><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_JP2000259629A
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title METHOD AND DEVICE FOR ANALYZING MORPHEME
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T13%3A00%3A28IST&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=HISAMITSU%20TORU&rft.date=2000-09-22&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EJP2000259629A%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