E14-4024 |
traditional parallel corpora with
|
pairwise alignments
|
. Whereas the latter tend to
|
P03-2029 |
attempt to apply the method of
|
pairwise alignment
|
to measuring the similarity between
|
D12-1084 |
Sequence Alignment generalizes
|
pairwise alignment
|
to arbitrarily many sequences
|
E14-2008 |
translations . For that we need a
|
pairwise alignment
|
between all input hypotheses
|
P08-2021 |
requires a procedure for creating
|
pairwise alignments
|
of translations that allow appropriate
|
N13-1020 |
we need to estimate the optimal
|
pairwise alignment
|
for all the pairs of suffix sequences
|
P06-2023 |
aligned segments are extracted from
|
pairwise alignment
|
. Those segments with common
|
D14-1102 |
permutations . After creating
|
pairwise alignments
|
using ME - TEOR , the alignments
|
J05-3002 |
are readily available from the
|
pairwise alignments
|
of the basis tree with other
|
P03-2029 |
obtain prototypes automatically . 3
|
Pairwise Alignment
|
We attempt to apply the method
|
P03-2029 |
disambiguation ( WSD ) method based on a
|
pairwise alignment
|
technique , which is used generally
|
P03-2029 |
method is based on a technique of
|
pairwise alignment
|
, and described in the following
|
D08-1019 |
alignment . A locally optimal
|
pairwise alignment
|
of modified dependency trees
|
D09-1125 |
the J&L approach is based on
|
pairwise alignments
|
between words in different hypotheses
|
P08-2021 |
steps : • Computation of all
|
pairwise alignments
|
between system hypotheses ( either
|
N13-1020 |
of biological sequences . The
|
pairwise alignment
|
problem can be solved efficiently
|
N13-1020 |
used metric that finds the best
|
pairwise alignment
|
between the candidate caption
|
P03-2029 |
in Figure 2 . We have shown the
|
pairwise alignment
|
between sequences p ( worked
|
J15-4001 |
retelling so that we will have all
|
pairwise alignments
|
available for use in the graph-based
|
P10-1100 |
algorithm that computes cheapest
|
pairwise alignments
|
( i.e. n = 2 ) in polynomial
|