tech,15-2-A94-1007,ak of the most difficult problems for <term> machine translation ( MT ) systems </term> . The problem is selecting , from
tech,6-6-A94-1007,ak The <term> model </term> is based on a <term> balance matching operation </term> for two lists of the <term> feature
model,12-3-A94-1007,ak <term> candidates </term> , the correct <term> syntactic structure </term> formed by an individual <term> coordinate
tech,9-4-A94-1007,ak structures </term> are produced that <term> MT systems </term> can not select the correct one ,
model,26-4-A94-1007,ak <term> grammars </term> allow to write the <term> rules </term> in the simple notations . This paper
model,1-6-A94-1007,ak of the <term> parallelism </term> . The <term> model </term> is based on a <term> balance matching
tech,40-6-A94-1007,ak </term> of <term> ellipses </term> , and <term> robust analysis </term> . This <term> model </term> was practically
other,8-3-A94-1007,ak problem is selecting , from all possible <term> candidates </term> , the correct <term> syntactic structure
other,29-3-A94-1007,ak constituents </term> are coordinated by the <term> conjunction </term> . Typically , so many possible <term>
other,10-1-A94-1007,ak <term> English sentences </term> including <term> coordinate conjunctions </term> such as and , or , but and the equivalent
measure(ment),18-7-A94-1007,ak system </term> , and provided about 75 % <term> accuracy </term> in the practical translation use
hide detail