DOCSLIB.ORG

Combining Prosodic and Text Features for Segmentation of Mandarin Broadcast News

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Combining Prosodic and Text Features for Segmentation of Mandarin Broadcast News Combining Prosodic and Text Features for Segmentation of Mandarin Broadcast News Gina-Anne Levow University of Chicago [email protected] Abstract ing to basic structural principles. This structure in turn guides the interpretation of individual utter- Automatic topic segmentation, separation of a dis- ances and the discourse as a whole. Formal writ- course stream into its constituent stories or topics, ten discourse signals a hierarchical, tree-based dis- is a necessary preprocessing step for applications course structure explicitly by the division of the text such as information retrieval, anaphora resolution, into chapters, sections, paragraphs, and sentences. and summarization. While significant progress has This structure, in turn, identifies domains for in- been made in this area for text sources and for En- terpretation; many systems for anaphora resolution glish audio sources, little work has been done in rely on some notion of locality (Grosz and Sidner, automatic, acoustic feature-based segmentation of 1986). Similarly, this structure represents topical other languages. In this paper, we consider exploit- organization, and thus would be useful in informa- ing both prosodic and text-based features for topic tion retrieval to select documents where the primary segmentation of Mandarin Chinese. As a tone lan- sections are on-topic, and, for summarization, to se- guage, Mandarin presents special challenges for ap- lect information covering the different aspects of the plicability of intonation-based techniques, since the topic. pitch contour is also used to establish lexical iden- Unfortunately, spoken discourse does not include tity. We demonstrate that intonational cues such as the orthographic conventions that signal structural reduction in pitch and intensity at topic boundaries organization in written discourse. Instead, one must and increase in duration and pause still provide sig- infer the hierarchical structure of spoken discourse nificant contrasts in Mandarin Chinese. We build from other cues. Prior research (Nakatani et al., a decision tree classifier that, based only on word 1995; Swerts, 1997) has shown that human label- and local context prosodic information without ref- ers can more sharply, consistently, and confidently erence to term similarity, cue phrase, or sentence- identify discourse structure in a word-level tran- level information, achieves boundary classification scription when an original audio recording is avail- accuracy of 84.6-95.6% on a balanced test set. We able than they can on the basis of the transcribed contrast these results with classification using text- text alone. This finding indicates that substantial based features, exploiting both text similarity and additional information about the structure of the n-gram cues, to achieve accuracies between 77- discourse is encoded in the acoustic-prosodic fea- 95.6%, if silence features are used. Finally we in- tures of the utterance. Given the often errorful tran- tegrate prosody, text, and silence features using a scriptions available for large speech corpora, we voting strategy to combine decision tree classifiers choose to focus here on fully exploiting the prosodic for each feature subset individually and all subsets cues to discourse structure present in the original jointly. This voted decision tree classifier yields speech. We then compare the effectiveness of a pure an overall classification accuracy of 96.85%, with prosodic classification to text-based and mixed text 2.8% miss and 3.15% false alarm rates on a repre- and prosodic based classification. sentative corpus sample, demonstrating synergistic combination of prosodic and text features for topic In the current set of experiments, we concentrate segmentation. on sequential segmentation of news broadcasts into individual stories. While a richer hierarchical seg- 1 Introduction mentation is ultimately desirable, sequential story segmentation provides a natural starting point. This Natural spoken discourse is composed of a sequence level of segmentation can also be most reliably per- of utterances, not independently generated or ran- formed by human labelers and thus can be consid- domly strung together, but rather organized accord- ered most robust, and segmented data sets are pub- licly available. that emphasis is marked intonationally by expansion Furthermore, we apply prosodic-based segmenta- of pitch range even in the presence of Mandarin lex- tion to Mandarin Chinese, in addition to textual fea- ical tone (Shen, 1989) suggests encouragingly that tures. Not only is the use of prosodic cues to topic prosodic, intonational cues to other aspects of in- segmentation much less well-studied in general than formation structure might also prove robust in tone is the use of text cues, but the use of prosodic cues languages. has been largely limited to English and other Euro- pean languages. 4 Data Set We utilize the Topic Detection and Tracking (TDT) 2 Related Work 3 (Wayne, 2000) collection Mandarin Chinese Most prior research on automatic topic segmenta- broadcast news audio corpus as our data set. Story tion has been applied to clean text only and thus segmentation in Mandarin and English broadcast used textual features. Text-based segmentation ap- news and newswire text was one of the TDT tasks proaches have utilized term-based similarity mea- and also an enabling technology for other retrieval sures computed across candidate segments (Hearst, tasks. We use the segment boundaries provided with 1994) and also discourse markers to identify dis- the corpus as our gold standard labeling. Our col- course structure (Marcu, 2000). lection comprises 3014 news stories drawn from ap- The Topic Detection and Tracking (TDT) eval- proximately 113 hours over three months (October- uations focused on segmentation of both text and December 1998) of news broadcasts from the Voice speech sources. This framework introduced new of America (VOA) in Mandarin Chinese, with 800 challenges in dealing with errorful automatic tran- regions of other program material including musi- scriptions as well as new opportunities to exploit cal interludes and teasers. The transcriptions span cues in the original speech. The most successful approximately 750,000 words. Stories average ap- approach (Beeferman et al., 1999) produced auto- proximately 250 words in length to span a full story. matic segmentations that yielded retrieval results No subtopic segmentation is performed. The audio approaching those with manual segmentations, us- is stored in NIST Sphere format sampled at 16KHz ing text and silence features. (Tur et al., 2001) ap- with 16-bit linear encoding. plied both a prosody-only and a mixed text-prosody model to segmentation of TDT English broadcast 5 Prosodic Features news, with the best results combining text and We consider four main classes of prosodic features prosodic features. (Hirschberg and Nakatani, 1998) for our analysis and classification: pitch, intensity, also examined automatic topic segmentation based silence and duration. Pitch, as represented by f0 in on prosodic cues, in the domain of English broad- Hertz was computed by the “To pitch” function of cast news, while (Hirschberg et al., 2001) applied the Praat system (Boersma, 2001). We selected the similar cues to segmentation of voicemail. highest ranked pitch candidate value in each voiced Work in discourse analysis (Nakatani et al., 1995; region. We then applied a 5-point median filter to Swerts, 1997) in both English and Dutch has iden- smooth out local instabilities in the signal such as tified features such as changes in pitch range, in- vocal fry or small regions of spurious doubling or tensity, and speaking rate associated with seg- halving. Analogously, we computed the intensity ment boundaries and with boundaries of different in decibels for each 10ms frame with the Praat “To strengths. They also demonstrated that access to intensity” function, followed by similar smoothing. acoustic cues improves the ease and quality of hu- For consistency and to allow comparability, we man labeling. compute all figures for word-based units, using the automatic speech recognition transcriptions pro- 3 Prosody and Mandarin vided with the TDT Mandarin data. The words are In this paper we focus on topic segmentation in used to establish time spans for computing pitch Mandarin Chinese broadcast news. Mandarin Chi- or intensity mean or maximum values, to enable nese is a tone language in which lexical identity is durational normalization and the pairwise compar- determined by a pitch contour - or tone - associ- isons reported below, and to identify silence or non- ated with each syllable. This additional use of pitch speech duration. raises the question of the cross-linguistic applicabil- It is well-established (Ross and Ostendorf, 1996) ity of the prosodic cues, especially pitch cues, iden- that for robust analysis pitch and intensity should tified for non-tone languages. Specifically, do we be normalized by speaker, since, for example, aver- find intonational cues in tone languages? The fact age pitch is largely incomparable for male and fe- male speakers. In the absence of speaker identifica- 7 Classification tion software, we approximate speaker normaliza- 7.1 Prosodic Feature Set tion with story-based normalization, computed as ¢¡¤£¦¥¨§ © ¡ 1 § © ¡ , assuming one speaker per topic . For du- The results above indicate that duration, pitch, and ration, we consider both absolute and normalized intensity should be useful for automatic prosody- word duration,
Load more

Recommended publications
  • Sentence Boundary Detection for Handwritten Text Recognition Matthias Zimmermann
    Sentence Boundary Detection for Handwritten Text Recognition Matthias Zimmermann To cite this version: Matthias Zimmermann. Sentence Boundary Detection for Handwritten Text Recognition. Tenth International Workshop on Frontiers in Handwriting Recognition, Université de Rennes 1, Oct 2006, La Baule (France). inria-00103835 HAL Id: inria-00103835 https://hal.inria.fr/inria-00103835 Submitted on 5 Oct 2006 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Sentence Boundary Detection for Handwritten Text Recognition Matthias Zimmermann International Computer Science Institute Berkeley, CA 94704, USA [email protected] Abstract 1) The summonses say they are ” likely to persevere in such In the larger context of handwritten text recognition sys- unlawful conduct . ” <s> They ... tems many natural language processing techniques can 2) ” It comes at a bad time , ” said Ormston . <s> ”A singularly bad time ... potentially be applied to the output of such systems. How- ever, these techniques often assume that the input is seg- mented into meaningful units, such as sentences. This pa- Figure 1. Typical ambiguity for the position of a sen- per investigates the use of hidden-event language mod- tence boundary token <s> in the context of a period els and a maximum entropy based method for sentence followed by quotes.
    [Show full text]
  • Multiple Segmentations of Thai Sentences for Neural Machine Translation
    Proceedings of the 1st Joint SLTU and CCURL Workshop (SLTU-CCURL 2020), pages 240–244 Language Resources and Evaluation Conference (LREC 2020), Marseille, 11–16 May 2020 c European Language Resources Association (ELRA), licensed under CC-BY-NC Multiple Segmentations of Thai Sentences for Neural Machine Translation Alberto Poncelas1, Wichaya Pidchamook2, Chao-Hong Liu3, James Hadley4, Andy Way1 1ADAPT Centre, School of Computing, Dublin City University, Ireland 2SALIS, Dublin City University, Ireland 3Iconic Translation Machines 4Trinity Centre for Literary and Cultural Translation, Trinity College Dublin, Ireland {alberto.poncelas, andy.way}@adaptcentre.ie [email protected], [email protected], [email protected] Abstract Thai is a low-resource language, so it is often the case that data is not available in sufficient quantities to train an Neural Machine Translation (NMT) model which perform to a high level of quality. In addition, the Thai script does not use white spaces to delimit the boundaries between words, which adds more complexity when building sequence to sequence models. In this work, we explore how to augment a set of English–Thai parallel data by replicating sentence-pairs with different word segmentation methods on Thai, as training data for NMT model training. Using different merge operations of Byte Pair Encoding, different segmentations of Thai sentences can be obtained. The experiments show that combining these datasets, performance is improved for NMT models trained with a dataset that has been split using a supervised splitting tool. Keywords: Machine Translation, Word Segmentation, Thai Language In Machine Translation (MT), low-resource languages are 1. Combination of Segmented Texts especially challenging as the amount of parallel data avail- As the encoder-decoder framework deals with a sequence able to train models may not be enough to achieve high of tokens, a way to address the Thai language is to split the translation quality.
    [Show full text]
  • A Clustering-Based Algorithm for Automatic Document Separation
    A Clustering-Based Algorithm for Automatic Document Separation Kevyn Collins-Thompson Radoslav Nickolov School of Computer Science Microsoft Corporation Carnegie Mellon University 1 Microsoft Way 5000 Forbes Avenue Redmond, WA USA Pittsburgh, PA USA [email protected] [email protected] ABSTRACT For text, audio, video, and still images, a number of projects have addressed the problem of estimating inter-object similarity and the related problem of finding transition, or ‘segmentation’ points in a stream of objects of the same media type. There has been relatively little work in this area for document images, which are typically text-intensive and contain a mixture of layout, text-based, and image features. Beyond simple partitioning, the problem of clustering related page images is also important, especially for information retrieval problems such as document image searching and browsing. Motivated by this, we describe a model for estimating inter-page similarity in ordered collections of document images, based on a combination of text and layout features. The features are used as input to a discriminative classifier, whose output is used in a constrained clustering criterion. We do a task-based evaluation of our method by applying it the problem of automatic document separation during batch scanning. Using layout and page numbering features, our algorithm achieved a separation accuracy of 95.6% on the test collection. Keywords Document Separation, Image Similarity, Image Classification, Optical Character Recognition contiguous set of pages, but be scattered into several 1. INTRODUCTION disconnected, ordered subsets that we would like to recombine. Such scenarios are not uncommon when The problem of accurately determining similarity between scanning large volumes of paper: for example, one pages or documents arises in a number of settings when document may be accidentally inserted in the middle of building systems for managing document image another in the queue.
    [Show full text]
  • An Incremental Text Segmentation by Clustering Cohesion
    An Incremental Text Segmentation by Clustering Cohesion Raúl Abella Pérez and José Eladio Medina Pagola Advanced Technologies Application Centre (CENATAV), 7a #21812 e/ 218 y 222, Rpto. Siboney, Playa, C.P. 12200, Ciudad de la Habana, Cuba {rabella, jmedina} @cenatav.co.cu Abstract. This paper describes a new method, called IClustSeg, for linear text segmentation by topic using an incremental overlapped clustering algorithm. Incremental algorithms are able to process new objects as they are added to the collection and, according to the changes, to update the results using previous information. In our approach, we maintain a structure to get an incremental overlapped clustering. The results of the clustering algorithm, when processing a stream, are used any time text segmentation is required, using the clustering cohesion as the criteria for segmenting by topic. We compare our proposal against the best known methods, outperforming significantly these algorithms. 1 Introduction Topic segmentation intends to identify the boundaries in a document with goal of capturing the latent topical structure. The automatic detection of appropriate subtopic boundaries in a document is a very useful task in text processing. For example, in information retrieval and in passages retrieval, to return documents, segments or passages closer to the user’s queries. Another application of topic segmentation is in summarization, where it can be used to select segments of texts containing the main ideas for the summary requested [6]. Many text segmentation methods by topics have been proposed recently. Usually, they obtain linear segmentations, where the output is a document divided into sequences of adjacent segments [7], [9].
    [Show full text]
  • A Text Denormalization Algorithm Producing Training Data for Text Segmentation
    A Text Denormalization Algorithm Producing Training Data for Text Segmentation Kilian Evang Valerio Basile University of Groningen University of Groningen [email protected] [email protected] Johan Bos University of Groningen [email protected] As a first step of processing, text often has to be split into sentences and tokens. We call this process segmentation. It is often desirable to replace rule-based segmentation tools with statistical ones that can learn from examples provided by human annotators who fix the machine's mistakes. Such a statistical segmentation system is presented in Evang et al. (2013). As training data, the system requires the original raw text as well as information about the boundaries between tokens and sentences within this raw text. Although raw as well as segmented versions of text corpora are available for many languages, this required information is often not trivial to obtain because the segmented version differs from the raw one also in other respects. For example, punctuation marks and diacritics have been normalized to canonical forms by human annotators or by rule-based segmentation and normalization tools. This is the case with e.g. the Penn Treebank, the Dutch Twente News Corpus and the Italian PAISA` corpus. This problem of missing alignment between raw and segmented text is also noted by Dridan and Oepen (2012). We present a heuristic algorithm that recovers the alignment and thereby produces standoff annotations marking token and sentence boundaries in the raw test. The algorithm is based on the Levenshtein algorithm and is general in that it does not assume any language-specific normalization conventions.
    [Show full text]
  • Topic Segmentation: Algorithms and Applications
    University of Pennsylvania ScholarlyCommons IRCS Technical Reports Series Institute for Research in Cognitive Science 8-1-1998 Topic Segmentation: Algorithms And Applications Jeffrey C. Reynar University of Pennsylvania Follow this and additional works at: https://repository.upenn.edu/ircs_reports Part of the Databases and Information Systems Commons Reynar, Jeffrey C., "Topic Segmentation: Algorithms And Applications" (1998). IRCS Technical Reports Series. 66. https://repository.upenn.edu/ircs_reports/66 University of Pennsylvania Institute for Research in Cognitive Science Technical Report No. IRCS-98-21. This paper is posted at ScholarlyCommons. https://repository.upenn.edu/ircs_reports/66 For more information, please contact [email protected]. Topic Segmentation: Algorithms And Applications Abstract Most documents are aboutmore than one subject, but the majority of natural language processing algorithms and information retrieval techniques implicitly assume that every document has just one topic. The work described herein is about clues which mark shifts to new topics, algorithms for identifying topic boundaries and the uses of such boundaries once identified. A number of topic shift indicators have been proposed in the literature. We review these features, suggest several new ones and test most of them in implemented topic segmentation algorithms. Hints about topic boundaries include repetitions of character sequences, patterns of word and word n-gram repetition, word frequency, the presence of cue words and phrases and the use of synonyms. The algorithms we present use cues singly or in combination to identify topic shifts in several kinds of documents. One algorithm tracks compression performance, which is an indicator of topic shift because self-similarity within topic segments should be greater than between-segment similarity.
    [Show full text]
  • A Generic Neural Text Segmentation Model with Pointer Network
    Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI-18) SEGBOT: A Generic Neural Text Segmentation Model with Pointer Network Jing Li, Aixin Sun and Shafiq Joty School of Computer Science and Engineering, Nanyang Technological University, Singapore [email protected], {axsun,srjoty}@ntu.edu.sg Abstract [A person]EDU [who never made a mistake]EDU [never tried any- thing new]EDU Text segmentation is a fundamental task in natu- ral language processing that comes in two levels of Figure 1: A sentence with three elementary discourse units (EDUs). granularity: (i) segmenting a document into a se- and Thompson, 1988]. quence of topical segments (topic segmentation), Both topic and EDU segmentation tasks have received a and (ii) segmenting a sentence into a sequence of lot of attention in the past due to their utility in many NLP elementary discourse units (EDU segmentation). tasks. Although related, these two tasks have been addressed Traditional solutions to the two tasks heavily rely separately with different sets of approaches. Both supervised on carefully designed features. The recently propo- and unsupervised methods have been proposed for topic seg- sed neural models do not need manual feature en- mentation. Unsupervised topic segmentation models exploit gineering, but they either suffer from sparse boun- the strong correlation between topic and lexical usage, and dary tags or they cannot well handle the issue of can be broadly categorized into two classes: similarity-based variable size output vocabulary. We propose a ge- models and probabilistic generative models. The similarity- neric end-to-end segmentation model called SEG- based models are based on the key intuition that sentences BOT.SEGBOT uses a bidirectional recurrent neural in a segment are more similar to each other than to senten- network to encode input text sequence.
    [Show full text]
  • Text Segmentation Techniques: a Critical Review
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Sunway Institutional Repository Text Segmentation Techniques: A Critical Review Irina Pak and Phoey Lee Teh Department of Computing and Information Systems, Sunway University, Bandar Sunway, Malaysia [email protected], [email protected] Abstract Text segmentation is widely used for processing text. It is a method of splitting a document into smaller parts, which is usually called segments. Each segment has its relevant meaning. Those segments categorized as word, sentence, topic, phrase or any information unit depending on the task of the text analysis. This study presents various reasons of usage of text segmentation for different analyzing approaches. We categorized the types of documents and languages used. The main contribution of this study includes a summarization of 50 research papers and an illustration of past decade (January 2007- January 2017)’s of research that applied text segmentation as their main approach for analysing text. Results revealed the popularity of using text segmentation in different languages. Besides that, the “word” seems to be the most practical and usable segment, as it is the smaller unit than the phrase, sentence or line. 1 Introduction Text segmentation is process of extracting coherent blocks of text [1]. The segment referred as “segment boundary” [2] or passage [3]. Another two studies referred segment as subtopic [4] and region of interest [5]. There are many reasons why the splitting document can be useful for text analysis. One of the main reasons is because they are smaller and more coherent than whole documents [3].
    [Show full text]
  • Text Segmentation Based on Semantic Word Embeddings
    Text Segmentation based on Semantic Word Embeddings Alexander A Alemi Paul Ginsparg Dept of Physics Depts of Physics and Information Science Cornell University Cornell University [email protected] [email protected] ABSTRACT early algorithm in this class was Choi's C99 algorithm [3] We explore the use of semantic word embeddings [14, 16, in 2000, which also introduced a benchmark segmentation 12] in text segmentation algorithms, including the C99 seg- dataset used by subsequent work. Instead of looking only at nearest neighbor coherence, the C99 algorithm computes mentation algorithm [3, 4] and new algorithms inspired by 1 the distributed word vector representation. By developing a coherence score between all pairs of elements of text, a general framework for discussing a class of segmentation and searches for a text segmentation that optimizes an ob- objectives, we study the effectiveness of greedy versus ex- jective based on that scoring by greedily making a succes- act optimization approaches and suggest a new iterative re- sion of best cuts. Later work by Choi and collaborators finement technique for improving the performance of greedy [4] used distributed representations of words rather than a strategies. We compare our results to known benchmarks bag of words approach, with the representations generated [18, 15, 3, 4], using known metrics [2, 17]. We demonstrate by LSA [8]. In 2001, Utiyama and Ishahara introduced a state-of-the-art performance for an untrained method with statistical model for segmentation and optimized a poste- our Content Vector Segmentation (CVS) on the Choi test rior for the segment boundaries. Moving beyond the greedy set.
    [Show full text]
  • Steps Involved in Text Recognition and Recent Research in OCR; a Study
    International Journal of Recent Technology and Engineering (IJRTE) ISSN: 2277-3878, Volume-8, Issue-1, May 2019 Steps Involved in Text Recognition and Recent Research in OCR; A Study K.Karthick, K.B.Ravindrakumar, R.Francis, S.Ilankannan Abstract: The Optical Character Recognition (OCR) is one of Preprocessing the automatic identification techniques that fulfill the automation Feature Extraction needs in various applications. A machine can read the Recognition information present in natural scenes or other materials in any Post processing form with OCR. The typed and printed character recognition is uncomplicated due to its well-defined size and shape. The In addition to the above steps segmentation and handwriting of individuals differs in the above aspects. So, the morphological processing also involved in the recognition handwritten OCR system faces complexity to learn this difference process. These steps may be added before the feature to recognize a character. In this paper, we discussed the various extraction process. stages in text recognition, handwritten OCR systems classification according to the text type, study on Chinese and II. PREPROCESSING Arabic text recognition as well as application oriented recent research in OCR. The preprocessing is a fundamental stage that is proceeding Index Terms: Edge detection, Optical Character Recognition, OCR, Preprocessing stages, Text Recognition to the stage of feature extraction; it regulates the appropriateness of the outcomes for the consecutive stages. I. INTRODUCTION The OCR success rate is contingent on the success percentage of each stage. The technologyadventfoundan amazing and noble development curve for the last two centuries. For the last A. Factors Affecting the Text Recognition Quality few decades, it is easy in using mouse and keyboard to assist as interfacing device between us and computer.
    [Show full text]
  • Word Sense Disambiguation and Text Segmentation Based on Lexical
    Word Sense i)ismnl}iguati<)n and Text Set mentation Bas(q on I,c×ical (+ohcslOll ()KUMUI{A Manabu, IIONI)A Takeo School of [nforma,tion Science, Japan Advanced Institute of Science a.nd Technology ('l'al.sunokuchi, lshikawa 923-12 Japan) c-nmil: { oku,honda}¢~jaist.ac.ji~ Abstract cohesion is far easier to idenlAfy than reference be- cause 1)oth words in lexical cohesion relation ap- In this paper, we describe ihow word sense am= pear in a text while one word in reference relation biguity can be resolw'.d with the aid of lexical eo- is a pr<mom, or elided and has less information to hesion. By checking ]exical coheshm between the infer the other word in the relation automatically. current word and lexical chains in the order of Based on this observation, we use lexical cohe- the salience, in tandem with getmration of lexica] sion as a linguistic device for discourse analysis. chains~ we realize incretnental word sense disam We call a sequence of words which are in lexieal biguation based on contextual infl)rmation that cohesion relation with each other a Icxical chain lexical chains,reveah Next;, we <le~<:ribe how set like [10]. l,exical chains tend to indicate portions men< boundaries of a text can be determined with of a text; that form a semantic uttit. And so vari.- the aid of lexical cohesion. Wc can measure the ous lexical chains tend to appear in a text corre. plausibility of each point in the text as a segment spou(ling to the change of the topic.
    [Show full text]
  • Multiple Segmentations of Thai Sentences for Neural Machine
    Multiple Segmentations of Thai Sentences for Neural Machine Translation Alberto Poncelas1, Wichaya Pidchamook2, Chao-Hong Liu3, James Hadley4, Andy Way1 1ADAPT Centre, School of Computing, Dublin City University, Ireland 2SALIS, Dublin City University, Ireland 3Iconic Translation Machines 4Trinity Centre for Literary and Cultural Translation, Trinity College Dublin, Ireland {alberto.poncelas, andy.way}@adaptcentre.ie [email protected], [email protected], [email protected] Abstract Thai is a low-resource language, so it is often the case that data is not available in sufficient quantities to train an Neural Machine Translation (NMT) model which perform to a high level of quality. In addition, the Thai script does not use white spaces to delimit the boundaries between words, which adds more complexity when building sequence to sequence models. In this work, we explore how to augment a set of English–Thai parallel data by replicating sentence-pairs with different word segmentation methods on Thai, as training data for NMT model training. Using different merge operations of Byte Pair Encoding, different segmentations of Thai sentences can be obtained. The experiments show that combining these datasets, performance is improved for NMT models trained with a dataset that has been split using a supervised splitting tool. Keywords: Machine Translation, Word Segmentation, Thai Language In Machine Translation (MT), low-resource languages are sentence into words (or tokens). We investigate three split- especially challenging as the amount of parallel data avail- ting strategies: (i) Character-based, using each character as able to train models may not be enough to achieve high token. This is the simplest approach as there is no need to translation quality.
    [Show full text]