Pasar al contenido principal

COMPRESION Y RECUPERACION DE CONTENIDOS MULTILINGUES

TIN2009-14009-C02-02

•
Nombre agencia financiadora Ministerio de Ciencia e Innovación
Acrónimo agencia financiadora MICINN
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2009
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Subdirección General de Proyectos de Investigación
Centro beneficiario UNIVERSIDAD DE VALLADOLID
Identificador persistente http://dx.doi.org/10.13039/501100004837

Resultados relacionados

Resultados totales (Incluyendo duplicados): 2
Encontrada(s) 1 página(s)

RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Generalized biwords for bitext compression and translation spotting

  • Sánchez-Martínez, Felipe
  • Carrasco, Rafael C.
  • Martínez Prieto, Miguel Ángel
  • Adiego Rodríguez, Joaquín
  • Carrasco, Rafael C.|||/items/19b33375-4ead-49a2-99fb-e982ee6fcce6
  • Sánchez-Martínez, Felipe|||/items/117378d0-8f7d-40ef-9b4a-5646b1af1999
Large bilingual parallel texts (also known as bitexts) are usually stored in a compressed form, and previous work has shown that they can be more efficiently compressed if the fact that the two texts are mutual translations is exploited. For example, a bitext can be seen as a sequence of biwords —pairs of parallel words with a high probability of co-occurrence— that can be used as an intermediate representation in the compression process. However, the simple biword approach described in the literature can only exploit one-to-one word alignments and cannot tackle the reordering of words. We therefore introduce a generalization of biwords which can describe multi-word expressions and reorderings. We also describe some methods for the binary compression of generalized biword sequences, and compare their performance when different schemes are applied to the extraction of the biword sequence. In addition, we show that this generalization of biwords allows for the implementation of an efficient algorithm to look on the compressed bitext for words or text segments in one of the texts and retrieve their counterpart translations in the other text —an application usually referred to as translation spotting— with only some minor modifications in the compression algorithm.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Boosting bitext compression

  • Adiego Rodríguez, Joaquín
  • Martínez Prieto, Miguel Ángel
  • Hoyos Torío, Javier E.
  • Sánchez-Martínez, Felipe
  • Sánchez-Martínez, Felipe|||/items/117378d0-8f7d-40ef-9b4a-5646b1af1999
Bilingual parallel corpora, also know as bitexts, convey the same information in two different languages. This implies that when modelling bitexts one can take advantage of the fact that there exists a relation between both texts; the text alignment task allow to establish such relationship. In this paper we propose different approaches that use words and biwords (pairs made of two words, each one from a different text) as representation symbolic units. The properties of these approaches are analysed from a statistical point of view and tested as a preprocessing step to general purpose compressors. The results obtained suggest interesting conclusions concerning the use of both words and biwords. When encoded models are used as compression boosters we achieve compression ratios improving state-of-the-art compressors up to 6.5 percentage points, being up to 40% faster.