poster

Representing a bilingual lexicon with suffix trees

Authors:

Jorge Costa,

Gabriel Pereira Lopes,

Luís Gomes,

Luís M. S. RussoAuthors Info & Claims

SAC '11: Proceedings of the 2011 ACM Symposium on Applied Computing

Pages 1164 - 1165

https://doi.org/10.1145/1982185.1982440

Published: 21 March 2011 Publication History

Get Access

Abstract

This paper presents a system based on generalized suffix trees that efficiently implements a set of operations over a bilingual lexicon. Besides the basic operations of adding and removing translations from the lexicon, the system provides two unique query functions that we refer to as monolingual and bilingual coverage. These two functions lay the foundation for higher-level mining operations, such as identification of translation patterns, that are the subject of ongoing research. Nevertheless, the system presented here is interesting in and by itself, for the novelty of the coverage functions and the potential of the whole data structure. We compare the performance of two implementations, one based on suffix trees and the other on suffix arrays.

References

[1]

Aires, G. P. Lopes, and L. Gomes. Phrase translation extraction from aligned parallel corpora using suffix arrays and related structures. In Progress in Artificial Intelligence, LNCS, pages 588--597, 2009.

Digital Library

Google Scholar

[2]

L. Gomes. Parallel texts alignment. 2009.

Google Scholar

[3]

L. Gomes, Aires, and G. P. Lopes. Parallel texts alignment. In EPIA 2009, Aveiro, pages 513--524. Universidade de Aveiro.

Google Scholar

[4]

D. Gusfield. Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge Univ Pr, 1997.

Digital Library

Google Scholar

[5]

L. Russo, G. Navarro, and A. Oliveira. Fully-compressed suffix trees. LATIN 2008: Theoretical Informatics, pages 362--373, 2008.

Digital Library

Google Scholar

[6]

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

Digital Library

Google Scholar

Index Terms

Representing a bilingual lexicon with suffix trees
1. Applied computing
  1. Arts and humanities
    1. Language translation
2. Computing methodologies
  1. Artificial intelligence
    1. Natural language processing

Recommendations

Processing comparable corpora with Bilingual Suffix Trees
EMNLP '02: Proceedings of the ACL-02 conference on Empirical methods in natural language processing - Volume 10

We introduce Bilingual Suffix Trees (BST), a data structure that is suitable for exploiting comparable corpora. We discuss algorithms that use BSTs in order to create parallel corpora and learn translations of unseen words from comparable corpora. ...
A lexicon of multiword expressions for linguistically precise, wide-coverage natural language processing

Since Sag et al. (2002) highlighted a key problem that had been underappreciated in the past in natural language processing (NLP), namely idiosyncratic multiword expressions (MWEs) such as idioms, quasi-idioms, cliches, quasi-cliches, institutionalized ...
A Statistical View on Bilingual Lexicon Extraction: From Parallel Corpora to Non-parallel Corpora
AMTA '98: Proceedings of the Third Conference of the Association for Machine Translation in the Americas on Machine Translation and the Information Soup

We present two problems for statistically extracting bilingual lexicon: (1) How can noisy parallel corpora be used? (2) How can non-parallel yet comparable corpora be used? We describe our own work and contribution in relaxing the constraint of using ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SAC '11: Proceedings of the 2011 ACM Symposium on Applied Computing

March 2011

1868 pages

ISBN:9781450301138

DOI:10.1145/1982185

Conference Chairs:
William Chu
Tunghai University, TaiChung, Taiwan
,
W. Eric Wong
University of Texas at Dallas, Richardson, Texas
,
Program Chairs:
Mathew J. Palakal
Indiana University Purdue University, Indianapolis
,
Chih-Cheng Hung
Southern Polytechnic State University, Marietta

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 March 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Poster

Conference

SAC'11

Sponsor:

SIGAPP

SAC'11: The 2011 ACM Symposium on Applied Computing

March 21 - 24, 2011

TaiChung, Taiwan

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25

Sponsor:
sigapp

The 40th ACM/SIGAPP Symposium on Applied Computing

March 31 - April 4, 2025

Catania , Italy

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
77
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 17 Dec 2024

Other Metrics

View Author Metrics

Citations

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Index Terms

Recommendations

Processing comparable corpora with Bilingual Suffix Trees

A lexicon of multiword expressions for linguistically precise, wide-coverage natural language processing

A Statistical View on Bilingual Lexicon Extraction: From Parallel Corpora to Non-parallel Corpora