INDEXING A LIST OF DATA STRUCTURES FOR FAST LOOKUP
Permalink
Bookmark
Share
Twitter
Digg
Reddit
Facebook
Stumbleupon
Del.icio.us| IP.com Number | IPCOM000021399D |
|
|
|---|---|---|---|
| Dated | Nov 1, 2000 UTC | ||
| Size | 2 page(s) (23.0 KB) | ||
| Disclosed by |
|
||
Publication Summary
This invention entails a method for efficiently finding a set of matching examples in an example-based machine translation system. This allows for the use of a large example database to increase translation quality while mitigating the cost in run-time matching speed that a large database would normally entail.| Country | United States |
|---|---|
| Language | English (United States) |
| Related Person(s) |
(INVENTOR) Eugene Joseph Koontz |
| Copyright | 2000 Sony Electronics Inc. |
About this Publication
This document was submitted to IP.com's Prior Art Database and this preview is designed to provide you with information regarding the contents of this document by displaying up to the first four pages of the document as scaled page renderings and displaying a limited amount of text which was extracted from the document on the Text Preview Tab.
To find out more on how to obtain the entire document, click the Download tab. There is a charge for downloading some Prior Art Database documents; please examine carefully whether you believe this document fills your needs before purchasing.
For more information about the Prior Art Database, visit the Learn section of this website. Thank you for visiting IP.com's Prior Art Database! You may wish to check out our Global Patent Search website before you leave.
Sony Technical Digest, Volume 3, November 2000, ISSN 1521-5180
INDEXING A LIST OF DATA STRUCTURES FOR FAST LOOKUP
Invention by:
Eugene Joseph Koontz
This invention entails a method for efficiently finding a set of matching examples in an example-based machine translation system. This allows for the use of a large example database to increase translation quality while mitigating the cost in run-time matching speed that a large database would normally entail.
Example-based translation uses a database of examples, each of which is a pair of source and targets language expressions. Each pair is selected to exemplify some important feature of the source or target language. At run time, the system consults the example database to find the best candidate pair for the input, and this pair is used to generate an expression in the target language. This method allows translation quality to improve by adding relevant examples to the database.
However, an iterative search of the examples at run-time becomes the dominant factor in system performance for a realistically large example database. For embedded devices with limited processing power, a more efficient method of searching the database is needed.
Every linguistic sign is represented in the system by a fstructure, similar to the representations used in linguistic theories such as LFG or HPSG. It is a set of feature-value pairs, where each feature is an atomic symbol, and a value is either an atomic symbol or an fstructure. A path is a list of features where F2 is a feature within the value of F 1, and F3 is a feature within the value of F2, and so on.
The input to the transfer component of the translation system is the input fstructure, which represents the syntactic and semantic structure of a string in the input language; the output is another fstructure which is passed to the Generation Component, which turns this fstructure into a string in the target language.
Within the transfer component, there are two subcomponents. The first is the match step. This eliminates from the example set of all structures that do not satisfy certain boolean queries. The boolean queries to be applied to the example are determined by the transfer grammar, which provides a top-down control structure to the matching process. The transfer grammar is a set of context free r...