Substring alignment using suffix trees

被引:0
|
作者
Kay, M [1 ]
机构
[1] Stanford Univ, Stanford, CA 94305 USA
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Alignment of the sentences of an original text and a translation is considerably better understood than alignment of smaller units such as words and phrases. This paper makes some preliminary proposals for solving the problem of aligning substrings that should be treated as basic translation unites even though they may not begin and end at word boundaries. The proposals make crucial use of suffix trees as a way of identifying repeated substrings of the texts that occur significantly often.
引用
收藏
页码:275 / 282
页数:8
相关论文
共 50 条
  • [41] Weighted Ancestors in Suffix Trees
    Gawrychowski, Pawel
    Lewenstein, Moshe
    Nicholson, Patrick K.
    [J]. ALGORITHMS - ESA 2014, 2014, 8737 : 455 - 466
  • [42] Empirical evaluation of clone detection using syntax suffix trees
    Falke, Rainiar
    Frenzel, Pierre
    Koschke, Rainer
    [J]. EMPIRICAL SOFTWARE ENGINEERING, 2008, 13 (06) : 601 - 643
  • [43] ONLINE CONSTRUCTION OF SUFFIX TREES
    UKKONEN, E
    [J]. ALGORITHMICA, 1995, 14 (03) : 249 - 260
  • [44] Suffix Trees as Language Models
    Kennington, Casey Redd
    Kay, Martin
    Friedrich, Annemarie
    [J]. LREC 2012 - EIGHTH INTERNATIONAL CONFERENCE ON LANGUAGE RESOURCES AND EVALUATION, 2012, : 446 - 453
  • [45] Practical Compressed Suffix Trees
    Canovas, Rodrigo
    Navarro, Gonzalo
    [J]. EXPERIMENTAL ALGORITHMS, PROCEEDINGS, 2010, 6049 : 94 - 105
  • [46] Compressed property suffix trees
    Hon, Wing-Kai
    Patil, Manish
    Shah, Rahul
    Thankachan, Sharma V.
    [J]. INFORMATION AND COMPUTATION, 2013, 232 : 10 - 18
  • [47] Empirical evaluation of clone detection using syntax suffix trees
    Raimar Falke
    Pierre Frenzel
    Rainer Koschke
    [J]. Empirical Software Engineering, 2008, 13 : 601 - 643
  • [48] A NOTE ON THE HEIGHT OF SUFFIX TREES
    DEVROYE, L
    SZPANKOWSKI, W
    RAIS, B
    [J]. SIAM JOURNAL ON COMPUTING, 1992, 21 (01) : 48 - 53
  • [49] PFP Compressed Suffix Trees
    Boucher, Christina
    Cvacho, Onclfej
    Gagie, Travis
    Holub, Jan
    Manzini, Giovanni
    Navarro, Gonzalo
    Rossi, Massimiliano
    [J]. 2021 PROCEEDINGS OF THE SYMPOSIUM ON ALGORITHM ENGINEERING AND EXPERIMENTS, ALENEX, 2021, : 60 - 72
  • [50] Random suffix search trees
    Devroye, L
    Neininger, R
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2003, 23 (04) : 357 - 396