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 条
  • [1] The efficient computation of complete and concise substring scales with suffix trees
    Ferre, Sebastien
    [J]. Formal Concept Analysis, Proceedings, 2007, 4390 : 98 - 113
  • [2] On the use of suffix trees in multiple sequence alignment
    Sharma, Kai Renganathan
    [J]. ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2005, 230 : U1326 - U1326
  • [3] Grammatical inference using suffix trees
    Geertzen, J
    van Zaanen, M
    [J]. GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, PROCEEDINGS, 2004, 3264 : 163 - 174
  • [4] Malware clustering using suffix trees
    Oprisa, Ciprian
    Cabau, George
    Pal, Gheorghe Sebestyen
    [J]. JOURNAL OF COMPUTER VIROLOGY AND HACKING TECHNIQUES, 2016, 12 (01): : 1 - 10
  • [5] On suffix extensions in suffix trees
    Breslauer, Dany
    Italiano, Giuseppe F.
    [J]. THEORETICAL COMPUTER SCIENCE, 2012, 457 : 27 - 34
  • [6] On Suffix Extensions in Suffix Trees
    Breslauer, Dany
    Italiano, Giuseppe F.
    [J]. STRING PROCESSING AND INFORMATION RETRIEVAL, 2011, 7024 : 301 - +
  • [7] Efficient Computation of Substring Equivalence Classes with Suffix Arrays
    Narisawa, Kazuyuki
    Hiratsuka, Hideharu
    Inenaga, Shunsuke
    Bannai, Hideo
    Takeda, Masayuki
    [J]. ALGORITHMICA, 2017, 79 (02) : 291 - 318
  • [8] Efficient Computation of Substring Equivalence Classes with Suffix Arrays
    Kazuyuki Narisawa
    Hideharu Hiratsuka
    Shunsuke Inenaga
    Hideo Bannai
    Masayuki Takeda
    [J]. Algorithmica, 2017, 79 : 291 - 318
  • [9] Efficient computation of substring equivalence classes with suffix arrays
    Narisawa, Kazuyuki
    Inenaga, Shunsuke
    Barmai, Hideo
    Takeda, Masayuki
    [J]. COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2007, 4580 : 340 - +
  • [10] From suffix trees to suffix vectors
    Prieur, Elise
    Lecroq, Thierry
    [J]. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2006, 17 (06) : 1385 - 1402