| these <term> evaluation techniques </term> | will | provide information about both the <term> | #587 We believe that these evaluation techniqueswill provide information about both the human language learning process, the translation process and the development of machine translation systems. | ||
| involved in the decision making process | will | be presented here . <term> Listen-Communicate-Show | #775 The results of this experiment, along with a preliminary analysis of the factors involved in the decision making process will be presented here. | ||
| information sources </term> . We have built and | will | demonstrate an application of this approach | #818 We have built and will demonstrate an application of this approach called LCS-Marine. | ||
| <term> free text </term> . The demonstration | will | focus on how <term> JAVELIN </term> processes | #3665 The demonstration will focus on how JAVELIN processes questions and retrieves the most likely answer candidates from the given text corpus. | ||
| The operation of the <term> system </term> | will | be explained in depth through browsing | #3690 The operation of the systemwill be explained in depth through browsing the repository of data objects created by the system during each question answering session. | ||
| <term> genre </term> . Examples and results | will | be given for <term> Arabic </term> , but the | #4515 Examples and results will be given for Arabic, but the approach is applicable to any language that needs affix removal. | ||
| results </term> in a short time . The tutorial | will | cover the basics of <term> SMT </term> : Theory | #6856 The tutorial will cover the basics of SMT: | ||
| cover the basics of <term> SMT </term> : Theory | will | be put into practice . <term> STTK </term> | #6864 Theory will be put into practice. | ||
| statistical machine translation tool kit </term> , | will | be introduced and used to build a working | #6879 STTK, a statistical machine translation tool kit, will be introduced and used to build a working translation system. | ||
| </term> . The source code of the tool kit | will | be made available . This paper presents | #6948 The source code of the tool kit will be made available. | ||
| demonstration at ACL , new users of our tool | will | drive a <term> syntax-based decoder </term> | #10748 In our demonstration at ACL, new users of our tool will drive a syntax-based decoder for themselves. | ||
| <term> sentences </term> . In this paper , we | will | present a new <term> evaluation measure </term> | #11296 In this paper, we will present a new evaluation measure which explicitly models block reordering as an edit operation. | ||
| <term> quadratic time </term> . Furthermore , we | will | show how some <term> evaluation measures </term> | #11325 Furthermore, we will show how some evaluation measures can be improved by the introduction of word-dependent substitution costs. | ||
| language pairs </term> . The experimental results | will | show that it significantly outperforms | #11364 The experimental results will show that it significantly outperforms state-of-the-art approaches in sentence-level correlation. | ||
| word dependent substitution costs </term> | will | demonstrate an additional increase of correlation | #11384 Results from experiments with word dependent substitution costswill demonstrate an additional increase of correlation between automatic evaluation measures and human judgment. | ||
| <term> natural language interfaces </term> | will | never appear cooperative or graceful unless | #13498 While such decoding is an essential underpinning, much recent work suggests that natural language interfaceswill never appear cooperative or graceful unless they also incorporate numerous non-literal aspects of communication, such as robust communication procedures. | ||
| it . Ideally , such a <term> parser </term> | will | correct the <term> deviant input </term> : | #13896 Ideally, such a parserwill correct the deviant input: sometimes, it will be unable to correct it at all; at other times, correction will be possible, but only to within a range of ambiguous possibilities. | ||
| <term> deviant input </term> : sometimes , it | will | be unable to correct it at all ; at other | #13905 Ideally, such a parser will correct the deviant input: sometimes, it will be unable to correct it at all; at other times, correction will be possible, but only to within a range of ambiguous possibilities. | ||
| it at all ; at other times , correction | will | be possible , but only to within a range | #13919 Ideally, such a parser will correct the deviant input: sometimes, it will be unable to correct it at all; at other times, correction will be possible, but only to within a range of ambiguous possibilities. | ||
| assumption that the <term> input text </term> | will | be in reasonably neat form , e.g. , <term> | #14247 Most large text-understanding systems have been designed under the assumption that the input textwill be in reasonably neat form, e.g., newspaper stories and other edited texts. |
