top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Comparable corpora and computer-assisted translation / / Estelle Maryline Delpech ; series editor, Narendra Jussien
Comparable corpora and computer-assisted translation / / Estelle Maryline Delpech ; series editor, Narendra Jussien
Autore Delpech Estelle Maryline
Pubbl/distr/stampa London, England ; : , : Hoboken, New Jersey : , : iSTE : , : Wiley, , 2014
Descrizione fisica 1 online resource (xiv, 287 pages)
Disciplina 410.285
Collana Cognitive Science and Knowledge Management Series
Soggetto topico Computational linguistics
Corpora (Linguistics)
Translators (Computer programs)
ISBN 1-119-00265-6
1-119-00252-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Cover; Title Page; Copyright; Contents; Acknowledgments; Introduction; PART 1: Applicative and Scientific Context; Chapter 1: Leveraging Comparable Corpora for Computer-assisted Translation ; 1.1. Introduction; 1.2. From the beginnings of machine translation to comparable corpora processing; 1.2.1. The dawn of machine translation; 1.2.2. The development of computer-assisted translation; 1.2.3. Drawbacks of parallel corpora and advantages of comparable corpora; 1.2.4. Difficulties of technical translation; 1.2.5. Industrial context
1.3. Term alignment from comparable corpora: a state-of-the-art1.3.1. Distributional approach principle; 1.3.2. Term alignment evaluation; 1.3.2.1. Precision at rank N or TopN; 1.3.2.2. MRR; 1.3.2.3. MAP; 1.3.3. Improvement and variants of the distributional approach; 1.3.3.1. Favoring distributional symmetry; 1.3.3.2. Using syntactic contexts; 1.3.3.3. Relying on trusted elements; 1.3.3.4. Improving semantic information representation; 1.3.3.5. Using second-order semantic affinities; 1.3.3.6. Improving the bilingual resource with semantic classes; 1.3.3.7. Translating polylexical units
1.3.4. Influence of data and parameters on alignment quality1.3.4.1. Data; 1.3.4.2. Parameters; 1.3.5. Limits of the distributional approach; 1.4. CAT software prototype for comparable corpora processing; 1.4.1. Implementation of a term alignment method; 1.4.1.1. Implementation and data; 1.4.1.2. Extraction of the terms to be aligned; 1.4.1.3. Collecting context vectors; 1.4.1.3.1. Monolexical term context vectors; 1.4.1.4. Polylexical term context vectors; 1.4.1.5. Translation of the source context vectors; 1.4.1.6. Term alignment; 1.4.2. Terminological records extraction
1.4.3. Lexicon consultation interface1.5. Summary; Chapter 2: User-Centered Evaluation of Lexicons Extracted from Comparable Corpora; 2.1. Introduction; 2.2. Translation quality evaluation methodologies; 2.2.1. Machine translation evaluation; 2.2.1.1. Automatic evaluation measures; 2.2.1.2. Human MT evaluation; 2.2.2. Human translation evaluation; 2.2.2.1. Quantitative models; 2.2.2.2. Non-quantitative models; 2.2.3. Discussion; 2.3. Design and experimentation of a user-centered evaluation; 2.3.1. Methodological aspects; 2.3.1.1. Evaluation criteria and purpose
2.3.1.2. Subject matter expertise2.3.1.3. Basis for comparison; 2.3.2. Experimentation protocol; 2.3.2.1. Data; 2.3.2.1.1. Comparable corpora and extracted lexica; 2.3.2.1.2. Texts to be translated; 2.3.2.1.3. Resources used in the translation situation; 2.3.2.1.4. Translators and judges; 2.3.2.2. Evaluation progress; 2.3.2.2.1. Translation phase; 2.3.2.2.2. Translation quality evaluation phase; 2.3.3. Results; 2.3.3.1. Lexicons usability; 2.3.3.1.1. Translation speed; 2.3.3.1.2. Use of resources; 2.3.3.1.3. Translators' impressions on the lexicons extracted from comparable corpora
2.3.3.2. Quality of the generated translations
Record Nr. UNINA-9910132185103321
Delpech Estelle Maryline  
London, England ; : , : Hoboken, New Jersey : , : iSTE : , : Wiley, , 2014
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Comparable corpora and computer-assisted translation / / Estelle Maryline Delpech ; series editor, Narendra Jussien
Comparable corpora and computer-assisted translation / / Estelle Maryline Delpech ; series editor, Narendra Jussien
Autore Delpech Estelle Maryline
Pubbl/distr/stampa London, England ; : , : Hoboken, New Jersey : , : iSTE : , : Wiley, , 2014
Descrizione fisica 1 online resource (xiv, 287 pages)
Disciplina 410.285
Collana Cognitive Science and Knowledge Management Series
Soggetto topico Computational linguistics
Corpora (Linguistics)
Translators (Computer programs)
ISBN 1-119-00265-6
1-119-00252-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Cover; Title Page; Copyright; Contents; Acknowledgments; Introduction; PART 1: Applicative and Scientific Context; Chapter 1: Leveraging Comparable Corpora for Computer-assisted Translation ; 1.1. Introduction; 1.2. From the beginnings of machine translation to comparable corpora processing; 1.2.1. The dawn of machine translation; 1.2.2. The development of computer-assisted translation; 1.2.3. Drawbacks of parallel corpora and advantages of comparable corpora; 1.2.4. Difficulties of technical translation; 1.2.5. Industrial context
1.3. Term alignment from comparable corpora: a state-of-the-art1.3.1. Distributional approach principle; 1.3.2. Term alignment evaluation; 1.3.2.1. Precision at rank N or TopN; 1.3.2.2. MRR; 1.3.2.3. MAP; 1.3.3. Improvement and variants of the distributional approach; 1.3.3.1. Favoring distributional symmetry; 1.3.3.2. Using syntactic contexts; 1.3.3.3. Relying on trusted elements; 1.3.3.4. Improving semantic information representation; 1.3.3.5. Using second-order semantic affinities; 1.3.3.6. Improving the bilingual resource with semantic classes; 1.3.3.7. Translating polylexical units
1.3.4. Influence of data and parameters on alignment quality1.3.4.1. Data; 1.3.4.2. Parameters; 1.3.5. Limits of the distributional approach; 1.4. CAT software prototype for comparable corpora processing; 1.4.1. Implementation of a term alignment method; 1.4.1.1. Implementation and data; 1.4.1.2. Extraction of the terms to be aligned; 1.4.1.3. Collecting context vectors; 1.4.1.3.1. Monolexical term context vectors; 1.4.1.4. Polylexical term context vectors; 1.4.1.5. Translation of the source context vectors; 1.4.1.6. Term alignment; 1.4.2. Terminological records extraction
1.4.3. Lexicon consultation interface1.5. Summary; Chapter 2: User-Centered Evaluation of Lexicons Extracted from Comparable Corpora; 2.1. Introduction; 2.2. Translation quality evaluation methodologies; 2.2.1. Machine translation evaluation; 2.2.1.1. Automatic evaluation measures; 2.2.1.2. Human MT evaluation; 2.2.2. Human translation evaluation; 2.2.2.1. Quantitative models; 2.2.2.2. Non-quantitative models; 2.2.3. Discussion; 2.3. Design and experimentation of a user-centered evaluation; 2.3.1. Methodological aspects; 2.3.1.1. Evaluation criteria and purpose
2.3.1.2. Subject matter expertise2.3.1.3. Basis for comparison; 2.3.2. Experimentation protocol; 2.3.2.1. Data; 2.3.2.1.1. Comparable corpora and extracted lexica; 2.3.2.1.2. Texts to be translated; 2.3.2.1.3. Resources used in the translation situation; 2.3.2.1.4. Translators and judges; 2.3.2.2. Evaluation progress; 2.3.2.2.1. Translation phase; 2.3.2.2.2. Translation quality evaluation phase; 2.3.3. Results; 2.3.3.1. Lexicons usability; 2.3.3.1.1. Translation speed; 2.3.3.1.2. Use of resources; 2.3.3.1.3. Translators' impressions on the lexicons extracted from comparable corpora
2.3.3.2. Quality of the generated translations
Record Nr. UNINA-9910819095203321
Delpech Estelle Maryline  
London, England ; : , : Hoboken, New Jersey : , : iSTE : , : Wiley, , 2014
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems [[electronic resource] ] : 9th International Conference, CPAIOR 2012, Nantes, France, May 28 - June 1, 2012, Proceedings / / edited by Nicolas Beldiceanu, Narendra Jussien, Eric Pinson
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems [[electronic resource] ] : 9th International Conference, CPAIOR 2012, Nantes, France, May 28 - June 1, 2012, Proceedings / / edited by Nicolas Beldiceanu, Narendra Jussien, Eric Pinson
Edizione [1st ed. 2012.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012
Descrizione fisica 1 online resource (XI, 409 p. 69 illus.)
Disciplina 519.6/4
Collana Theoretical Computer Science and General Issues
Soggetto topico Numerical analysis
Computer science—Mathematics
Discrete mathematics
Algorithms
Artificial intelligence
Operations research
Numerical Analysis
Discrete Mathematics in Computer Science
Artificial Intelligence
Operations Research and Decision Theory
ISBN 3-642-29828-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISA-996465553903316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Trends in constraint programming / / edited by Frédéric Benhamou, Narendra Jussien, Barry O'Sullivan
Trends in constraint programming / / edited by Frédéric Benhamou, Narendra Jussien, Barry O'Sullivan
Edizione [1st ed.]
Pubbl/distr/stampa Newport Beach, CA : , : ISTE USA, , 2007
Descrizione fisica 1 online resource (410 p.)
Disciplina 005.1
005.1/16
005.116
Collana ISTE
Soggetto topico Constraint programming (Computer science)
Soggetto genere / forma Electronic books.
ISBN 1-280-84786-7
9786610847860
0-470-61230-4
0-470-39494-3
1-84704-647-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Trends in Constraint Programming; Contents; Introduction; Part I. The Past, Present and Future of Constraint Programming; Chapter 1. Constraint Programming as Declarative Algorithmics; 1.1. The CHIP project; 1.2. The Numerica project; 1.3. The OPL project; 1.4. The Comet project; 1.5. The future of constraint programming; Chapter 2. Constraint Programming Tools; 2.1. Introduction; 2.2. Invited talks; 2.2.1. The development of an industrial CP tool; 2.2.1.1. Design goals; 2.2.1.2. The future; 2.2.2. System design: taking informed decisions; 2.2.2.1. Search; 2.2.2.2. Constraint propagation
2.2.2.3. Variables2.3. System presentations; 2.3.1. ECLiPSe; 2.3.2. SICStus FD; 2.3.3. G12; 2.3.4. DiSolver; 2.3.5.MINION; 2.3.6. Choco; 2.3.7. Gecode; 2.3.8. Comet; 2.3.9. JaCoP; 2.3.10. Borderwijk; 2.4. Panels; 2.5. Conclusion; 2.6. References; Chapter 3. The Next 10 Years of Constraint Programming; 3.1. Pedro Barahona; 3.2. Christian Bessiere; 3.3. Peter Jeavons; 3.4. Pedro Meseguer; 3.5. Gilles Pesant; 3.6. Francesca Rossi; 3.7. Thomas Schiex; 3.8. Christian Schulte; 3.9. Meinolf Sellmann; 3.10. Mark Wallace; 3.11. Toby Walsh; 3.12. Roland Yap; 3.13. References
Chapter 4. Constraint Propagation and Implementation4.1. Filtering algorithms for precedence and dependency constraints; 4.1.1. Problem description and related works; 4.1.2. Filtering rules for precedence and dependency constraints; 4.1.3. Summary; 4.2. A study of residual supports in arc consistency; 4.3. Maintaining singleton arc consistency; 4.3.1. Mixed consistency; 4.3.2. Checking existential-SAC; 4.3.3. Conclusion; 4.4. Probabilistic singleton arc consistency; 4.5. Simplification and extension of the SPREAD constraint; 4.5.1. Filtering of π; 4.5.2. Filtering of X; 4.5.3. Conclusion
4.6. A new filtering algorithm for the graph isomorphism problem4.6.1. A global constraint for the graph isomorphism problem; 4.6.2. ILL-consistency and ILL-filtering; 4.6.3. Experimental results; 4.7. References; Chapter 5. On the First SAT/CP Integration Workshop; 5.1. The technical program; 5.1.1. The invited talk; 5.1.2. Contributions related to SMT and solver integration; 5.1.3. Contributions related to the use of SAT techniques to improve CSP/CP solvers; 5.1.4. Other contributions; 5.2. The panel session; 5.2.1. Are SAT and CP different or similar?
5.2.2. Why has SAT succeeded in reducing the tuning issue?5.2.3. How long can the current generation of SAT solvers evolve?; 5.2.4. Were performance issues correctly addressed by CP?; 5.2.5. Was CP too ambitious?; 5.2.6. Do we still need CP?; 5.3. Summary, future directions and conclusion; 5.4. References; Chapter 6. Constraint-Based Methods for Bioinformatics; 6.1. On using temporal logic with constraints to express biological properties of cell processes; 6.2. Modeling biological systems in stochastic concurrent constraint programming
6.3. Chemera: constraints in protein structural problems
Record Nr. UNINA-9910144653803321
Newport Beach, CA : , : ISTE USA, , 2007
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Trends in constraint programming / / edited by Frédéric Benhamou, Narendra Jussien, Barry O'Sullivan
Trends in constraint programming / / edited by Frédéric Benhamou, Narendra Jussien, Barry O'Sullivan
Edizione [1st ed.]
Pubbl/distr/stampa Newport Beach, CA : , : ISTE USA, , 2007
Descrizione fisica 1 online resource (410 p.)
Disciplina 005.1
005.1/16
005.116
Collana ISTE
Soggetto topico Constraint programming (Computer science)
ISBN 1-280-84786-7
9786610847860
0-470-61230-4
0-470-39494-3
1-84704-647-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Trends in Constraint Programming; Contents; Introduction; Part I. The Past, Present and Future of Constraint Programming; Chapter 1. Constraint Programming as Declarative Algorithmics; 1.1. The CHIP project; 1.2. The Numerica project; 1.3. The OPL project; 1.4. The Comet project; 1.5. The future of constraint programming; Chapter 2. Constraint Programming Tools; 2.1. Introduction; 2.2. Invited talks; 2.2.1. The development of an industrial CP tool; 2.2.1.1. Design goals; 2.2.1.2. The future; 2.2.2. System design: taking informed decisions; 2.2.2.1. Search; 2.2.2.2. Constraint propagation
2.2.2.3. Variables2.3. System presentations; 2.3.1. ECLiPSe; 2.3.2. SICStus FD; 2.3.3. G12; 2.3.4. DiSolver; 2.3.5.MINION; 2.3.6. Choco; 2.3.7. Gecode; 2.3.8. Comet; 2.3.9. JaCoP; 2.3.10. Borderwijk; 2.4. Panels; 2.5. Conclusion; 2.6. References; Chapter 3. The Next 10 Years of Constraint Programming; 3.1. Pedro Barahona; 3.2. Christian Bessiere; 3.3. Peter Jeavons; 3.4. Pedro Meseguer; 3.5. Gilles Pesant; 3.6. Francesca Rossi; 3.7. Thomas Schiex; 3.8. Christian Schulte; 3.9. Meinolf Sellmann; 3.10. Mark Wallace; 3.11. Toby Walsh; 3.12. Roland Yap; 3.13. References
Chapter 4. Constraint Propagation and Implementation4.1. Filtering algorithms for precedence and dependency constraints; 4.1.1. Problem description and related works; 4.1.2. Filtering rules for precedence and dependency constraints; 4.1.3. Summary; 4.2. A study of residual supports in arc consistency; 4.3. Maintaining singleton arc consistency; 4.3.1. Mixed consistency; 4.3.2. Checking existential-SAC; 4.3.3. Conclusion; 4.4. Probabilistic singleton arc consistency; 4.5. Simplification and extension of the SPREAD constraint; 4.5.1. Filtering of π; 4.5.2. Filtering of X; 4.5.3. Conclusion
4.6. A new filtering algorithm for the graph isomorphism problem4.6.1. A global constraint for the graph isomorphism problem; 4.6.2. ILL-consistency and ILL-filtering; 4.6.3. Experimental results; 4.7. References; Chapter 5. On the First SAT/CP Integration Workshop; 5.1. The technical program; 5.1.1. The invited talk; 5.1.2. Contributions related to SMT and solver integration; 5.1.3. Contributions related to the use of SAT techniques to improve CSP/CP solvers; 5.1.4. Other contributions; 5.2. The panel session; 5.2.1. Are SAT and CP different or similar?
5.2.2. Why has SAT succeeded in reducing the tuning issue?5.2.3. How long can the current generation of SAT solvers evolve?; 5.2.4. Were performance issues correctly addressed by CP?; 5.2.5. Was CP too ambitious?; 5.2.6. Do we still need CP?; 5.3. Summary, future directions and conclusion; 5.4. References; Chapter 6. Constraint-Based Methods for Bioinformatics; 6.1. On using temporal logic with constraints to express biological properties of cell processes; 6.2. Modeling biological systems in stochastic concurrent constraint programming
6.3. Chemera: constraints in protein structural problems
Record Nr. UNISA-996206952003316
Newport Beach, CA : , : ISTE USA, , 2007
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Trends in constraint programming / / edited by Frédéric Benhamou, Narendra Jussien, Barry O'Sullivan
Trends in constraint programming / / edited by Frédéric Benhamou, Narendra Jussien, Barry O'Sullivan
Edizione [1st ed.]
Pubbl/distr/stampa Newport Beach, CA : , : ISTE USA, , 2007
Descrizione fisica 1 online resource (410 p.)
Disciplina 005.1
005.1/16
005.116
Collana ISTE
Soggetto topico Constraint programming (Computer science)
ISBN 1-280-84786-7
9786610847860
0-470-61230-4
0-470-39494-3
1-84704-647-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Trends in Constraint Programming; Contents; Introduction; Part I. The Past, Present and Future of Constraint Programming; Chapter 1. Constraint Programming as Declarative Algorithmics; 1.1. The CHIP project; 1.2. The Numerica project; 1.3. The OPL project; 1.4. The Comet project; 1.5. The future of constraint programming; Chapter 2. Constraint Programming Tools; 2.1. Introduction; 2.2. Invited talks; 2.2.1. The development of an industrial CP tool; 2.2.1.1. Design goals; 2.2.1.2. The future; 2.2.2. System design: taking informed decisions; 2.2.2.1. Search; 2.2.2.2. Constraint propagation
2.2.2.3. Variables2.3. System presentations; 2.3.1. ECLiPSe; 2.3.2. SICStus FD; 2.3.3. G12; 2.3.4. DiSolver; 2.3.5.MINION; 2.3.6. Choco; 2.3.7. Gecode; 2.3.8. Comet; 2.3.9. JaCoP; 2.3.10. Borderwijk; 2.4. Panels; 2.5. Conclusion; 2.6. References; Chapter 3. The Next 10 Years of Constraint Programming; 3.1. Pedro Barahona; 3.2. Christian Bessiere; 3.3. Peter Jeavons; 3.4. Pedro Meseguer; 3.5. Gilles Pesant; 3.6. Francesca Rossi; 3.7. Thomas Schiex; 3.8. Christian Schulte; 3.9. Meinolf Sellmann; 3.10. Mark Wallace; 3.11. Toby Walsh; 3.12. Roland Yap; 3.13. References
Chapter 4. Constraint Propagation and Implementation4.1. Filtering algorithms for precedence and dependency constraints; 4.1.1. Problem description and related works; 4.1.2. Filtering rules for precedence and dependency constraints; 4.1.3. Summary; 4.2. A study of residual supports in arc consistency; 4.3. Maintaining singleton arc consistency; 4.3.1. Mixed consistency; 4.3.2. Checking existential-SAC; 4.3.3. Conclusion; 4.4. Probabilistic singleton arc consistency; 4.5. Simplification and extension of the SPREAD constraint; 4.5.1. Filtering of π; 4.5.2. Filtering of X; 4.5.3. Conclusion
4.6. A new filtering algorithm for the graph isomorphism problem4.6.1. A global constraint for the graph isomorphism problem; 4.6.2. ILL-consistency and ILL-filtering; 4.6.3. Experimental results; 4.7. References; Chapter 5. On the First SAT/CP Integration Workshop; 5.1. The technical program; 5.1.1. The invited talk; 5.1.2. Contributions related to SMT and solver integration; 5.1.3. Contributions related to the use of SAT techniques to improve CSP/CP solvers; 5.1.4. Other contributions; 5.2. The panel session; 5.2.1. Are SAT and CP different or similar?
5.2.2. Why has SAT succeeded in reducing the tuning issue?5.2.3. How long can the current generation of SAT solvers evolve?; 5.2.4. Were performance issues correctly addressed by CP?; 5.2.5. Was CP too ambitious?; 5.2.6. Do we still need CP?; 5.3. Summary, future directions and conclusion; 5.4. References; Chapter 6. Constraint-Based Methods for Bioinformatics; 6.1. On using temporal logic with constraints to express biological properties of cell processes; 6.2. Modeling biological systems in stochastic concurrent constraint programming
6.3. Chemera: constraints in protein structural problems
Record Nr. UNINA-9910830751803321
Newport Beach, CA : , : ISTE USA, , 2007
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui