From Machine Translation to Computer Assisted Translation using Finite-State Models
|
|
- Andrew Ferguson
- 6 years ago
- Views:
Transcription
1 From Machine Translaion o Compuer Assised Translaion using Finie-Sae Models Jorge Civera, Elsa Cubel, Anonio L. Lagarda, David Picó, Jorge González, Enrique Vidal, Francisco Casacubera Insiuo Tecnológico de Informáica Dpo. de Sisemas Informáicos y Compuación, Universidad Poliécnica de Valencia E Valencia, Spain jorcisai@ii.upv.es Juan M. Vilar, Sergio Barrachina Dpo. de Lenguajes y Sisemas Informáicos, Universidad Jaime I, E Casellón de la Plana, Spain jvilar@lsi.uji.es Absrac Sae-of-he-ar machine ranslaion echniques are sill far from producing high qualiy ranslaions. This drawback leads us o inroduce an alernaive approach o he ranslaion problem ha brings human experise ino he machine ranslaion scenario. In his framework, namely Compuer Assised Translaion (CAT), human ranslaors inerac wih a ranslaion sysem, as an assisance ool, ha dinamically offers, a lis of ranslaions ha bes complees he par of he senence already ranslaed. In his paper, finie sae ransducers are presened as a candidae echnology in he CAT paradigm. The appropriaeness of his echnique is evaluaed on a priner manual corpus and resuls from preliminary experimens confirm ha human ranslaors would reduce o less han 25% he amoun of work o be done for he same ask. 1 Inroducion Sae-of-he-ar machine ranslaion echniques are sill far from producing high qualiy ranslaions. This drawback leads us o inroduce an alernaive approach o he ranslaion problem ha brings human experise ino he machine ranslaion scenario. (Langlais e al., 2000) proposed his idea ha can be illusraed as follows. Iniially, he human ranslaor is provided wih a possible ranslaion for he senence o be ranslaed. Unforunaely in mos of he cases, his ranslaion is no perfec, so he ranslaor amends i and asks for a ranslaion of he par of he senence sill o be ranslaed (compleion). This laer ineracion is repeaed as many imes as needed unil he final ranslaion is achieved. The scenario described in he previous paragraph, can be seen as an ieraive refinemen of he ranslaions offered by he ranslaion sysem, ha wihou possessing he desired qualiy, help he ranslaor o increase his/her produciviy. Nowadays, his lack of ranslaion excellence is a common characerisic in all machine ranslaion sysems. Therefore, he human-machine synergy represened by he CAT paradigm seems o be more promising han fully-auomaic ranslaion in he near fuure. The CAT paradigm has wo imporan aspecs: he models need o provide adequae compleions and hey have o do so efficienly o perform under usabiliy consrains. To fulfill hese wo requiremens, Sochasic Finie Sae Transducers (SFST) have been seleced since hey have proved in he pas o be able o provide adequae ranslaions (Vidal, 1997; Knigh and Al-Onaizan, 1998; Amengual e al., 2000; Casacubera e al., 2001; Bangalore and Ricardi, 2001). In addiion, efficien parsing algorihms can be easily adaped in order o provide compleions. The res of he paper is srucured as follows. The following secion inroduces he general seing for machine ranslaion and finie sae models. In secion 3, he search procedure for an ineracive ranslaion is presened. Experimenal resuls are presened in secion 4. Finally, some conclusions and fuure work are explained in secion 5. 2 Machine ranslaion wih finie-sae ransducers Given a source senence, he goal of MT is o find a arge senence ha maximizes:
2 & argmax s argmax s (1) The join disribuion s can be modeled by a Sochasic Finie Sae Transducer Casacubera, 2001): argmax (Picó and s argmax s (2) A Sochasic Finie-Sae Transducer (SFST) is a finie-sae nework whose ransiions are labeled by hree iems: 1. a source symbol (a word from he source language vocabulary); 2. a arge sring (a sequence of words from he arge language vocabulary) and 3. a ransiion probabiliy. They have been successfully applied ino many ranslaion asks (Vidal, 1997; Amengual e al., 2000; Casacubera e al., 2001). Furhermore, here exis efficien search algorihms like Vierbi (Vierbi, 1967) for he bes pah and he Recursive Enumeraion Algorihm (REA) (Jiménez and Marzal, 1999) for he -bes pahs. One possible way of inferring SFSTs is he Grammaical Inference and Alignmens for Transducer Inference (GIATI) echnique (he previous name of his echnique was MGTI - Morphic- Generaor Transducer Inference) (Casacubera e al., 2004). Given a finie sample of sring pairs, i works in hree seps: 1. Building raining srings. Each raining pair is ransformed ino a single sring from an exended alphabe o obain a new sample of srings. The exended alphabe conains words or subsrings from source and arge senences coming from raining pairs. 2. Inferring a (sochasic) regular grammar. Typically, smoohed -gram is inferred from he sample of srings obained in he previous sep. 3. Transforming he inferred regular grammar ino a ransducer. The symbols associaed o he grammar rules are ransformed ino source/arge symbols by applying an adequae ransformaion, hereby ransforming he grammar inferred in he previous sep ino a ransducer. The ransformaion of a parallel corpus ino a corpus of single senences is performed wih he help of saisical alignmens: each word is joined wih is ranslaion in he oupu senence, creaing an exended word. This joining is done aking care no o inver he order of he oupu words. The hird sep is rivial wih his arrangemen. In our experimens, he alignmens are obained using he GIZA sofware (Och and Ney, 2000; Al-Onaizan e al., 1999), which implemens IBM saisical models (Brown e al., 1993). 3 Ineracive search The concep of ineracive search is closely relaed o he CAT paradigm. This paradigm inroduces he new facor ino he general machine ranslaion equaion (Equaion 1). represens a prefix in he arge language obained as a resul of he ineracion beween he human ranslaor and he machine ranslaion sysem. As a side effec of his reformulaion, he opimizaion defined in Equaion 3 is performed over he se of arge suffixes raher han he se of complee arge senences. Thence, he goal of CAT in he finie-sae ransducer framework is o find a predicion of he bes suffix, given a source senence s, a prefix of he arge senence and a SFST : argmax s "!# #$ argmax % s!#& (' s! (3) argmax A ransducer can be undersood as a weighed graph in which every pah is a possible source-arge senence pair represened in a compac manner. Given a source senence s o be ranslaed, his senence is iniially employed o define a se of pahs in he ransducer, whose sequence of source symbols is compaible wih he source senence. Equaion 3 is jus defining he mos probable pah (arge suffix ) among hose ha are compaible, having as a arge prefix.
3 "paper" (0.4) 10 "." ( ) "(null)" ( ) 3 "(null)" ( ) 9 "." ( ) "load" (0.28) 0 1 "he" ( ) 2 "paper" ( ) "paper" ( ) "sock" ( ) 7 8 "nealy" (1) "." (1) 6 "." (1) 11 f=1 "(null)" ( ) 5 "." (1) "." (1) 4. Figure 1: Resulan word graph given he source senence cargue el papel The search for his pah (he produc of he probabiliies associaed wih is edges is maximum) is performed according o he Vierbi decoding over he se of pahs ha were compaible wih he source senence. The concaenaion of he arge symbols of his bes pah will give place o he arge senence (ranslaion). The soluion o he search problem has been devised in wo phases. The firs one copes wih he exracion of a word graph from a SFST given a source senence s. A word graph represens he se of pahs whose sequence of source symbols is compaible wih he source senence s. The second phase involves he search for he bes ranslaion over he word graph. To be more precise, in he presen work he concep of bes ranslaion has been exended o a se of bes ranslaions (n-bes ranslaions). This search can be carried ou efficienly aking ino accoun no only he a poseriori probabiliy of a given ranslaion, bu also he minimum edi cos wih respec o he arge prefix. The way in which his laer crierium is inegraed in he search process will be explain in secion Word-graph derivaion A word graph represens he se of all possible ranslaions for a given source senence s ha were embeded in he SFST. The derivaion of he word graph is performed by inersecing he SFST wih he source senence s defining a subgraph in whose pahs are compaible wih he source senence. Ineracive search can be simplified significanly by using his represenaion of he se of arge senences, since he inclusion of edi cos operaions along wih he search procedure inroduces some peculiariies ha can be solved efficienly in he word graph. An example of word graph is shown in Figure Search for -bes ranslaions given a prefix of he arge senence The applicaion of his ype of search is aimed a he core of CAT. In his paradigm, given a source senence s, he human ranslaor is provided wih a lis of n ranslaions, also called -bes ranslaions. Then, he human ranslaor will proceed o accep a prefix of one of hese -bes ranslaions as correc, appending some recificaions o he seleced prefix. This new prefix of he arge senence ogeher wih he source senence s will generae a new se of bes ranslaions ha will be again modified by he human ranslaor. This process is repeaed as many imes as neccessary o achieve he desired final ranslaion. Ideally, he ask would be o find he arge suffix ha maximizes he probabiliy a poseriori given a prefix of he arge senence and he inpu senence. In pracice, however, i may happen ha is no presen in he word graph. The soluion is o use no bu a prefix ha minimizes he ediion disance wih and is compaible wih. Therefore, he score of a arge ranslaion is characerized by wo funcions, he edi cos beween he arge prefix and he opimal prefix found in he word graph and he a poseriori probabiliy of ( ). In order o value more significanly hose ranslaions ha were closer o he user preferences, he lis of - bes ranslaions has been prioriized using wo crieria: firs, he minimum edi cos and hen, by he a
4 poseriori probabiliy. The algorihm proposed o solve his search problem is an adaped version of he Recursive Enumeraion Algorihm (REA) described in (Jiménez and Marzal, 1999) ha inegraes he minimum edi cos algorihm in he search procedure o deal wih words, inroduced by he user, ha are no presen in he word graph. This algorihm consiss of wo pars: Forward search ha calculaes he 1-bes pah from he iniial sae o every sae in he word graph. Pahs in he word graph are weighed no only based on heir a poseriori probabiliy, bu also on heir edi cos respec o he arge senence prefix. To his purpose, ficicious edges have been insered ino he word graph o represen ediion operaions like inserion, subsiuion and deleion. These ediion operaions have been included in he word graph in he following way: Inserion: An inserion edge has been insered as a loop for each sae in he word graph wih uniary cos. Deleion: A deleion edge is added for each arc in he word graph having he same source and arge sae han is sibling arc wih uniary cos. Subsiuion: Each arc in he word graph is reaed as a subsiuion edge whose edi cos is proporional o he levenshein disance beween he symbol associaed wih his arc and he word prefix employed o raverse his arc during he search. This subsiuion cos is zero when he word prefix maches he symbol in he word graph arc. Backward search ha enumeraes candidaes for he -bes pah along he -bes pah. This recursive algorihm defines he nex bes pah ha arrives a a given sae as he nex bes pah ha reaches plus he arc leaving from o. If his nex bes pah arriving a sae has no been calculaed ye, hen he nex bes pah procedure is called recursively unil a 1-bes pah is found or no bes pahs are found. To reduce he compuaional cos of he search, he beam-search echnique (Ney e al., 1992) has been implemened. During he word graph consrucion, wo beam coefficiens were employed o penalize hose edges leading o backoff saes over hose ones arriving a normal saes. Finally, a hird beam coefficien conrols how far in erms of number of ediion operaions a hypohesis. 4 Experimenal resuls 4.1 Corpus feaures The corpus employed o perform experimens was he Xerox corpus (SchlumbergerSema S.A e al., 2001). I involves he ranslaion of echnical Xerox manuals from English o Spanish, French and German and vice-versa. Some saisics abou he daa used for raining and es purposes are shown in Table Sample session A TT2 ineracive prooype, which uses he searching echniques presened in he previous secions, has been implemened. The user is able o cusomized his prooype in differen ways: number of suggesed ranslaions, lengh in number of words of hese suggesions, ec. In he example below, he number of suggesions is five and he lengh of hese suggesions has no been bound. Example 1 This example shows he funcionaliy and he ineracion beween he TT2 prooype and a ranslaor hrough a ranslaion insance from English o Spanish for a given senence drawn from he Xerox corpus. For beer undersanding of his example he reference arge senence is given below: Reference arge senence: Insalación de conroladores de impresora y archivos PPD. Source senence: Insalling he Priner Drivers and PPDs. Hypohesis 0.0: Insalación del los conroladores de impresión y archivos PPD adapados. Hypohesis 0.1: Insalación del los conroladores
5 Table 1: Feaures of Xerox Corpus: raining, vocabulary and es sizes measured in housands of words. SIM: Currenly used reversible preprocessing. RAW: Original corpus wihou preprocess. PERPLEXITY: Measure how well a language model describes he es se. EN / ES EN / DE EN / FR RAW SIM RAW SIM RAW SIM TRAINING 600/ / / / / /400 VOCABULARY 26 / 30 8 / / 27 8 / / 37 8 / 19 TEST 8 / 9 8 / 10 9 / / / / 12 PERPLEXITY (3-gram) 107/60 48/33 93/169 51/87 193/135 73/52 Hypohesis 0.2: Insalación de la los conroladores de impresión y archivos PPD adapados. Hypohesis 0.3: Insalación de la los conroladores Hypohesis 0.4: Insalación de la esa los conroladores User ineracion 0: Hypohesis 0.2 is seleced and he cursor is posiioned a he beginning of he word los. Then, he ranslaor would ype he characer c, ha is, he nex characer in he reference arge senence. Prefix 0: Insalación de c Hypohesis 1.0: Insalación de c los conroladores de impresión y archivos PPD adapaados. Hypohesis 1.1: Insalación de c los conroladores Hypohesis 1.2: Insalación de c esa los conroladores de impresión y archivos PPD adapaados. Hypohesis 1.3: Insalación de c esa los conroladores Hypohesis 1.4: Insalación de conroladores de impresión y fax y en archivos PPD adapaados. User ineracion 1: Hypohesis 1.4 is seleced and he cursor is posiioned beween he characer s and i of he word impresión. Then, he ranslaor would ype he nex characer in he reference arge senence: o. Prefix 1: Insalación de conroladores de impreso Hypohesis 2.0: Insalación de conroladores de impresora y archivos PPD adapados. Hypohesis 2.1: Insalación de conroladores de impresora y ver los archivos PPD. Hypohesis 2.2: Insalación de conroladores de impresora/fax y ver los archivos PPD. Hypohesis 2.3: Insalación de conroladores de impresora/fax y archivos PPD adapados. Hypohesis 2.4: Insalación de conroladores de impresora y fax de CenreWare y ver los archivos PPD. User ineracion 2: Hypohesis 2.0 is seleced and he cursor is posiioned a he end of he word PPD. The ranslaor would jus need o add he characer.. Prefix 2: Insalación de conroladores de impresora y archivos PPD. Hypohesis 3.0: Insalación de conroladores de impresora y archivos PPD. Hypohesis 3.1: Insalación de conroladores de impresora y archivos PPD.: Hypohesis 3.2: Insalación de conroladores de impresora y archivos PPD.. Hypohesis 3.3: Insalación de conroladores de impresora y archivos PPD... Hypohesis 3.4: Insalación de conroladores de impresora y archivos PPD.:. User ineracion 3 : Hypohesis 3.0 is seleced and he user acceps he arge senence.
6 Final hypohesis: Insalación de conroladores de impresora y archivos PPD. 4.3 Translaion qualiy evaluaion The assessmen of he echniques presened in secion 3 has been carried ou using hree measures: 1. Translaion Word Error Rae (TWER): I is defined as he minimum number of word subsiuion, deleion and inserion operaions o conver he arge senence provided by he ransducer ino he reference ranslaion. Also known as edi disance. 2. Characer Error Rae (CER): Edi disance in erms of characers beween he arge senence provided by he ransducer and he reference ranslaion. 3. Key-Sroke Raio (KSR): Number of keysrokes ha are necessary o achieve he reference ranslaion plus he accepance keysroke divided by he number of running characers. 4. BiLingual Evaluaion Undersudy (BLEU) (Papineni e al., 2002): Basically is a funcion of he k-subsrings ha appear in he hypohesized arge senence and in he reference arge senence. These experimens were perfomed wih 3- gram ransducers based on he GIATI echnique. On he lefmos column appears he language pair employed for each experimen, English (En), Spanish (Es), French (Fr) and German (De). The main wo cenral columns compare he resuls obained wih 1-bes ranslaion o 5-bes ranslaions. When using 5-bes ranslaions, ha arge senence ou of hese five, ha minimizes mos he corresponden error measure is seleced. The resuls are shown in Table 2. The bes resuls were obained beween English and Spanish language pairs, in which he human ranslaor would need o ype less han 25% of he oal reference senences. In oher words, his would resul in a heoreically facor of 4 increase in he produciviy of human ranslaors. In fac, preliminary subjecive evaluaions have received posiive feedback from professional ranslaors when esing he prooype. Table 2: Resuls for he Xerox Corpus comparing 1-bes o 5-bes ranslaions 3-gram (1-bes) 3-gram (5-bes) RAW KSR CER TWER KSR CER TWER En-Es Es-En En-Fr Fr-En En-De De-En Furhermore, in all cases here is a clear and significan improvemen in error measures when moving from 1 o 5-bes ranslaions. This gain in ranslaion qualiy dimishes in a log-wise fashion as he number of bes ranslaions increases. However, he number of hypoheses should be limied o he user capabiliy o skim hrough he candidae ranslaions and decide on which one o selec. Table 3 presens he resuls obained on a simplified version of he corpus. This simplificaion consiss on okenizaion, case normalizaion and he subsiuion of numbers, priner codes, ec. by heir corresponden caegory labels. Table 3: Resuls for he Xerox Corpus comparing 1-bes o 5-bes ranslaions 3-gram (1-bes) 3-gram (5-bes) SIM WER CER BLEU WER CER BLEU En-Es Es-En En-Fr Fr-En En-De De-En Pair of languages as English and French presens somewha higher error raes, as is also he case beween English and German, reflecing he complexiy of he ask faced in hese experimens. 5 Conclusions and fuure work Finie-sae ransducers have been successfully applied o CAT. These models can be learn from parallel corpora. The concep of ineracive search has been inroduced in his paper along wih some
7 efficien echniques (word graph derivaion and - bes) ha solve he parsing problem given a prefix of he arge senence under real-ime consrains. The resuls show ha he 5-bes approach clearly improves he qualiy of he ranslaions, wih respec o he 1-bes approximaion. The promising resuls achieved in he firs experimens provide a new field in machine ranslaion sill o be explored, in which he human experise is combined wih machine ranslaion echniques o increase produciviy wihou sacrifying high-qualiy ranslaion. Finally, he inroducion of morpho-synacic informaion or bilingual caegories in finie-sae ransducers, are opics ha leave an open door o fuure research. As well as some improvemens in he search algorihms o reduce he compuaional cos of finding a pah in he word graph wih he minimum edi cos. Acknowledgmens The auhors would like o hank all he reasearchers involved in he TT2 projec who have conribued o he developmen of he mehodologies presened in his paper. This work has been suppored by he European Union under he IST Programme (IST ). References Yaser Al-Onaizan, Jan Curin, Michael Jahr, Kevin Knigh, John Laffery, Dan Melamed, Franz J. Och, David Purdy, Noah Smih, and David Yarowsky Saisical machine ranslaion: Final repor. Workshop on language engineering, Johns Hopkins Universiy, Cener for Language and Speech Processing, Balimore, MD, USA. Juan C. Amengual, José M. Benedí, Asunción Casano, Anonio Casellanos, Vícor M. Jiménez, David Llorens, Andrés Marzal, Moisés Pasor, Federico Pra, Enrique Vidal, and Juan M. Vilar The EuTrans-I speech ranslaion sysem. Machine Translaion, 15: S. Bangalore and G. Ricardi A finie-sae approach o machine ranslaion. In Second Meeing of he Norh American Chaper of he Associaion for Compuaional Linguisics. Peer F. Brown, Sephen Della Piera, Vincen J. Della Piera, and Rober L. Mercer The mahemaics of saisical machine ranslaion: Parameer esimaion. Compuaional Linguisics, 19(2): Francisco Casacubera, David Llorens, Carlos Marínez, Sirko Molau, Francisco Nevado, Hermann Ney, Moisés Pasor, David Picó, Albero Sanchis, Enrique Vidal, and Juan M. Vilar Speech-o-speech ranslaion based on finie-sae ransducers. In Inernaional Conference on Acousic, Speech and Signal Processing, volume 1. IEEE Press, April. Francisco Casacubera, Hermann Ney, Franz J. Och, Enrique Vidal, Juan M. Vilar, Sergio Barrachina, Ismael García-Varea, David Llorens, Carlos Marínez, Sirko Molau, Francisco Nevado, Moisés Pasor, David Picó, and Albero Sanchís Some approaches o saisical and finie-sae speech-o-speech ranslaion. Compuer Speech and Language, 18: Vícor M. Jiménez and Andrés Marzal Compuing he k shores pahs: a new algorihm and an experimenal comparison. In J. S. Vier and C. D. Zaroliagis, ediors, Algorihm Engineering, volume 1668 of Lecure Noes in Compuer Science, pages 15 29, London, July. Springer-Verlag. Kevin Knigh and Yaser Al-Onaizan Translaion wih finie-sae devices. In E. Hovy D. Farwell, L. Gerber, edior, Machine Translaion and he Informaion Soup: Third Conference of he Associaion for Machine Translaion in he Americas, volume 1529, pages , Langhorne, PA, USA, Ocober. AMTA 98. Philippe Langlais, George Foser, and Guy Lapalme Uni compleion for a compuer-aided ranslaion yping sysem. Machine Translaion, 15(4): Hermann Ney, Dieer Mergel, Andreas Noll, and Annedore Paeseler Daa driven organizaion for coninuous speech recogniion. In IEEE Transacions on Signal Processing, volume 40, pages Franz J. Och and Hermann Ney Improved saisical alignmen models. In ACL00,
8 pages , Hong Kong, China, Ocober. Kishore Papineni, Salim Roukos, Todd Ward, and Wei-Jing Zhu Bleu: a mehod for auomaic evaluaion of machine ranslaion. In Proceedings of he 40h Annual Meeing of he Associaion for Compuaional Linguisics, pages , Philadelphia. David Picó and Francisco Casacubera Some saisical-esimaion mehods for sochasic finie-sae ransducers. Machine Learning, 44: , July-Augus. SchlumbergerSema S.A, Insiuo Tecnológico de Informáica, Rheinisch Wesfälische Technische Hochschule Aachen Lehrsul für Informaik VI, Recherche Appliquée en Linguisique Informaique Laboraory Universiy of Monreal, Celer Soluciones, Sociéé Gamma, and Xerox Research Cenre Europe TT2. TransType2 - compuer assised ranslaion. Projec echnical annex. Enrique Vidal Finie-sae speech-o-speech ranslaion. In In. Conf. on Acousics Speech and Signal Processing (ICASSP-97), proc., Vol.1, pages , Munich. Andrew Vierbi Error bounds for convoluional codes and a asymoically opimal decoding algorihm. IEEE Transacions on Informaion Theory, 13:
Neural Network Model of the Backpropagation Algorithm
Neural Nework Model of he Backpropagaion Algorihm Rudolf Jakša Deparmen of Cyberneics and Arificial Inelligence Technical Universiy of Košice Lená 9, 4 Košice Slovakia jaksa@neuron.uke.sk Miroslav Karák
More informationAn Effiecient Approach for Resource Auto-Scaling in Cloud Environments
Inernaional Journal of Elecrical and Compuer Engineering (IJECE) Vol. 6, No. 5, Ocober 2016, pp. 2415~2424 ISSN: 2088-8708, DOI: 10.11591/ijece.v6i5.10639 2415 An Effiecien Approach for Resource Auo-Scaling
More informationFast Multi-task Learning for Query Spelling Correction
Fas Muli-ask Learning for Query Spelling Correcion Xu Sun Dep. of Saisical Science Cornell Universiy Ihaca, NY 14853 xusun@cornell.edu Anshumali Shrivasava Dep. of Compuer Science Cornell Universiy Ihaca,
More informationMore Accurate Question Answering on Freebase
More Accurae Quesion Answering on Freebase Hannah Bas, Elmar Haussmann Deparmen of Compuer Science Universiy of Freiburg 79110 Freiburg, Germany {bas, haussmann}@informaik.uni-freiburg.de ABSTRACT Real-world
More informationChannel Mapping using Bidirectional Long Short-Term Memory for Dereverberation in Hands-Free Voice Controlled Devices
Z. Zhang e al.: Channel Mapping using Bidirecional Long Shor-Term Memory for Dereverberaion in Hands-Free Voice Conrolled Devices 525 Channel Mapping using Bidirecional Long Shor-Term Memory for Dereverberaion
More informationMyLab & Mastering Business
MyLab & Masering Business Efficacy Repor 2013 MyLab & Masering: Business Efficacy Repor 2013 Edied by Michelle D. Speckler 2013 Pearson MyAccouningLab, MyEconLab, MyFinanceLab, MyMarkeingLab, and MyOMLab
More information1 Language universals
AS LX 500 Topics: Language Uniersals Fall 2010, Sepember 21 4a. Anisymmery 1 Language uniersals Subjec-erb agreemen and order Bach (1971) discusses wh-quesions across SO and SO languages, hypohesizing:...
More informationInformation Propagation for informing Special Population Subgroups about New Ground Transportation Services at Airports
Downloaded from ascelibrary.org by Basil Sephanis on 07/13/16. Copyrigh ASCE. For personal use only; all righs reserved. Informaion Propagaion for informing Special Populaion Subgroups abou New Ground
More informationExploiting Phrasal Lexica and Additional Morpho-syntactic Language Resources for Statistical Machine Translation with Scarce Training Data
Exploiting Phrasal Lexica and Additional Morpho-syntactic Language Resources for Statistical Machine Translation with Scarce Training Data Maja Popović and Hermann Ney Lehrstuhl für Informatik VI, Computer
More informationGreedy Decoding for Statistical Machine Translation in Almost Linear Time
in: Proceedings of HLT-NAACL 23. Edmonton, Canada, May 27 June 1, 23. This version was produced on April 2, 23. Greedy Decoding for Statistical Machine Translation in Almost Linear Time Ulrich Germann
More informationarxiv: v1 [cs.cl] 2 Apr 2017
Word-Alignment-Based Segment-Level Machine Translation Evaluation using Word Embeddings Junki Matsuo and Mamoru Komachi Graduate School of System Design, Tokyo Metropolitan University, Japan matsuo-junki@ed.tmu.ac.jp,
More informationThe Karlsruhe Institute of Technology Translation Systems for the WMT 2011
The Karlsruhe Institute of Technology Translation Systems for the WMT 2011 Teresa Herrmann, Mohammed Mediani, Jan Niehues and Alex Waibel Karlsruhe Institute of Technology Karlsruhe, Germany firstname.lastname@kit.edu
More informationRegression for Sentence-Level MT Evaluation with Pseudo References
Regression for Sentence-Level MT Evaluation with Pseudo References Joshua S. Albrecht and Rebecca Hwa Department of Computer Science University of Pittsburgh {jsa8,hwa}@cs.pitt.edu Abstract Many automatic
More informationLanguage Model and Grammar Extraction Variation in Machine Translation
Language Model and Grammar Extraction Variation in Machine Translation Vladimir Eidelman, Chris Dyer, and Philip Resnik UMIACS Laboratory for Computational Linguistics and Information Processing Department
More informationA Quantitative Method for Machine Translation Evaluation
A Quantitative Method for Machine Translation Evaluation Jesús Tomás Escola Politècnica Superior de Gandia Universitat Politècnica de València jtomas@upv.es Josep Àngel Mas Departament d Idiomes Universitat
More informationNoisy SMS Machine Translation in Low-Density Languages
Noisy SMS Machine Translation in Low-Density Languages Vladimir Eidelman, Kristy Hollingshead, and Philip Resnik UMIACS Laboratory for Computational Linguistics and Information Processing Department of
More informationDomain Adaptation in Statistical Machine Translation of User-Forum Data using Component-Level Mixture Modelling
Domain Adaptation in Statistical Machine Translation of User-Forum Data using Component-Level Mixture Modelling Pratyush Banerjee, Sudip Kumar Naskar, Johann Roturier 1, Andy Way 2, Josef van Genabith
More informationImproved Reordering for Shallow-n Grammar based Hierarchical Phrase-based Translation
Improved Reordering for Shallow-n Grammar based Hierarchical Phrase-based Translation Baskaran Sankaran and Anoop Sarkar School of Computing Science Simon Fraser University Burnaby BC. Canada {baskaran,
More informationRe-evaluating the Role of Bleu in Machine Translation Research
Re-evaluating the Role of Bleu in Machine Translation Research Chris Callison-Burch Miles Osborne Philipp Koehn School on Informatics University of Edinburgh 2 Buccleuch Place Edinburgh, EH8 9LW callison-burch@ed.ac.uk
More informationCross Language Information Retrieval
Cross Language Information Retrieval RAFFAELLA BERNARDI UNIVERSITÀ DEGLI STUDI DI TRENTO P.ZZA VENEZIA, ROOM: 2.05, E-MAIL: BERNARDI@DISI.UNITN.IT Contents 1 Acknowledgment.............................................
More informationLearning Methods in Multilingual Speech Recognition
Learning Methods in Multilingual Speech Recognition Hui Lin Department of Electrical Engineering University of Washington Seattle, WA 98125 linhui@u.washington.edu Li Deng, Jasha Droppo, Dong Yu, and Alex
More informationDetecting English-French Cognates Using Orthographic Edit Distance
Detecting English-French Cognates Using Orthographic Edit Distance Qiongkai Xu 1,2, Albert Chen 1, Chang i 1 1 The Australian National University, College of Engineering and Computer Science 2 National
More informationConstructing Parallel Corpus from Movie Subtitles
Constructing Parallel Corpus from Movie Subtitles Han Xiao 1 and Xiaojie Wang 2 1 School of Information Engineering, Beijing University of Post and Telecommunications artex.xh@gmail.com 2 CISTR, Beijing
More informationSpeech Recognition at ICSI: Broadcast News and beyond
Speech Recognition at ICSI: Broadcast News and beyond Dan Ellis International Computer Science Institute, Berkeley CA Outline 1 2 3 The DARPA Broadcast News task Aspects of ICSI
More informationBridging Lexical Gaps between Queries and Questions on Large Online Q&A Collections with Compact Translation Models
Bridging Lexical Gaps between Queries and Questions on Large Online Q&A Collections with Compact Translation Models Jung-Tae Lee and Sang-Bum Kim and Young-In Song and Hae-Chang Rim Dept. of Computer &
More informationMETHODS FOR EXTRACTING AND CLASSIFYING PAIRS OF COGNATES AND FALSE FRIENDS
METHODS FOR EXTRACTING AND CLASSIFYING PAIRS OF COGNATES AND FALSE FRIENDS Ruslan Mitkov (R.Mitkov@wlv.ac.uk) University of Wolverhampton ViktorPekar (v.pekar@wlv.ac.uk) University of Wolverhampton Dimitar
More informationEvolutive Neural Net Fuzzy Filtering: Basic Description
Journal of Intelligent Learning Systems and Applications, 2010, 2: 12-18 doi:10.4236/jilsa.2010.21002 Published Online February 2010 (http://www.scirp.org/journal/jilsa) Evolutive Neural Net Fuzzy Filtering:
More informationLearning Methods for Fuzzy Systems
Learning Methods for Fuzzy Systems Rudolf Kruse and Andreas Nürnberger Department of Computer Science, University of Magdeburg Universitätsplatz, D-396 Magdeburg, Germany Phone : +49.39.67.876, Fax : +49.39.67.8
More informationIn Workflow. Viewing: Last edit: 10/27/15 1:51 pm. Approval Path. Date Submi ed: 10/09/15 2:47 pm. 6. Coordinator Curriculum Management
1 of 5 11/19/2015 8:10 AM Date Submi ed: 10/09/15 2:47 pm Viewing: Last edit: 10/27/15 1:51 pm Changes proposed by: GODWINH In Workflow 1. BUSI Editor 2. BUSI Chair 3. BU Associate Dean 4. Biggio Center
More informationTINE: A Metric to Assess MT Adequacy
TINE: A Metric to Assess MT Adequacy Miguel Rios, Wilker Aziz and Lucia Specia Research Group in Computational Linguistics University of Wolverhampton Stafford Street, Wolverhampton, WV1 1SB, UK {m.rios,
More informationListening and Speaking Skills of English Language of Adolescents of Government and Private Schools
Listening and Speaking Skills of English Language of Adolescents of Government and Private Schools Dr. Amardeep Kaur Professor, Babe Ke College of Education, Mudki, Ferozepur, Punjab Abstract The present
More informationTarget Language Preposition Selection an Experiment with Transformation-Based Learning and Aligned Bilingual Data
Target Language Preposition Selection an Experiment with Transformation-Based Learning and Aligned Bilingual Data Ebba Gustavii Department of Linguistics and Philology, Uppsala University, Sweden ebbag@stp.ling.uu.se
More informationUndergraduate Programs INTERNATIONAL LANGUAGE STUDIES. BA: Spanish Studies 33. BA: Language for International Trade 50
128 ANDREWS UNIVERSITY INTERNATIONAL LANGUAGE STUDIES Griggs Hall, Room 109 (616) 471-3180 inls@andrews.edu http://www.andrews.edu/inls/ Faculty Pedro A. Navia, Chair Eunice I. Dupertuis Wolfgang F. P.
More informationMulti-Lingual Text Leveling
Multi-Lingual Text Leveling Salim Roukos, Jerome Quin, and Todd Ward IBM T. J. Watson Research Center, Yorktown Heights, NY 10598 {roukos,jlquinn,tward}@us.ibm.com Abstract. Determining the language proficiency
More informationA heuristic framework for pivot-based bilingual dictionary induction
2013 International Conference on Culture and Computing A heuristic framework for pivot-based bilingual dictionary induction Mairidan Wushouer, Toru Ishida, Donghui Lin Department of Social Informatics,
More informationCross-Lingual Dependency Parsing with Universal Dependencies and Predicted PoS Labels
Cross-Lingual Dependency Parsing with Universal Dependencies and Predicted PoS Labels Jörg Tiedemann Uppsala University Department of Linguistics and Philology firstname.lastname@lingfil.uu.se Abstract
More informationLongest Common Subsequence: A Method for Automatic Evaluation of Handwritten Essays
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 17, Issue 6, Ver. IV (Nov Dec. 2015), PP 01-07 www.iosrjournals.org Longest Common Subsequence: A Method for
More informationThe NICT Translation System for IWSLT 2012
The NICT Translation System for IWSLT 2012 Andrew Finch Ohnmar Htun Eiichiro Sumita Multilingual Translation Group MASTAR Project National Institute of Information and Communications Technology Kyoto,
More informationRole of Pausing in Text-to-Speech Synthesis for Simultaneous Interpretation
Role of Pausing in Text-to-Speech Synthesis for Simultaneous Interpretation Vivek Kumar Rangarajan Sridhar, John Chen, Srinivas Bangalore, Alistair Conkie AT&T abs - Research 180 Park Avenue, Florham Park,
More informationYoshida Honmachi, Sakyo-ku, Kyoto, Japan 1 Although the label set contains verb phrases, they
FlowGraph2Text: Automatic Sentence Skeleton Compilation for Procedural Text Generation 1 Shinsuke Mori 2 Hirokuni Maeta 1 Tetsuro Sasada 2 Koichiro Yoshino 3 Atsushi Hashimoto 1 Takuya Funatomi 2 Yoko
More informationUsing dialogue context to improve parsing performance in dialogue systems
Using dialogue context to improve parsing performance in dialogue systems Ivan Meza-Ruiz and Oliver Lemon School of Informatics, Edinburgh University 2 Buccleuch Place, Edinburgh I.V.Meza-Ruiz@sms.ed.ac.uk,
More informationSpecification and Evaluation of Machine Translation Toy Systems - Criteria for laboratory assignments
Specification and Evaluation of Machine Translation Toy Systems - Criteria for laboratory assignments Cristina Vertan, Walther v. Hahn University of Hamburg, Natural Language Systems Division Hamburg,
More informationBMBF Project ROBUKOM: Robust Communication Networks
BMBF Project ROBUKOM: Robust Communication Networks Arie M.C.A. Koster Christoph Helmberg Andreas Bley Martin Grötschel Thomas Bauschert supported by BMBF grant 03MS616A: ROBUKOM Robust Communication Networks,
More informationDistant Supervised Relation Extraction with Wikipedia and Freebase
Distant Supervised Relation Extraction with Wikipedia and Freebase Marcel Ackermann TU Darmstadt ackermann@tk.informatik.tu-darmstadt.de Abstract In this paper we discuss a new approach to extract relational
More informationThe KIT-LIMSI Translation System for WMT 2014
The KIT-LIMSI Translation System for WMT 2014 Quoc Khanh Do, Teresa Herrmann, Jan Niehues, Alexandre Allauzen, François Yvon and Alex Waibel LIMSI-CNRS, Orsay, France Karlsruhe Institute of Technology,
More informationEvaluation of a Simultaneous Interpretation System and Analysis of Speech Log for User Experience Assessment
Evaluation of a Simultaneous Interpretation System and Analysis of Speech Log for User Experience Assessment Akiko Sakamoto, Kazuhiko Abe, Kazuo Sumita and Satoshi Kamatani Knowledge Media Laboratory,
More informationMultilingual Document Clustering: an Heuristic Approach Based on Cognate Named Entities
Multilingual Document Clustering: an Heuristic Approach Based on Cognate Named Entities Soto Montalvo GAVAB Group URJC Raquel Martínez NLP&IR Group UNED Arantza Casillas Dpt. EE UPV-EHU Víctor Fresno GAVAB
More informationThe RWTH Aachen University English-German and German-English Machine Translation System for WMT 2017
The RWTH Aachen University English-German and German-English Machine Translation System for WMT 2017 Jan-Thorsten Peter, Andreas Guta, Tamer Alkhouli, Parnia Bahar, Jan Rosendahl, Nick Rossenbach, Miguel
More informationPaper 2. Mathematics test. Calculator allowed. First name. Last name. School KEY STAGE TIER
259574_P2 5-7_KS3_Ma.qxd 1/4/04 4:14 PM Page 1 Ma KEY STAGE 3 TIER 5 7 2004 Mathematics test Paper 2 Calculator allowed Please read this page, but do not open your booklet until your teacher tells you
More informationLanguage Independent Passage Retrieval for Question Answering
Language Independent Passage Retrieval for Question Answering José Manuel Gómez-Soriano 1, Manuel Montes-y-Gómez 2, Emilio Sanchis-Arnal 1, Luis Villaseñor-Pineda 2, Paolo Rosso 1 1 Polytechnic University
More informationCOMPUTATIONAL COMPLEXITY OF LEFT-ASSOCIATIVE GRAMMAR
COMPUTATIONAL COMPLEXITY OF LEFT-ASSOCIATIVE GRAMMAR ROLAND HAUSSER Institut für Deutsche Philologie Ludwig-Maximilians Universität München München, West Germany 1. CHOICE OF A PRIMITIVE OPERATION The
More informationMaximizing Learning Through Course Alignment and Experience with Different Types of Knowledge
Innov High Educ (2009) 34:93 103 DOI 10.1007/s10755-009-9095-2 Maximizing Learning Through Course Alignment and Experience with Different Types of Knowledge Phyllis Blumberg Published online: 3 February
More informationSELECCIÓN DE CURSOS CAMPUS CIUDAD DE MÉXICO. Instructions for Course Selection
Instructions for Course Selection INSTRUCTIONS FOR COURSE SELECTION 1. Open the following link: https://prd28pi01.itesm.mx/recepcion/studyinmexico?ln=en 2. Click on the buttom: continue 3. Choose your
More informationACTIVITY: Comparing Combination Locks
5.4 Compound Events outcomes of one or more events? ow can you find the number of possible ACIVIY: Comparing Combination Locks Work with a partner. You are buying a combination lock. You have three choices.
More informationA Minimalist Approach to Code-Switching. In the field of linguistics, the topic of bilingualism is a broad one. There are many
Schmidt 1 Eric Schmidt Prof. Suzanne Flynn Linguistic Study of Bilingualism December 13, 2013 A Minimalist Approach to Code-Switching In the field of linguistics, the topic of bilingualism is a broad one.
More informationVariations of the Similarity Function of TextRank for Automated Summarization
Variations of the Similarity Function of TextRank for Automated Summarization Federico Barrios 1, Federico López 1, Luis Argerich 1, Rosita Wachenchauzer 12 1 Facultad de Ingeniería, Universidad de Buenos
More informationMrs. Esther O. Garcia. Course: AP Spanish literature
Mrs. Esther O. Garcia Course: AP Spanish literature Course Description: The objective of this course is to continue developing proficiency in all four language skills: listening, reading and writing. The
More informationENGBG1 ENGBL1 Campus Linguistics. Meeting 2. Chapter 7 (Morphology) and chapter 9 (Syntax) Pia Sundqvist
Meeting 2 Chapter 7 (Morphology) and chapter 9 (Syntax) Today s agenda Repetition of meeting 1 Mini-lecture on morphology Seminar on chapter 7, worksheet Mini-lecture on syntax Seminar on chapter 9, worksheet
More informationLanguage properties and Grammar of Parallel and Series Parallel Languages
arxiv:1711.01799v1 [cs.fl] 6 Nov 2017 Language properties and Grammar of Parallel and Series Parallel Languages Mohana.N 1, Kalyani Desikan 2 and V.Rajkumar Dare 3 1 Division of Mathematics, School of
More informationThe MSR-NRC-SRI MT System for NIST Open Machine Translation 2008 Evaluation
The MSR-NRC-SRI MT System for NIST Open Machine Translation 2008 Evaluation AUTHORS AND AFFILIATIONS MSR: Xiaodong He, Jianfeng Gao, Chris Quirk, Patrick Nguyen, Arul Menezes, Robert Moore, Kristina Toutanova,
More informationInterview on Quality Education
Interview on Quality Education President European University Association (EUA) Ultimately, education is what should allow students to grow, learn, further develop, and fully play their role as active citizens
More informationFrom Empire to Twenty-First Century Britain: Economic and Political Development of Great Britain in the 19th and 20th Centuries 5HD391
Provisional list of courses for Exchange students Fall semester 2017: University of Economics, Prague Courses stated below are offered by particular departments and faculties at the University of Economics,
More informationWhat the National Curriculum requires in reading at Y5 and Y6
What the National Curriculum requires in reading at Y5 and Y6 Word reading apply their growing knowledge of root words, prefixes and suffixes (morphology and etymology), as listed in Appendix 1 of the
More informationRule discovery in Web-based educational systems using Grammar-Based Genetic Programming
Data Mining VI 205 Rule discovery in Web-based educational systems using Grammar-Based Genetic Programming C. Romero, S. Ventura, C. Hervás & P. González Universidad de Córdoba, Campus Universitario de
More informationWord Segmentation of Off-line Handwritten Documents
Word Segmentation of Off-line Handwritten Documents Chen Huang and Sargur N. Srihari {chuang5, srihari}@cedar.buffalo.edu Center of Excellence for Document Analysis and Recognition (CEDAR), Department
More informationTask Tolerance of MT Output in Integrated Text Processes
Task Tolerance of MT Output in Integrated Text Processes John S. White, Jennifer B. Doyon, and Susan W. Talbott Litton PRC 1500 PRC Drive McLean, VA 22102, USA {white_john, doyon jennifer, talbott_susan}@prc.com
More informationSemi-supervised methods of text processing, and an application to medical concept extraction. Yacine Jernite Text-as-Data series September 17.
Semi-supervised methods of text processing, and an application to medical concept extraction Yacine Jernite Text-as-Data series September 17. 2015 What do we want from text? 1. Extract information 2. Link
More informationObjectives. Chapter 2: The Representation of Knowledge. Expert Systems: Principles and Programming, Fourth Edition
Chapter 2: The Representation of Knowledge Expert Systems: Principles and Programming, Fourth Edition Objectives Introduce the study of logic Learn the difference between formal logic and informal logic
More informationTEKS Correlations Proclamation 2017
and Skills (TEKS): Material Correlations to the Texas Essential Knowledge and Skills (TEKS): Material Subject Course Publisher Program Title Program ISBN TEKS Coverage (%) Chapter 114. Texas Essential
More informationA hybrid approach to translate Moroccan Arabic dialect
A hybrid approach to translate Moroccan Arabic dialect Ridouane Tachicart Mohammadia school of Engineers Mohamed Vth Agdal University, Rabat, Morocco tachicart@gmail.com Karim Bouzoubaa Mohammadia school
More informationParallel Evaluation in Stratal OT * Adam Baker University of Arizona
Parallel Evaluation in Stratal OT * Adam Baker University of Arizona tabaker@u.arizona.edu 1.0. Introduction The model of Stratal OT presented by Kiparsky (forthcoming), has not and will not prove uncontroversial
More informationActive Learning. Yingyu Liang Computer Sciences 760 Fall
Active Learning Yingyu Liang Computer Sciences 760 Fall 2017 http://pages.cs.wisc.edu/~yliang/cs760/ Some of the slides in these lectures have been adapted/borrowed from materials developed by Mark Craven,
More informationDEVELOPMENT OF A MULTILINGUAL PARALLEL CORPUS AND A PART-OF-SPEECH TAGGER FOR AFRIKAANS
DEVELOPMENT OF A MULTILINGUAL PARALLEL CORPUS AND A PART-OF-SPEECH TAGGER FOR AFRIKAANS Julia Tmshkina Centre for Text Techitology, North-West University, 253 Potchefstroom, South Africa 2025770@puk.ac.za
More informationOn the Combined Behavior of Autonomous Resource Management Agents
On the Combined Behavior of Autonomous Resource Management Agents Siri Fagernes 1 and Alva L. Couch 2 1 Faculty of Engineering Oslo University College Oslo, Norway siri.fagernes@iu.hio.no 2 Computer Science
More informationSpeech Emotion Recognition Using Support Vector Machine
Speech Emotion Recognition Using Support Vector Machine Yixiong Pan, Peipei Shen and Liping Shen Department of Computer Technology Shanghai JiaoTong University, Shanghai, China panyixiong@sjtu.edu.cn,
More informationImpact of Controlled Language on Translation Quality and Post-editing in a Statistical Machine Translation Environment
Impact of Controlled Language on Translation Quality and Post-editing in a Statistical Machine Translation Environment Takako Aikawa, Lee Schwartz, Ronit King Mo Corston-Oliver Carmen Lozano Microsoft
More informationSpeech Translation for Triage of Emergency Phonecalls in Minority Languages
Speech Translation for Triage of Emergency Phonecalls in Minority Languages Udhyakumar Nallasamy, Alan W Black, Tanja Schultz, Robert Frederking Language Technologies Institute Carnegie Mellon University
More informationCourses below are sorted by the column Field of study for your better orientation. The list is subject to change.
Provisional list of courses for Exchange students Spring semester 2017: University of Economics, Prague Courses stated below are offered by particular departments and faculties at the University of Economics,
More informationCharacteristics of the Text Genre Realistic fi ction Text Structure
LESSON 14 TEACHER S GUIDE by Oscar Hagen Fountas-Pinnell Level A Realistic Fiction Selection Summary A boy and his mom visit a pond and see and count a bird, fish, turtles, and frogs. Number of Words:
More informationBooks Effective Literacy Y5-8 Learning Through Talk Y4-8 Switch onto Spelling Spelling Under Scrutiny
By the End of Year 8 All Essential words lists 1-7 290 words Commonly Misspelt Words-55 working out more complex, irregular, and/or ambiguous words by using strategies such as inferring the unknown from
More informationModeling function word errors in DNN-HMM based LVCSR systems
Modeling function word errors in DNN-HMM based LVCSR systems Melvin Jose Johnson Premkumar, Ankur Bapna and Sree Avinash Parchuri Department of Computer Science Department of Electrical Engineering Stanford
More informationData Fusion Models in WSNs: Comparison and Analysis
Proceedings of 2014 Zone 1 Conference of the American Society for Engineering Education (ASEE Zone 1) Data Fusion s in WSNs: Comparison and Analysis Marwah M Almasri, and Khaled M Elleithy, Senior Member,
More informationAgent-Based Software Engineering
Agent-Based Software Engineering Learning Guide Information for Students 1. Description Grade Module Máster Universitario en Ingeniería de Software - European Master on Software Engineering Advanced Software
More informationTEAM NEWSLETTER. Welton Primar y School SENIOR LEADERSHIP TEAM. School Improvement
Welton Primar y School February 2016 SENIOR LEADERSHIP TEAM NEWSLETTER SENIOR LEADERSHIP TEAM Nikki Pidgeon Head Teacher Sarah Millar Lead for Behaviour, SEAL and PE Laura Leitch Specialist Leader in Education,
More informationFunction Tables With The Magic Function Machine
Brief Overview: Function Tables With The Magic Function Machine s will be able to complete a by applying a one operation rule, determine a rule based on the relationship between the input and output within
More informationFinding Translations in Scanned Book Collections
Finding Translations in Scanned Book Collections Ismet Zeki Yalniz Dept. of Computer Science University of Massachusetts Amherst, MA, 01003 zeki@cs.umass.edu R. Manmatha Dept. of Computer Science University
More informationLearning Optimal Dialogue Strategies: A Case Study of a Spoken Dialogue Agent for
Learning Optimal Dialogue Strategies: A Case Study of a Spoken Dialogue Agent for Email Marilyn A. Walker Jeanne C. Fromer Shrikanth Narayanan walker@research.att.com jeannie@ai.mit.edu shri@research.att.com
More informationCELEBRA UN POWWOW LESSON PLAN FOR GRADES 3 6
CELEBRA UN POWWOW LESSON PLAN FOR GRADES 3 6 Content Overview: In the fiction story, Sandy and her family are preparing to travel to a powwow on Sandy s birthday. Sandy receives many birthday presents,
More informationInitial approaches on Cross-Lingual Information Retrieval using Statistical Machine Translation on User Queries
Initial approaches on Cross-Lingual Information Retrieval using Statistical Machine Translation on User Queries Marta R. Costa-jussà, Christian Paz-Trillo and Renata Wassermann 1 Computer Science Department
More informationPREDICTING SPEECH RECOGNITION CONFIDENCE USING DEEP LEARNING WITH WORD IDENTITY AND SCORE FEATURES
PREDICTING SPEECH RECOGNITION CONFIDENCE USING DEEP LEARNING WITH WORD IDENTITY AND SCORE FEATURES Po-Sen Huang, Kshitiz Kumar, Chaojun Liu, Yifan Gong, Li Deng Department of Electrical and Computer Engineering,
More informationSegmental Conditional Random Fields with Deep Neural Networks as Acoustic Models for First-Pass Word Recognition
Segmental Conditional Random Fields with Deep Neural Networks as Acoustic Models for First-Pass Word Recognition Yanzhang He, Eric Fosler-Lussier Department of Computer Science and Engineering The hio
More informationROSETTA STONE PRODUCT OVERVIEW
ROSETTA STONE PRODUCT OVERVIEW Method Rosetta Stone teaches languages using a fully-interactive immersion process that requires the student to indicate comprehension of the new language and provides immediate
More informationMCAS_2017_Gr5_ELA_RID. IV. English Language Arts, Grade 5
IV. English Language Arts, Grade 5 Grade 5 English Language Arts Test The spring 2017 grade 5 English Language Arts test was a next-generation assessment, featuring a new test design and new item types.
More informationA Case Study: News Classification Based on Term Frequency
A Case Study: News Classification Based on Term Frequency Petr Kroha Faculty of Computer Science University of Technology 09107 Chemnitz Germany kroha@informatik.tu-chemnitz.de Ricardo Baeza-Yates Center
More informationOn-the-Fly Customization of Automated Essay Scoring
Research Report On-the-Fly Customization of Automated Essay Scoring Yigal Attali Research & Development December 2007 RR-07-42 On-the-Fly Customization of Automated Essay Scoring Yigal Attali ETS, Princeton,
More informationApplying Biliteracy and the Bridge to the Immersion Setting BIC Conference
Applying Biliteracy and the Bridge to the Immersion Setting BIC Conference September, 2015 São Paulo, Brazil Karen Beeman Karen@teachingforbiliteracy.com Agenda: Introductions The Bridge: Research Connections
More informationAppendix L: Online Testing Highlights and Script
Online Testing Highlights and Script for Fall 2017 Ohio s State Tests Administrations Test administrators must use this document when administering Ohio s State Tests online. It includes step-by-step directions,
More informationPhysics 270: Experimental Physics
2017 edition Lab Manual Physics 270 3 Physics 270: Experimental Physics Lecture: Lab: Instructor: Office: Email: Tuesdays, 2 3:50 PM Thursdays, 2 4:50 PM Dr. Uttam Manna 313C Moulton Hall umanna@ilstu.edu
More informationDefining Numeracy the story continues David Kaye LLU+ London South Bank University
The 17th Annual Conference of ALM Adults Learning Mathematics a Research Forum MATHS AT WORK - mathematics in a changing world Defining Numeracy the story continues David Kaye LLU+ London South Bank University
More informationSpanish III Class Description
Spanish III Class Description Spanish III is an elective class. It is also a hands on class where students take all the knowledge from their previous years of Spanish and put them into practical use. The
More information