IP Library › Granted Patent US 10,185,710
Granted Patent B2
US 10,185,710 · App. 15/519,284 · Granted Jan 22, 2019

Transliteration apparatus, transliteration method, transliteration program, and information processing apparatus

Inventor: Satoshi Egi (Tokyo, JP)
Assignee: Rakuten, Inc.
G06F17/274G06F17/2735G06F17/2863
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,185,710
App. No.
15/519,284
Granted
Jan 22, 2019
Kind
B2
Abstract

A transliteration processing device according to one embodiment includes a character string acquisition unit that acquires a first alphabetic character string representing by alphabet a first word written in a first language having a specified script and a second alphabetic character string representing by alphabet a second word written in a second language having a different script from the first language, a determination unit that makes a determination whether a first consonant element included in the first alphabetic character string and a second consonant element included in the second alphabetic character string have a predetermined correspondence, and determines whether the first word and the second word have a transliteration relationship based on a result of the determination, and an output unit that outputs, as a transliteration pair, the first word and the second word determined to have a transliteration relationship by the determination unit.

Claims (37)

1. A transliteration processing device comprising:

at least one memory configured to store computer program code; and

at least one processor configured to access said at least one memory,

wherein the at least one processor is instructed by said computer program code to:

acquire a first alphabetic character string that represents by alphabet a first word written in a first language having a specified script and a second alphabetic character string that represents by alphabet a second word written in a second language having a different script from the first language;

divide the first alphabetic character string at a boundary where a vowel letter is followed by a consonant letter, generate a first array where divided elements are arranged in order of appearance in the first alphabetic character string, divide the second alphabetic character string at a boundary where a vowel letter is followed by a consonant letter, and generate a second array where divided elements are arranged in order of appearance in the second alphabetic character string, wherein, when an element including a consonant element consisting of a plurality of consonant letters exists among the divided elements, the first array and the second array are respectively generated corresponding to a plurality of dividing patterns including a pattern of further dividing the element into two or more elements and a pattern of not dividing the element;

compare, for each of the plurality of dividing patterns, elements of the first array and elements of the second array one by one from an element at the beginning of each array, and when it is determined, for at least one of the plurality of dividing patterns, that a first consonant element included in each element of the first array and a second consonant element included in each element of the second array have a predetermined correspondence, determine that the first word and the second word have a transliteration relationship; and

generate a transliteration pair, which includes the first word and the second word determined to have the transliteration relationship and register, in transliteration dictionary data, the transliteration pair,

wherein, in response to a search inquiry received from a user terminal, the search inquiry including the first word written in the first language:

the transliteration dictionary data is referred to so as to obtain the transliteration pair, including the first word and the second word determined to have the transliteration relationship,

a search is performed among web pages accessible via Internet based on the first word and the second word, and

a web page searched based on the first word as a keyword and a web page searched based on the second word as the keyword are returned and displayed on the user terminal as a search result in response to the search inquiry.

2. The transliteration processing device according to claim 1 , wherein the at least one processor is instructed by said computer program code to:

exclude a consonant element that matches a predetermined condition out of the first consonant element included in the first alphabetic character string and the second consonant element included in the second alphabetic character string, and make a determination on remaining consonant elements.

3. The transliteration processing device according to claim 1 , wherein the at least one processor is instructed by said computer program code to:

make a determination based on a pair of a first vowel element included in the first alphabetic character string and a second vowel element included in the second alphabetic character string, and determine whether the first word and the second word have the transliteration relationship based also on a result of the determination.

4. The transliteration processing device according to claim 1 , the at least one processor operates is instructed by said computer program code to:

acquire a word in Katakana contained in one web page as the first word and acquire a word in alphabet contained in the one web page as the second word.

5. An information processing device that performs predetermined processing by referring to transliteration pairs generated by the transliteration processing device according to claim 1 .

6. A transliteration processing method performed by at least one processor, comprising:

acquiring a first alphabetic character string that represents by alphabet a first word written in a first language having a specified script and a second alphabetic character string that represents by alphabet a second word written in a second language having a different script from the first language;

dividing the first alphabetic character string at a boundary where a vowel letter is followed by a consonant letter, generating a first array where divided elements are arranged in order of appearance in the first alphabetic character string, dividing the second alphabetic character string at a boundary where a vowel letter is followed by a consonant letter, and generating a second array where divided elements are arranged in order of appearance in the second alphabetic character string, wherein, when an element including a consonant element consisting of a plurality of consonant letters exists among the divided elements, the first array and the second array are respectively generated corresponding to a plurality of dividing patterns including a pattern of further dividing the element into two or more elements and a pattern of not dividing the element;

comparing, for each of the plurality of dividing patterns, elements of the first array and elements of the second array one by one from an element at the beginning of each array, and when it is determined, for at least one of the plurality of dividing patterns, that a first consonant element included in each element of the first array and a second consonant element included in each element of the second array have a predetermined correspondence, determining that the first word and the second word have a transliteration relationship; and

generating a transliteration pair, which includes the first word and the second word determined to have the transliteration relationship and registering, in transliteration dictionary data, the transliteration pair,

wherein, in response to a search inquiry received from a user terminal, the search inquiry including the first word written in the first language:

the transliteration dictionary data is referred to so as to obtain the transliteration pair, including the first word and the second word determined to have the transliteration relationship,

a search is performed among web pages accessible via Internet based on the first word and the second word, and

a web page searched based on the first word as a keyword and a web page searched based on the second word as the keyword are returned and displayed on the user terminal as a search result in response to the search inquiry.

7. A non-transitory computer readable medium storing a transliteration processing program causing a computer to:

acquire a first alphabetic character string that represents by alphabet a first word written in a first language having a specified script and a second alphabetic character string that represents by alphabet a second word written in a second language having a different script from the first language;

divide the first alphabetic character string at a boundary where a vowel letter is followed by a consonant letter, generate a first array where divided elements are arranged in order of appearance in the first alphabetic character string, divide the second alphabetic character string at a boundary where a vowel letter is followed by a consonant letter, and generate a second array where divided elements are arranged in order of appearance in the second alphabetic character string, wherein, when an element including a consonant element consisting of a plurality of consonant letters exists among the divided elements, the first array and the second array are respectively generated corresponding to a plurality of dividing patterns including a pattern of further dividing the element into two or more elements and a pattern of not dividing the element;

compare, for each of the plurality of dividing patterns, elements of the first array and elements of the second array one by one from an element at the beginning of each array, and when it is determined, for at least one of the plurality of dividing patterns, that a first consonant element included in each element of the first array and a second consonant element included in each element of the second array have a predetermined correspondence, determine that the first word and the second word have a transliteration relationship; and

generate a transliteration pair, which includes the first word and the second word determined to have the transliteration relationship and register, in transliteration dictionary data, the transliteration pair,

wherein, in response to a search inquiry received from a user terminal, the search inquiry including the first word written in the first language:

the transliteration dictionary data is referred to so as to obtain the transliteration pair, including the first word and the second word determined to have the transliteration relationship,

a search is performed among web pages accessible via Internet based on the first word and the second word, and

a web page searched based on the first word as a keyword and a web page searched based on the second word as the keyword are returned and displayed on the user terminal as a search result in response to the search inquiry.

Assignments (3)
CORRECTIVE ASSIGNMENT TO CORRECT THE REMOVE PATENT NUMBERS 10342096;10671117; 10716375; 10716376;10795407;10795408; AND 10827591 PREVIOUSLY RECORDED AT REEL: 58314 FRAME: 657. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT. Recorded Feb 29, 2024
From: RAKUTEN, INC.
To: RAKUTEN GROUP, INC.
Reel/Frame 068066/0103 →
CHANGE OF NAME Recorded Dec 6, 2021
From: RAKUTEN, INC.
To: RAKUTEN GROUP, INC.
Reel/Frame 058314/0657 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 14, 2017
From: EGI, SATOSHI
To: RAKUTEN, INC.
Reel/Frame 042012/0453 →
Continuity (1)
Related Publication 20170228360A1 · Aug 10, 2017
Cited By (3)
US 12,298,972 US 12,360,990 US 12,511,501