Identifying related terms in different languages
AssigneeGoogle Inc.
InventorsTrystan G. Upstill, Steven D. Baker
Life of this patent
Estimating the term…
Abstract
One embodiment of the present invention provides a system that uses a known set of related terms to identify additional related terms in different languages. During operation, the system receives two terms that are known to be related. The system translates these two non-synonym terms into a given language, and then adds the translations of the two related terms to a list of known related pairs.
Claims27
A computer-implemented method comprising:
- receiving a first collection of terms that are designated as cohyponyms, and that are in a first natural language;
- generating a second collection of terms by translating the terms of the first collection that are designated as cohyponyms from the first natural language to a second natural language;
- receiving a candidate pair of terms in the second natural language;
- determining, by one or more computers, that both candidate terms of the received pair are present in the second collection of terms;
- and
- determining to not revise a query that includes a first candidate term of the pair, to include a second candidate term of the pair, based at least on determining that both candidate terms of the pair are present in the second collection of terms.
A non-transitory computer-readable storage medium storing instructions that when executed by one or more computers cause the one or more computers to perform operations comprising:
- receiving a first collection of terms that are designated as cohyponyms, and that are in a first natural language;
- generating a second collection of terms by translating the terms of the first collection that are designated as cohyponyms from the first natural language to a second natural language;
- receiving a candidate pair of terms in the second natural language;
- determining, by one or more computers, that both candidate terms of the received pair are present in the second collection of terms;
- and
- determining to not revise a query that includes a first candidate term of the pair, to include a second candidate term of the pair, based at least on determining that both candidate terms of the pair are present in the second collection of terms.
A computing system comprising:
- one or more computers;
- and
- a non-transitory computer-readable storage medium coupled to the one or more computers having instructions stored thereon which, when executed by the one or more computers, cause the one or more computers to perform operations comprising:
- receiving a first collection of terms that are designated as cohyponyms, and that are in a first natural language;
- generating a second collection of terms by translating the terms of the first collection that are designated as cohyponyms from the first natural language to a second natural language;
- receiving a candidate pair of terms in the second natural language;
- determining, by one or more computers, that both candidate terms of the received pair are present in the second collection of terms;
- and
- determining to not revise a query that includes a first candidate term of the pair, to include a second candidate term of the pair, based at least on determining that both candidate terms of the pair are present in the second collection of terms.
Dependencies are inferred from the claim text.