Text Segmentation by Cross Segment Attention

Total Page:16

File Type:pdf, Size:1020Kb

Text Segmentation by Cross Segment Attention Text Segmentation by Cross Segment Attention Michal Lukasik, Boris Dadachev, Kishore Papineni, Gonc¸alo Simoes˜ Google Research fmlukasik,bdadachev,papineni,[email protected] Abstract Early life and marriage: Franklin Delano Roosevelt was born on January 30, 1882, in the Document and discourse segmentation are two Hudson Valley town of Hyde Park, New York, to businessman James Roosevelt I and his second wife, Sara Ann Delano. (...) fundamental NLP tasks pertaining to breaking Aides began to refer to her at the time as “the president’s girl- up text into constituents, which are commonly friend”, and gossip linking the two romantically appeared in the used to help downstream tasks such as infor- newspapers. mation retrieval or text summarization. In this (...) work, we propose three transformer-based ar- Legacy: Roosevelt is widely considered to be one of the most important chitectures and provide comprehensive com- figures in the history of the United States, as well as one of the parisons with previously proposed approaches most influential figures of the 20th century. (...) Roosevelt has on three standard datasets. We establish a new also appeared on several U.S. Postage stamps. state-of-the-art, reducing in particular the er- ror rates by a large margin in all cases. We Figure 1: Illustration of text segmentation on the ex- further analyze model sizes and find that we ample of the Wikipedia page of President Roosevelt. can build models with many fewer parameters The aim of document segmentation is breaking the raw while keeping good performance, thus facili- text into a sequence of logically coherent sections (e.g., tating real-world applications. “Early life and marriage” and “Legacy” in our exam- ple). 1 Introduction Text segmentation is a traditional NLP task that A related task called discourse segmentation breaks up text into constituents, according to prede- breaks up pieces of text into sub-sentence elements fined requirements. It can be applied to documents, called Elementary Discourse Units (EDUs). EDUs in which case the objective is to create logically are the minimal units in discourse analysis accord- coherent sub-document units. These units, or seg- ing to the Rhetorical Structure Theory (Mann and ments, can be any structure of interest, such as Thompson, 1988). In Figure2 we show examples paragraphs or sections. This task is often referred of EDU segmentations of sentences. For example, to as document segmentation or sometimes simply the sentence “Annuities are rarely a good idea at the text segmentation. In Figure1 we show one ex- age 35 because of withdrawal restrictions” decom- ample of document segmentation from Wikipedia, poses into the following two EDUs: “Annuities are on which the task is typically evaluated (Koshorek rarely a good idea at the age 35” and “because of et al., 2018; Badjatiya et al., 2018). withdrawal restrictions”, the first one being a state- Documents are often multi-modal, in that they ment and the second one being a justification in the cover multiple aspects and topics; breaking a doc- discourse analysis. In addition to being a key step ument into uni-modal segments can help improve in discourse analysis (Joty et al., 2019), discourse and/or speed up down stream applications. For segmentation has been shown to improve a number example, document segmentation has been shown of downstream tasks, such as text summarization, to improve information retrieval by indexing sub- by helping to identify fine-grained sub-sentence document units instead of full documents (Llopis units that may have different levels of importance et al., 2002; Shtekh et al., 2018). Other applications when creating a summary (Li et al., 2016). such as summarization and information extraction Multiple neural approaches have been recently can also benefit from text segmentation (Koshorek proposed for document and discourse segmenta- et al., 2018). tion. Koshorek et al.(2018) proposed the use of 4707 Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing, pages 4707–4716, November 16–20, 2020. c 2020 Association for Computational Linguistics Sentence 1: 2 Literature review Annuities are rarely a good idea at the age 35 k because of withdrawal restrictions Sentence 2: Document segmentation Many early research Wanted: k An investment k that’s as simple and secure as a efforts were focused on unsupervised text segmen- certificate of deposit k but offers a return k worth getting excited tation, doing so by quantifying lexical cohesion about. within small text segments (Hearst, 1997; Choi, Figure 2: Example discourse segmentations from the 2000). Being hard to precisely define and quan- RST-DT dataset (Carlson et al., 2001). In the segmen- tations, the EDUs are separated by the k character. tify, lexical cohesion has often been approximated by counting word repetitions. Although compu- tationally expensive, unsupervised Bayesian ap- proaches have also been popular (Utiyama and Isa- hierarchical Bi-LSTMs for document segmenta- hara, 2001; Eisenstein, 2009; Mota et al., 2019). tion. Simultaneously, Li et al.(2018) introduced However, unsupervised algorithms suffer from two an attention-based model for both document seg- main drawbacks: they are hard to specialize for a mentation and discourse segmentation, and Wang given domain and in most cases do not naturally et al.(2018) obtained state of the art results on dis- deal with multi-scale issues. Indeed, the desired course segmentation using pretrained contextual segmentation granularity (paragraph, section, chap- embeddings (Peters et al., 2018). Also, a new large- ter, etc.) is necessarily task dependent and super- scale dataset for document segmentation based vised learning provides a way of addressing this on Wikipedia was introduced by Koshorek et al. property. Therefore, supervised algorithms have (2018), providing a much more realistic setup for been a focus of many recent works. evaluation than the previously used small scale and often synthetic datasets such as the Choi dataset In particular, multiple neural approaches have (Choi, 2000). been proposed for the task. In one, a sequence label- ing algorithm is proposed where each sentence is However, these approaches are evaluated on dif- encoded using a Bi-LSTM over tokens, and then a ferent datasets and as such have not been compared Bi-LSTM over sentence encodings is used to label against one another. Furthermore they mostly rely each sentence as ending a segment or not (Koshorek on RNNs instead of the more recent transformers et al., 2018). Authors consider a large dataset based (Vaswani et al., 2017) and in most cases do not on Wikipedia, and report improvements over un- make use of contextual embeddings which have supervised text segmentation methods. In another been shown to help in many classical NLP tasks work, a sequence-to-sequence model is proposed (Devlin et al., 2018). (Li et al., 2018), where the input is encoded using a In this work we aim at addressing these limita- BiGRU and segment endings are generated using a tions and make the following contributions: pointer network (Vinyals et al., 2015). The authors report significant improvements over sequence la- 1. We compare recent approaches that were pro- beling approaches, however on a dataset composed posed independently for text and/or discourse of 700 artificial documents created by concatenat- segmentation (Li et al., 2018; Koshorek et al., ing segments from random articles from the Brown 2018; Wang et al., 2018) on three public corpus (Choi, 2000). Lastly, Badjatiya et al.(2018) datasets. consider an attention-based CNN-Bi-LSTM model 2. We introduce three new model architectures and evaluate it on three small-scale datasets. based on transformers and BERT-style con- textual embeddings to the document and dis- Discourse Segmentation Contrary to document course segmentation tasks. We analyze the segmentation, discourse segmentation has histor- strengths and weaknesses of each architecture ically been framed as a supervised learning task. and establish a new state-of-the-art. However, a challenge of applying supervised ap- 3. We show that a simple paradigm argued for proaches for this type of segmentation is the fact by some of the earliest text segmentation algo- that the available dataset for the task is limited rithms can achieve competitive performance (Carlson et al., 2001). For this reason, approaches in the current neural era. for discourse segmentation usually rely on exter- 4. We conduct ablation studies analyzing the im- nal annotations and resources to help the models portance of context size and model size. generalize. Early approaches to discourse segmen- 4708 tation were based on features from linguistic anno- In Figure 3(a) we illustrate the model. The input tations such as POS tags and parsing trees (Soricut is composed of a [CLS] token, followed by the two and Marcu, 2003; Xuan Bach et al., 2012; Joty contexts concatenated together, and separated by a et al., 2015). The performance of these systems [SEP] token. When necessary, short contexts are was highly dependent on the quality of the annota- padded to the left or to the right with [PAD] tokens. tions. [CLS], [SEP] and [PAD] are special tokens intro- Recent approaches started to rely on end-to-end duced by BERT (Devlin et al., 2018). They stand neural network models that do not need linguistic for, respectively, ”classification token” (since it is annotations to obtain high-quality results, relying typically for classification tasks, as a representation instead on pretrained models to obtain word or of the entire input sequence), ”separator token” and sentence representations. An example of such work ”padding token”. The input is then fed into a trans- is by Li et al.(2018), which proposes a sequence- former encoder (Vaswani et al., 2017), which is ini- to-sequence model getting a sequence of GloVe tialized with the publicly available BERTLARGE (Pennington et al., 2014) word embeddings as input model.
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]