DOCSLIB.ORG

A Structured Language Model

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Structured Language Model A Structured Language Model Ciprian Chelba The Johns Hopkins University CLSP, Barton Hall 320 3400 N. Charles Street, Baltimore, MD-21218 chelba@j hu. edu Abstract The paper presents a language model that develops syntactic structure and uses it to the dog I heard yesterday barked extract meaningful information from the word history, thus enabling the use of Figure 1: Partial parse long distance dependencies. The model as- signs probability to every joint sequence '¢"~.( ~ I h_{-=*l ) ~_{-I [ h_O of words-binary-parse-structure with head- word annotation. The model, its proba- bilistic parametrization, and a set of ex- ~ w_l ... w..p ........ w q...w~r w_lr+ll ...w_k w_lk+l} ..... w_n </s> periments meant to evaluate its predictive power are presented. Figure 2: A word-parse k-prefix 1 Introduction past. The correct partial parse of the word his- tory when predicting barked is shown in Figure 1. The main goal of the proposed project is to develop The word dog is called the headword of the con- a language model(LM) that uses syntactic structure. stituent ( the (dog (...) )) and dog is an exposed The principles that guided this propo§al were: headword when predicting barked -- topmost head- • the model will develop syntactic knowledge as a word in the largest constituent that contains it. The built-in feature; it will assign a probability to every syntactic structure in the past filters out irrelevant joint sequence of words-binary-parse-structure; words and points to the important ones, thus en- • the model should operate in a left-to-right man- abling the use of long distance information when ner so that it would be possible to decode word lat- predicting the next word. Our model will assign a tices provided by an automatic speech recognizer. probability P(W, T) to every sentence W with ev- The model consists of two modules: a next word ery possible binary branching parse T and every predictor which makes use of syntactic structure as possible headword annotation for every constituent developed by a parser. The operations of these two of T. Let W be a sentence of length I words to modules are intertwined. which we have prepended <s> and appended </s> so that wo =<s> and wl+l =</s>. Let Wk be the 2 The Basic Idea and Terminology word k-prefix w0... wk of the sentence and WkT~ Consider predicting the word barked in the sen- the word-parse k-prefix. To stress this point, a tence: word-parse k-prefix contains only those binary trees the dog I heard yesterday barked again. whose span is completely included in the word k- A 3-gram approach would predict barked from prefix, excluding wo =<s>. Single words can be re- (heard, yesterday) whereas it is clear that the garded as root-only trees. Figure 2 shows a word- predictor should use the word dog which is out- parse k-prefix; h_0 .. h_{-m} are the exposed head- side the reach of even 4-grams. Our assumption words. A complete parse -- Figure 3 -- is any bi- is that what enables us to make a good predic- nary parse of the wl ... wi </s> sequence with the tion of barked is the syntactic structure in the restriction that </s> is the only allowed headword. 498 ~D h_{-2 } h_{-I } h_O <s> w_l ...... w_l </s> Figure 3: Complete parse Figure 4: Before an adjoin operation h.~(-z ) -- h_(-2) h._o. h._(- x ) Note that (wl...wi) needn't be a constituent, but for the parses where it is, there is no restriction on which of its words is the headword. The model will operate by means of two modules: Figure 5: Result of adjoin-left • PREDICTOR predicts the next word wk+l given h'_{*t ).h_(o2) h*_O -- n_O the word-parse k-prefix and then passes control to h_ . the PARSER; • PARSER grows the already existing binary .......... branching structure by repeatedly generating the transitions adjoin-left or adjoin-right until it Figure 6: Result of adjoin-right passes control to the PREDICTOR by taking a null transition. The operations performed by the PARSER en- • t~ denotes the i-th PARSER operation carried sure that all possible binary branching parses with out at position k in the word string; all possible headword assignments for the w~... wk tk E {adjoin-left,adjoin-right},i < Nk , word sequence can be generated. They are illus- =null, i = Nk trated by Figures 4-6. The following algorithm de- Our model is based on two probabilities: scribes how the model generates a word sequence P(wk/Wk-lTk-1) (1) with a complete parse (see Figures 3-6 for notation): P(t~/Wk, Wk-lTk-1, t~... t~_l) (2) Transition t; // a PARSER transition generate <s> ; As can be seen (wk, Wk-lTk-1, t k ...ti_l)k is one do{ of the Nk word-parse k-prefixes of WkTk, i = 1, Nk predict next_word; //PREDICTOR at position k in the sentence. do{ //PARSER To ensure a proper probabilistic model we have if(T_{-l} != <s> ) to make sure that (1) and (2) are well defined con- if(h_0 == </s>) t = adjoin-right; ditional probabilities and that the model halts with else t = {adjoin-{left,right}, null}; probability one. A few provisions need to be taken: else I; = null; • P(null/WkTk) = 1, if T_{-1} == <s> ensures }while(t != null) that <s> is adjoined in the last step of the parsing }while(!(h_0 == </s> &E T_{-1} == <s>)) process; t = adjoin-right; // adjoin <s>; DONE • P(adjoin-right/WkTk) = 1, if h_0 == </s> It is easy to see that any given word sequence with a ensures that the headword of a complete parse is possible parse and headword annotation is generated <Is>; by a unique sequence of model actions. • 3~ > Os.t. P(wk=</s>/Wk-lT~-l) >_ e, VWk-lTk-1 ensures that the model halts with probability one. 3 Probabilistic Model The probability P(W, T) can be broken into: 3.1 The first model 1+1 p P(W,T) = l-L=1[ (wk/Wk-lTk-1)" The first term (1) can be reduced to an n-gram LM, ~]~21 P ( tk l wk, Wk- , Tk-1, t~ . t~_l) ] where: P(w~/W~-lTk-1) = P(wk/W~-l... Wk-n+l). • Wk-lTk-1 is the word-parse (k - 1)-prefix A simple alternative to this degenerate approach • wk is the word predicted by PP~EDICTOR would be to build a model which predicts the next • Nk - 1 is the number of adjoin operations the word based on the preceding p-1 exposed headwords PARSER executes before passing control to the and n-1 words in the history, thus making the fol- PREDICTOR (the N~-th operation at position k is lowing equivalence classification: the null transition); N~ is a function of T [WkTk] = {h_O .. h_{-p+2},iUk-l..Wk-n+ 1 }. 499 The approach is similar to the trigger LM(Lau93), the number of parameters for each of the 4 models the difference being that in the present work triggers described. are identified using the syntactic structure. H LM PP [ parara H LM PP param II 3.2 The second model Model (2) assigns probability to different binary H 312 206540 h 410 102437 parses of the word k-prefix by chaining the ele- mentary operations described above. The workings Table 1: Perplexity results of the PARSER are very similar to those of Spat- ter (Jelinek94). It can be brought to the full power of Spatter by changing the action of the adjoin 5 Acknowledgements operation so that it takes into account the termi- The author thanks to Frederick Jelinek, Sanjeev nal/nonterminal labels of the constituent proposed Khudanpur, Eric Ristad and all the other members by adjoin and it also predicts the nonterminal la- of the Dependency Modeling Group (Stolcke97), bel of the newly created constituent; PREDICTOR WS96 DoD Workshop at the Johns Hopkins Uni- will now predict the next word along with its POS versity. tag. The best equivalence classification of the WkTk word-parse k-prefix is yet to be determined. The Collins parser (Collins96) shows that dependency- References grammar-like bigram constraints may be the most Michael John Collins. 1996. A new statistical parser adequate, so the equivalence classification [WkTk] based on bigram lexical dependencies. In Pro- should contain at least (h_0, h_{-1}}. ceedings of the 3~th Annual Meeting of the As- sociation for Computational Linguistics, 184-191, 4 Preliminary Experiments Santa Cruz, CA. Assuming that the correct partial parse is a func- Frederick Jelinek. 1997. Information extraction from tion of the word prefix, it makes sense to compare speech and text -- course notes. The Johns Hop- the word level perplexity(PP) of a standard n-gram kins University, Baltimore, MD. LM with that of the P(wk/Wk-ITk-1) model. We Frederick Jelinek, John Lafferty, David M. Mager- developed and evaluated four LMs: man, Robert Mercer, Adwait Ratnaparkhi, Salim • 2 bigram LMs P(wk/Wk-lTk-1) = P(Wk/Wk-1) Roukos. 1994. Decision Tree Parsing using a Hid- referred to as W and w, respectively; wk-1 is the pre- den Derivational Model. In Proceedings of the vious (word, POStag) pair; Human Language Technology Workshop, 272-277. • 2 P(wk/Wk-ITk--1) = P(wjho) models, re- ARPA. ferred to as H and h, respectively; h0 is the previous Raymond Lau, Ronald Rosenfeld, and Salim exposed (headword, POS/non-term tag) pair; the Roukos. 1993.
Load more

Recommended publications
  • Knowledge-Powered Deep Learning for Word Embedding
    Knowledge-Powered Deep Learning for Word Embedding Jiang Bian, Bin Gao, and Tie-Yan Liu Microsoft Research {jibian,bingao,tyliu}@microsoft.com Abstract. The basis of applying deep learning to solve natural language process- ing tasks is to obtain high-quality distributed representations of words, i.e., word embeddings, from large amounts of text data. However, text itself usually con- tains incomplete and ambiguous information, which makes necessity to leverage extra knowledge to understand it. Fortunately, text itself already contains well- defined morphological and syntactic knowledge; moreover, the large amount of texts on the Web enable the extraction of plenty of semantic knowledge. There- fore, it makes sense to design novel deep learning algorithms and systems in order to leverage the above knowledge to compute more effective word embed- dings. In this paper, we conduct an empirical study on the capacity of leveraging morphological, syntactic, and semantic knowledge to achieve high-quality word embeddings. Our study explores these types of knowledge to define new basis for word representation, provide additional input information, and serve as auxiliary supervision in deep learning, respectively. Experiments on an analogical reason- ing task, a word similarity task, and a word completion task have all demonstrated that knowledge-powered deep learning can enhance the effectiveness of word em- bedding. 1 Introduction With rapid development of deep learning techniques in recent years, it has drawn in- creasing attention to train complex and deep models on large amounts of data, in order to solve a wide range of text mining and natural language processing (NLP) tasks [4, 1, 8, 13, 19, 20].
    [Show full text]
  • Recurrent Neural Network Based Language Model
    INTERSPEECH 2010 Recurrent neural network based language model Toma´sˇ Mikolov1;2, Martin Karafiat´ 1, Luka´sˇ Burget1, Jan “Honza” Cernockˇ y´1, Sanjeev Khudanpur2 1Speech@FIT, Brno University of Technology, Czech Republic 2 Department of Electrical and Computer Engineering, Johns Hopkins University, USA fimikolov,karafiat,burget,[email protected], [email protected] Abstract INPUT(t) OUTPUT(t) A new recurrent neural network based language model (RNN CONTEXT(t) LM) with applications to speech recognition is presented. Re- sults indicate that it is possible to obtain around 50% reduction of perplexity by using mixture of several RNN LMs, compared to a state of the art backoff language model. Speech recognition experiments show around 18% reduction of word error rate on the Wall Street Journal task when comparing models trained on the same amount of data, and around 5% on the much harder NIST RT05 task, even when the backoff model is trained on much more data than the RNN LM. We provide ample empiri- cal evidence to suggest that connectionist language models are superior to standard n-gram techniques, except their high com- putational (training) complexity. Index Terms: language modeling, recurrent neural networks, speech recognition CONTEXT(t-1) 1. Introduction Figure 1: Simple recurrent neural network. Sequential data prediction is considered by many as a key prob- lem in machine learning and artificial intelligence (see for ex- ample [1]). The goal of statistical language modeling is to plex and often work well only for systems based on very limited predict the next word in textual data given context; thus we amounts of training data.
    [Show full text]
  • Unified Language Model Pre-Training for Natural
    Unified Language Model Pre-training for Natural Language Understanding and Generation Li Dong∗ Nan Yang∗ Wenhui Wang∗ Furu Wei∗† Xiaodong Liu Yu Wang Jianfeng Gao Ming Zhou Hsiao-Wuen Hon Microsoft Research {lidong1,nanya,wenwan,fuwei}@microsoft.com {xiaodl,yuwan,jfgao,mingzhou,hon}@microsoft.com Abstract This paper presents a new UNIfied pre-trained Language Model (UNILM) that can be fine-tuned for both natural language understanding and generation tasks. The model is pre-trained using three types of language modeling tasks: unidirec- tional, bidirectional, and sequence-to-sequence prediction. The unified modeling is achieved by employing a shared Transformer network and utilizing specific self-attention masks to control what context the prediction conditions on. UNILM compares favorably with BERT on the GLUE benchmark, and the SQuAD 2.0 and CoQA question answering tasks. Moreover, UNILM achieves new state-of- the-art results on five natural language generation datasets, including improving the CNN/DailyMail abstractive summarization ROUGE-L to 40.51 (2.04 absolute improvement), the Gigaword abstractive summarization ROUGE-L to 35.75 (0.86 absolute improvement), the CoQA generative question answering F1 score to 82.5 (37.1 absolute improvement), the SQuAD question generation BLEU-4 to 22.12 (3.75 absolute improvement), and the DSTC7 document-grounded dialog response generation NIST-4 to 2.67 (human performance is 2.65). The code and pre-trained models are available at https://github.com/microsoft/unilm. 1 Introduction Language model (LM) pre-training has substantially advanced the state of the art across a variety of natural language processing tasks [8, 29, 19, 31, 9, 1].
    [Show full text]
  • Hello, It's GPT-2
    Hello, It’s GPT-2 - How Can I Help You? Towards the Use of Pretrained Language Models for Task-Oriented Dialogue Systems Paweł Budzianowski1;2;3 and Ivan Vulic´2;3 1Engineering Department, Cambridge University, UK 2Language Technology Lab, Cambridge University, UK 3PolyAI Limited, London, UK [email protected], [email protected] Abstract (Young et al., 2013). On the other hand, open- domain conversational bots (Li et al., 2017; Serban Data scarcity is a long-standing and crucial et al., 2017) can leverage large amounts of freely challenge that hinders quick development of available unannotated data (Ritter et al., 2010; task-oriented dialogue systems across multiple domains: task-oriented dialogue models are Henderson et al., 2019a). Large corpora allow expected to learn grammar, syntax, dialogue for training end-to-end neural models, which typ- reasoning, decision making, and language gen- ically rely on sequence-to-sequence architectures eration from absurdly small amounts of task- (Sutskever et al., 2014). Although highly data- specific data. In this paper, we demonstrate driven, such systems are prone to producing unre- that recent progress in language modeling pre- liable and meaningless responses, which impedes training and transfer learning shows promise their deployment in the actual conversational ap- to overcome this problem. We propose a task- oriented dialogue model that operates solely plications (Li et al., 2017). on text input: it effectively bypasses ex- Due to the unresolved issues with the end-to- plicit policy and language generation modules. end architectures, the focus has been extended to Building on top of the TransferTransfo frame- retrieval-based models.
    [Show full text]
  • N-Gram Language Modeling Tutorial Dustin Hillard and Sarah Petersen Lecture Notes Courtesy of Prof
    N-gram Language Modeling Tutorial Dustin Hillard and Sarah Petersen Lecture notes courtesy of Prof. Mari Ostendorf Outline: • Statistical Language Model (LM) Basics • n-gram models • Class LMs • Cache LMs • Mixtures • Empirical observations (Goodman CSL 2001) • Factored LMs Part I: Statistical Language Model (LM) Basics • What is a statistical LM and why are they interesting? • Evaluating LMs • History equivalence classes What is a statistical language model? A stochastic process model for word sequences. A mechanism for computing the probability of: p(w1, . , wT ) 1 Why are LMs interesting? • Important component of a speech recognition system – Helps discriminate between similar sounding words – Helps reduce search costs • In statistical machine translation, a language model characterizes the target language, captures fluency • For selecting alternatives in summarization, generation • Text classification (style, reading level, language, topic, . ) • Language models can be used for more than just words – letter sequences (language identification) – speech act sequence modeling – case and punctuation restoration 2 Evaluating LMs Evaluating LMs in the context of an application can be expensive, so LMs are usually evaluated on the own in terms of perplexity:: ˜ 1 PP = 2Hr where H˜ = − log p(w , . , w ) r T 2 1 T where {w1, . , wT } is held out test data that provides the empirical distribution q(·) in the cross-entropy formula H˜ = − X q(x) log p(x) x and p(·) is the LM estimated on a training set. Interpretations: • Entropy rate: lower entropy means that it is easier to predict the next symbol and hence easier to rule out alternatives when combined with other models small H˜r → small PP • Average branching factor: When a distribution is uniform for a vocabulary of size V , then entropy is log2 V , and perplexity is V .
    [Show full text]
  • A General Language Model for Information Retrieval Fei Song W
    A General Language Model for Information Retrieval Fei Song W. Bruce Croft Dept. of Computing and Info. Science Dept. of Computer Science University of Guelph University of Massachusetts Guelph, Ontario, Canada N1G 2W1 Amherst, Massachusetts 01003 [email protected] [email protected] ABSTRACT However, estimating the probabilities of word sequences can be expensive, since sentences can be arbitrarily long and the size of Statistical language modeling has been successfully used for a corpus needs to be very large. In practice, the statistical speech recognition, part-of-speech tagging, and syntactic parsing. language model is often approximated by N-gram models. Recently, it has also been applied to information retrieval. Unigram: P(w ) = P(w )P(w ) ¡ P(w ) According to this new paradigm, each document is viewed as a 1,n 1 2 n language sample, and a query as a generation process. The Bigram: P(w ) = P(w )P(w | w ) ¡ P(w | w ) retrieved documents are ranked based on the probabilities of 1,n 1 2 1 n n−1 producing a query from the corresponding language models of Trigram: P(w ) = P(w )P(w | w )P(w | w ) ¡ P(w | w ) these documents. In this paper, we will present a new language 1,n 1 2 1 3 1,2 n n−2,n−1 model for information retrieval, which is based on a range of data The unigram model makes a strong assumption that each word smoothing techniques, including the Good-Turing estimate, occurs independently, and consequently, the probability of a curve-fitting functions, and model combinations.
    [Show full text]
  • A Unified Multilingual Handwriting Recognition System Using
    1 A Unified Multilingual Handwriting Recognition System using multigrams sub-lexical units Wassim Swaileha,∗, Yann Soullarda, Thierry Paqueta aLITIS Laboratory - EA 4108 Normandie University - University of Rouen Rouen, France ABSTRACT We address the design of a unified multilingual system for handwriting recognition. Most of multi- lingual systems rests on specialized models that are trained on a single language and one of them is selected at test time. While some recognition systems are based on a unified optical model, dealing with a unified language model remains a major issue, as traditional language models are generally trained on corpora composed of large word lexicons per language. Here, we bring a solution by con- sidering language models based on sub-lexical units, called multigrams. Dealing with multigrams strongly reduces the lexicon size and thus decreases the language model complexity. This makes pos- sible the design of an end-to-end unified multilingual recognition system where both a single optical model and a single language model are trained on all the languages. We discuss the impact of the language unification on each model and show that our system reaches state-of-the-art methods perfor- mance with a strong reduction of the complexity. c 2018 Elsevier Ltd. All rights reserved. 1. Introduction Offline handwriting recognition is a challenging task due to the high variability of data, as writing styles, the quality of the input image and the lack of contextual information. The recognition is commonly done in two steps. First, an optical character recognition (OCR) model is optimized for recognizing sequences of characters from input images of handwritten texts (Plotz¨ and Fink (2009); Singh (2013)).
    [Show full text]
  • Word Embeddings: History & Behind the Scene
    Word Embeddings: History & Behind the Scene Alfan F. Wicaksono Information Retrieval Lab. Faculty of Computer Science Universitas Indonesia References • Bengio, Y., Ducharme, R., Vincent, P., & Janvin, C. (2003). A Neural Probabilistic Language Model. The Journal of Machine Learning Research, 3, 1137–1155. • Mikolov, T., Corrado, G., Chen, K., & Dean, J. (2013). Efficient Estimation of Word Representations in Vector Space. Proceedings of the International Conference on Learning Representations (ICLR 2013), 1–12 • Mikolov, T., Chen, K., Corrado, G., & Dean, J. (2013). Distributed Representations of Words and Phrases and their Compositionality. NIPS, 1–9. • Morin, F., & Bengio, Y. (2005). Hierarchical Probabilistic Neural Network Language Model. Aistats, 5. References Good weblogs for high-level understanding: • http://sebastianruder.com/word-embeddings-1/ • Sebastian Ruder. On word embeddings - Part 2: Approximating the Softmax. http://sebastianruder.com/word- embeddings-softmax • https://www.tensorflow.org/tutorials/word2vec • https://www.gavagai.se/blog/2015/09/30/a-brief-history-of- word-embeddings/ Some slides were also borrowed from From Dan Jurafsky’s course slide: Word Meaning and Similarity. Stanford University. Terminology • The term “Word Embedding” came from deep learning community • For computational linguistic community, they prefer “Distributional Semantic Model” • Other terms: – Distributed Representation – Semantic Vector Space – Word Space https://www.gavagai.se/blog/2015/09/30/a-brief-history-of-word-embeddings/ Before we learn Word Embeddings... Semantic Similarity • Word Similarity – Near-synonyms – “boat” and “ship”, “car” and “bicycle” • Word Relatedness – Can be related any way – Similar: “boat” and “ship” – Topical Similarity: • “boat” and “water” • “car” and “gasoline” Why Word Similarity? • Document Classification • Document Clustering • Language Modeling • Information Retrieval • ..
    [Show full text]
  • Language Modelling for Speech Recognition
    Language Modelling for Speech Recognition • Introduction • n-gram language models • Probability estimation • Evaluation • Beyond n-grams 6.345 Automatic Speech Recognition Language Modelling 1 Language Modelling for Speech Recognition • Speech recognizers seek the word sequence Wˆ which is most likely to be produced from acoustic evidence A P(Wˆ |A)=m ax P(W |A) ∝ max P(A|W )P(W ) W W • Speech recognition involves acoustic processing, acoustic modelling, language modelling, and search • Language models (LMs) assign a probability estimate P(W ) to word sequences W = {w1,...,wn} subject to � P(W )=1 W • Language models help guide and constrain the search among alternative word hypotheses during recognition 6.345 Automatic Speech Recognition Language Modelling 2 Language Model Requirements � Constraint Coverage � NLP Understanding � 6.345 Automatic Speech Recognition Language Modelling 3 Finite-State Networks (FSN) show me all the flights give restaurants display • Language space defined by a word network or graph • Describable by a regular phrase structure grammar A =⇒ aB | a • Finite coverage can present difficulties for ASR • Graph arcs or rules can be augmented with probabilities 6.345 Automatic Speech Recognition Language Modelling 4 Context-Free Grammars (CFGs) VP NP V D N display the flights • Language space defined by context-free rewrite rules e.g., A =⇒ BC | a • More powerful representation than FSNs • Stochastic CFG rules have associated probabilities which can be learned automatically from a corpus • Finite coverage can present difficulties
    [Show full text]
  • A Pretrained Language Model for Scientific Text
    SCIBERT: A Pretrained Language Model for Scientific Text Iz Beltagy Kyle Lo Arman Cohan Allen Institute for Artificial Intelligence, Seattle, WA, USA fbeltagy,kylel,[email protected] Abstract neural architectures. Leveraging the success of un- supervised pretraining has become especially im- Obtaining large-scale annotated data for NLP portant especially when task-specific annotations tasks in the scientific domain is challenging are difficult to obtain, like in scientific NLP. Yet and expensive. We release SCIBERT, a pre- while both BERT and ELMo have released pre- trained language model based on BERT (De- vlin et al., 2019) to address the lack of high- trained models, they are still trained on general do- quality, large-scale labeled scientific data. main corpora such as news articles and Wikipedia. SCIBERT leverages unsupervised pretraining In this work, we make the following contribu- on a large multi-domain corpus of scien- tions: tific publications to improve performance on (i) We release SCIBERT, a new resource demon- downstream scientific NLP tasks. We eval- strated to improve performance on a range of NLP uate on a suite of tasks including sequence tasks in the scientific domain. SCIBERT is a pre- tagging, sentence classification and depen- dency parsing, with datasets from a variety trained language model based on BERT but trained of scientific domains. We demonstrate sta- on a large corpus of scientific text. tistically significant improvements over BERT (ii) We perform extensive experimentation to and achieve new state-of-the-art results on sev- investigate the performance of finetuning ver- eral of these tasks. The code and pretrained sus task-specific architectures atop frozen embed- models are available at https://github.
    [Show full text]
  • Improving Text Recognition Using Optical and Language Model Writer Adaptation
    Improving text recognition using optical and language model writer adaptation Yann Soullard, Wassim Swaileh, Pierrick Tranouez, Thierry Paquet Clement´ Chatelain LITIS lab LITIS lab Normandie University, Universite de Rouen Normandie INSA Rouen Normandie 76800 Saint Etienne du Rouvray, France 76800 Saint Etienne du Rouvray, France Email: ffi[email protected] Email: [email protected] Abstract—State-of-the-art methods for handwriting text shown to be very efficient on various recognition tasks recognition are based on deep learning approaches and lan- such as handwriting recognition, signature identification or guage modeling that require large data sets during training. medical imaging [4], [5]. In addition, the language itself, but In practice, there are some applications where the system processes mono-writer documents, and would thus benefit from also lexicons as well as word frequencies may not match being trained on examples from that writer. However, this is the statistical distributions learned during language model not common to have numerous examples coming from just one training. Statistical language model adaptation algorithms writer. In this paper, we propose an approach to adapt both the [6] have also been designed in this respect. optical model and the language model to a particular writer, This paper presents an approach to adapt a generic text from a generic system trained on large data sets with a variety of examples. We show the benefits of the optical and language recognition system to a particular writer. In this respect, both model writer adaptation. Our approach reaches competitive the optical model and the language model of the generic sys- results on the READ 2018 data set, which is dedicated to model tem are considered during the adaptation phase.
    [Show full text]
  • Exploring the Limits of Language Modeling
    Exploring the Limits of Language Modeling Rafal Jozefowicz [email protected] Oriol Vinyals [email protected] Mike Schuster [email protected] Noam Shazeer [email protected] Yonghui Wu [email protected] Google Brain Abstract language models improves the underlying metrics of the In this work we explore recent advances in Re- downstream task (such as word error rate for speech recog- current Neural Networks for large scale Lan- nition, or BLEU score for translation), which makes the guage Modeling, a task central to language un- task of training better LMs valuable by itself. derstanding. We extend current models to deal Further, when trained on vast amounts of data, language with two key challenges present in this task: cor- models compactly extract knowledge encoded in the train- pora and vocabulary sizes, and complex, long ing data. For example, when trained on movie subti- term structure of language. We perform an ex- tles (Serban et al., 2015; Vinyals & Le, 2015), these lan- haustive study on techniques such as character guage models are able to generate basic answers to ques- Convolutional Neural Networks or Long-Short tions about object colors, facts about people, etc. Lastly, Term Memory, on the One Billion Word Bench- recently proposed sequence-to-sequence models employ mark. Our best single model significantly im- conditional language models (Mikolov & Zweig, 2012) as proves state-of-the-art perplexity from 51.3 down their key component to solve diverse tasks like machine to 30.0 (whilst reducing the number of param- translation (Sutskever et al., 2014; Cho et al., 2014; Kalch- eters by a factor of 20), while an ensemble of brenner et al., 2014) or video generation (Srivastava et al., models sets a new record by improving perplex- 2015a).
    [Show full text]