References

1   A. Andersson, N. J. Larsson, and K. Swanson. 1999. Suffix trees on words. Algorithmica, 23(3), September. 

2   Paul Bieganski, John Riedl, John Carlis, and Ernest Retzel. 1994. Generalized suffix trees for biological sequence data: Applications and implementation. In Proceedings of the 27th Annual Hawaii International Conference on System Sciences, volume 5, pages 35--44. IEEE. 

3   Peter F. Brown , Vincent J. Della Pietra , Stephen A. Della Pietra , Robert L. Mercer, The mathematics of statistical machine translation: parameter estimation, Computational Linguistics, v.19 n.2, June 1993 

4   Mona Diab and Steve Finch. 2000. A statistical word-level translation model for comparable corpora. In Proceedings of the Conference on Content-Based Multimedia Information Access. 

5   M. Farach, Optimal suffix tree construction with large alphabets, Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS '97), p.137, October 19-22, 1997 

6   Pascale Fung , Lo Yuen Yee, An IR approach for translating new words from nonparallel, comparable texts, Proceedings of the 17th international conference on Computational linguistics, August 10-14, 1998, Montreal, Quebec, Canada 

7   Roberto Grossi and Giuseppe F. Italiano. 1993. Suffix trees and their applications in string algorithms. In Proc. 1st South American Workshop on String Processing, pages 57--76, September. 

8   Dan Gusfield, Algorithms on strings, trees, and sequences: computer science and computational biology, Cambridge University Press, New York, NY, 1997 

9   Genichiro Kikui. 1999. Resolving translation ambiguity using non-parallel bilingual corpora. In Proceedings of ACL99 Workshop on Unsupervised Learning in Natural Language Processing. 

10   Philipp Koehn , Kevin Knight, Estimating Word Translation Probabilities from Unrelated Monolingual Corpora Using the EM Algorithm, Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence, p.711-715, July 30-August 03, 2000 

11   Stefan Kurtz, Reducing the space requirement of suffix trees, Software Practice & Experience, v.29 n.13, p.1149-1171, Nov. 1999 

12   Mark Nelson. 1996. Fast string searching with suffix trees. Dr. Dobb's Journal, August. 

13   Reinhard Rapp, Identifying word translations in non-parallel texts, Proceedings of the 33rd annual meeting on Association for Computational Linguistics, June 26-30, 1995, Cambridge, Massachusetts 

14   Reinhard Rapp, Automatic identification of word translations from unrelated English and German corpora, Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics, p.519-526, June 20-26, 1999, College Park, Maryland 

15   Esko Ukkonen. 1995. On-line construction of suffix trees. Algorithmica, 14(3):249--260, September. 

16   P. Weiner. 1973. Linear pattern matching algorithm. In Proc. 14 IEEE Symposium on Switching and Automata Theory, pages 1--11.
