UC知道论文翻译求助￥
来源：百度知道 编辑：UC知道 时间：2024/05/31 03:28:55
3 Tree Edit Distance
In this section we survey the tree edit distance problem. Assume that we are
given a cost function defined on each edit operation. An edit script S between
two trees T1 and T2 is a sequence of edit operations turning T1 into T2. The
cost of S is the sum of the costs of the operations in S. An optimal edit script
between T1 and T2 is an edit script between T1 and T2 of minimum cost. this cost is called the tree edit distance, denoted by (T1, T2). An example of an edit
script is shown in Figure 2.
In this section we survey the tree edit distance problem. Assume that we are
given a cost function defined on each edit operation. An edit script S between
two trees T1 and T2 is a sequence of edit operations turning T1 into T2. The
cost of S is the sum of the costs of the operations in S. An optimal edit script
between T1 and T2 is an edit script between T1 and T2 of minimum cost. this cost is called the tree edit distance, denoted by (T1, T2). An example of an edit
script is shown in Figure 2.
3 Tree Edit Distance
In this section we survey the tree edit distance problem. Assume that we are
given a cost function defined on each edit operation. An edit script S between
two trees T1 and T2 is a sequence of edit operations turning T1 into T2. The
cost of S is the sum of the costs of the operations in S. An optimal edit script
between T1 and T2 is an edit script between T1 and T2 of minimum cost. this cost is called the tree edit distance, denoted by (T1, T2). An example of an edit
script is shown in Figure 2.
3树编辑在这我们调查的部分中跑在树编辑距离问题前面.假定我们被给一个有关每一编辑运作定义成本功能.一在两棵树T1和T2之间编辑字体S是一连串的把T1转入T2编辑运算.S的成本是一最适的编辑在T1之间为在S.中运算写剧本的成本的总和和T2是一在T1和T2之间最低限度成本的编辑字体.这成本被被称作树编辑距离,表示在附近((T1,T2)的.一编辑字体的例子被在图2中展示.