| C00-1064 | ) , especially the part of tag | string alignments | . Next , we will explain the |
| P06-2070 | based on stochastic iterative | string alignment | ( SIA ) , which aims to combine |
| P05-3026 | In 2001 , Bangalore et al used | string alignments | between the different translations |
| P06-2070 | incorporated into it . The stochastic | string alignment | can be implemented by simply |
| N04-1036 | is initially applied to the DP | string alignment | . Bilingual NE pairs are extracted |
| D13-1165 | phase we use these corpora of | string alignments | to build a pair language model |
| P06-2070 | introduces how to compute the | string alignment | based on the word gaps . Given |
| P06-2070 | achieve the same purpose . The | string alignment | has a good dynamic framework |
| P06-2070 | pair of strings , the task of | string alignment | is to obtain the longest monotonic |
| H05-1061 | English translation candidate via | string alignment | . Many key phrases are person |
| P07-1015 | pronunciations are aligned using standard | string alignment | algorithm based on Kruskal ( |
| N04-1036 | Dynamic programming ( DP ) - based | string alignment | is iteratively ) e y ( I ) . |
| H05-1061 | . This normalization makes the | string alignment | possible . We adopt the transliteration |
| P06-2070 | to be computed . 3.1 Modified | String Alignment | This section introduces how to |
| P07-1015 | substitution/insertion/deletion cost for the | string alignment | algorithm is based on the baseline |
| H94-1104 | use of phonologically-motivated | string alignment | software for use in scoring speech |
| H91-1056 | distance measure and standard | string alignment | techniques \ -LSB- 6 \ -RSB- |
| P06-2070 | scheme . In this scheme , the | string alignment | will be continued until there |
| K15-1004 | polynomial numbers of phrases for fixed | string alignment | . Our bottom-up construction |
| P06-1077 | ˜S | T˜ ) , the tree-to - | string alignment | template , denoted by the variable |
