| expressions </term> , the results of which | will | be incorporated into a <term> natural language | #15230 This research is part of a larger study of anaphoric expressions, the results of which will be incorporated into a natural language generation system. | |
| it is actually possible , and after that | will | lead to predictions of missing <term> fragments | #15559 We shall introduce the concept of a chart that works outward from islands and makes sense of as much of the sentence as it is actually possible, and after that will lead to predictions of missing fragments. | |
| in the <term> sentence </term> , the process | will | extend to both the left and the right of | #15584 So, for any place where the easily identifiable fragments occur in the sentence, the process will extend to both the left and the right of the islands, until possibly completely missing fragments are reached. | |
| 3-character Chinese names without title </term> . We | will | show the experimental results for two <term> | #18339 We will show the experimental results for two corpora and compare them with the results by the NTHU's statistic-based system, the only system that we know has attacked the same problem. | |
| aspects of a <term> parse tree </term> that | will | determine the correct <term> parse </term> | #18972 We use a corpus of bracketed sentences, called a Treebank, in combination with decision tree building to tease out the relevant aspects of a parse tree that will determine the correct parse of a sentence. | |
| </term> , it is extremely likely that they | will | all share the same <term> sense </term> . This | #19253 That is, if a polysemous word such as sentence appears two or more times in a well-written discourse, it is extremely likely that they will all share the same sense. | |
| target word selection </term> . This paper | will | concentrate on the second requirement . | #20261 This paper will concentrate on the second requirement. |
