natural language steganography and an ai complete
play

Natural Language Steganography and an AI-complete Security Primitive - PowerPoint PPT Presentation

Nov 25, 2023 •107 likes •1.94k views

Natural Language Steganography and an AI-complete Security Primitive by Richard Bergmair Oct-03 Apr-04 University of Derby in Austria Technische Universitt Mnchen conducted under the supervision of Stefan Katzenbeisser Natural

  1. Motivation What happens if Wendy the warden intercepts a secure cryptogram? Serious consequences! • the greedy employer will fire Alice and Bob • the evil government will send Alice and Bob to Guantanomo Bay Natural Language Steganography and an “AI-complete” Security Primitive – p.36/182

  2. Motivation What happens if Wendy the warden intercepts a secure cryptogram? Serious consequences! • the greedy employer will fire Alice and Bob • the evil government will send Alice and Bob to Auschwitz Natural Language Steganography and an “AI-complete” Security Primitive – p.37/182

  3. Motivation What happens if Wendy the warden intercepts a secure cryptogram? Serious consequences! As long as there is a way for Wendy to tell ciphertext from cleartext, Alice and Bob will not live in peace! Natural Language Steganography and an “AI-complete” Security Primitive – p.38/182

  4. Motivation What happens if Wendy the warden intercepts a secure cryptogram? Serious consequences! As long as there is a way for Wendy to tell ciphertext from cleartext, Alice and Bob will not live in peace! Solution: Alice and Bob must use steganographic methods, rather than purely cryptographic ones, in order to hide not only the content of a message from the adversary, but its very existence! Natural Language Steganography and an “AI-complete” Security Primitive – p.39/182

  5. Motivation The difference between a cryptogram and a steganogram, is that a steganogram always appears innocuous to Wendy. Natural Language Steganography and an “AI-complete” Security Primitive – p.40/182

  6. Introduction The difference between a cryptogram and a steganogram, is that a steganogram always appears innocuous to Wendy. But what is innocuous ? Natural Language Steganography and an “AI-complete” Security Primitive – p.41/182

  7. Introduction The difference between a cryptogram and a steganogram, is that a steganogram always appears innocuous to Wendy. But what is innocuous ? In the simplest case Wendy has a list of innocuous cover symbols. Natural Language Steganography and an “AI-complete” Security Primitive – p.42/182

  8. Introduction { Midshires is a nice little city , C = Midshires is a great little city , Midshires is a fine little city , Midshires is a decent little city , Midshires is a wonderful little city , Midshires is a nice little town , Midshires is a great little town } . If c ∈ C , then Wendy knows that c is innocuous. Natural Language Steganography and an “AI-complete” Security Primitive – p.43/182

  9. Introduction { I don’t like my government! , M = I don’t like my internet provider! , I don’t like my employer! , I’m wearing ladies’ underwear! } . Alice wants to send Bob a message m ∈ M . Natural Language Steganography and an “AI-complete” Security Primitive – p.44/182

  10. Introduction Instead of enlisting C = { Midshires is a ... } : • We know an innocuous sentence c = { Midshires is a nice little town , } • We have a dictionary, that tells us that the words { nice , great , fine , decent , wonderful } and { city , town } are synonymous , i.e. mean the same. • We know that, by substituting a word in c by a synonym, we never make an innocuous sentence suspicious, since we do not alter its meaning. Natural Language Steganography and an “AI-complete” Security Primitive – p.45/182

  11. Introduction Instead of enlisting C = { Midshires is a ... } :   nice       great     � �   city   = Midshires is a fine little C town   decent         wonderful     Natural Language Steganography and an “AI-complete” Security Primitive – p.46/182

  12. Introduction Instead of enlisting M = { I don’t like ... } : • We assume that Alice and Bob will exchange arbitrary bitstrings, so M = { 0 , 1 } ∗ Natural Language Steganography and an “AI-complete” Security Primitive – p.47/182

  13. Alice and Bob Fool Wendy   00 nice       01 great     � �   0 city   Midshires is a 10 fine little . 1 town   11 decent         ?? wonderful     • m 1 = 101 encodes to c 1 = Midshires is a fine little town • m 2 = 010 encodes to c 2 = Midshires is a great little city • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.48/182

  14. Alice and Bob Fool Wendy   00 nice       01 great     � �   0 city   Midshires is a 10 fine little . 1 town   11 decent         ?? wonderful     Keith Winstein and Mark Chapman have actually built variants of this system. Natural Language Steganography and an “AI-complete” Security Primitive – p.49/182

  15. Wendy Strikes Back Statistic characteristics of the secret message “show trough” to the word-choices in the steganogram! Natural Language Steganography and an “AI-complete” Security Primitive – p.50/182

  16. Wendy Strikes Back   00 nice ||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • m 0 = 101 • m 1 = 001 • m 2 = 111 • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.51/182

  17. Wendy Strikes Back   00 nice ||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • m 1 = 001 • m 2 = 111 • m 3 = 101 • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.52/182

  18. Wendy Strikes Back   00 nice ||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • m 2 = 111 • m 3 = 101 • m 4 = 000 • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.53/182

  19. Wendy Strikes Back   00 nice ||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • m 3 = 101 • m 4 = 000 • m 5 = 010 • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.54/182

  20. Wendy Strikes Back   00 nice ||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • m 4 = 000 • m 5 = 010 • m 6 = 000 • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.55/182

  21. Wendy Strikes Back   00 nice ||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • m 5 = 010 • m 6 = 000 • m 7 = 010 • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.56/182

  22. Wendy Strikes Back   00 nice ||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • m 6 = 000 • m 7 = 010 • m 8 = 100 • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.57/182

  23. Wendy Strikes Back   00 nice ||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • m 7 = 010 • m 8 = 100 • m 9 = 110 • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.58/182

  24. Wendy Strikes Back   00 nice ||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • m 8 = 100 • m 9 = 110 • m 10 = 111 • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.59/182

  25. Wendy Strikes Back   00 nice ||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • m 9 = 110 • m 10 = 111 • m 11 = 100 • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.60/182

  26. Wendy Strikes Back   00 nice ||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • m 10 = 111 • m 11 = 100 • m 12 = 111 • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.61/182

  27. Wendy Strikes Back   00 nice ||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • m 11 = 100 • m 12 = 111 • m 13 = 011 • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.62/182

  28. Wendy Strikes Back   00 nice ||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • m 12 = 111 • m 13 = 011 • m 14 = 011 • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.63/182

  29. Wendy Strikes Back   00 nice ||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • m 13 = 011 • m 14 = 011 • m 15 = 000 • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.64/182

  30. Wendy Strikes Back   00 nice ||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • m 14 = 011 • m 15 = 000 • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.65/182

  31. Wendy Strikes Back   00 nice ||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • m 15 = 000 • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.66/182

  32. Wendy Strikes Back   00 nice ||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.67/182

  33. Wendy Strikes Back Innocuous covers have statistic characteristics originating from the way native speakers use the language. Natural Language Steganography and an “AI-complete” Security Primitive – p.68/182

  34. Wendy Strikes Back   00 nice ||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • c 0 = Midshires is a nice little town • c 1 = Midshires is a nice little city • c 2 = Midshires is a nice little town • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.69/182

  35. Wendy Strikes Back   00 nice ||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • c 1 = Midshires is a nice little city • c 2 = Midshires is a nice little town • c 3 = Midshires is a nice little town • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.70/182

  36. Wendy Strikes Back   00 nice ||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • c 2 = Midshires is a nice little town • c 3 = Midshires is a nice little town • c 4 = Midshires is a nice little city • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.71/182

  37. Wendy Strikes Back   00 nice ||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • c 3 = Midshires is a nice little town • c 4 = Midshires is a nice little city • c 5 = Midshires is a great little city • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.72/182

  38. Wendy Strikes Back   00 nice ||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • c 4 = Midshires is a nice little city • c 5 = Midshires is a great little city • c 6 = Midshires is a nice little town • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.73/182

  39. Wendy Strikes Back   00 nice |||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • c 5 = Midshires is a great little city • c 6 = Midshires is a nice little town • c 7 = Midshires is a decent little town • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.74/182

  40. Wendy Strikes Back   00 nice |||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • c 6 = Midshires is a nice little town • c 7 = Midshires is a decent little town • c 8 = Midshires is a great little town • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.75/182

  41. Wendy Strikes Back   00 nice ||||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • c 7 = Midshires is a decent little town • c 8 = Midshires is a great little town • c 9 = Midshires is a nice little town • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.76/182

  42. Wendy Strikes Back   00 nice ||||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • c 8 = Midshires is a great little town • c 9 = Midshires is a nice little town • c 10 = Midshires is a wonderful little town • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.77/182

  43. Wendy Strikes Back   00 nice ||||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • c 9 = Midshires is a nice little town • c 10 = Midshires is a wonderful little town • c 11 = Midshires is a great little town • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.78/182

  44. Wendy Strikes Back   00 nice |||||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • c 10 = Midshires is a wonderful little town • c 11 = Midshires is a great little town • c 12 = Midshires is a great little city • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.79/182

  45. Wendy Strikes Back   00 nice |||||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||    • c 11 = Midshires is a great little town • c 12 = Midshires is a great little city • c 13 = Midshires is a fine little city • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.80/182

  46. Wendy Strikes Back   00 nice |||||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town |||||||||   11 decent ||||         ?? wonderful  ||||    • c 12 = Midshires is a great little city • c 13 = Midshires is a fine little city • c 14 = Midshires is a nice little city • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.81/182

  47. Wendy Strikes Back   00 nice |||||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town |||||||||   11 decent ||||         ?? wonderful  ||||    • c 13 = Midshires is a fine little city • c 14 = Midshires is a nice little city • c 15 = Midshires is a fine little city • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.82/182

  48. Wendy Strikes Back   00 nice |||||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town |||||||||   11 decent ||||         ?? wonderful  ||||    • c 14 = Midshires is a nice little city • c 15 = Midshires is a fine little city • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.83/182

  49. Wendy Strikes Back   00 nice ||||||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town |||||||||   11 decent ||||         ?? wonderful  ||||    • c 15 = Midshires is a fine little city • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.84/182

  50. Wendy Strikes Back   00 nice ||||||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town |||||||||   11 decent ||||         ?? wonderful  ||||    • ... Natural Language Steganography and an “AI-complete” Security Primitive – p.85/182

  51. Wendy Strikes Back   00 nice ||||       01 great ||||     � �   0 city ||||||||   is a 10 fine little |||| . 1 town ||||||||   11 decent ||||         ?? wonderful  ||||      00 nice ||||||||       01 great ||||     � �   0 city ||||||||   is a little 10 fine . |||| 1 town |||||||||   11 decent ||||         ?? wonderful  ||||    Natural Language Steganography and an “AI-complete” Security Primitive – p.86/182

  52. Alice, Bob, and Huffman This weakness is due to our use of block codes! Natural Language Steganography and an “AI-complete” Security Primitive – p.87/182

  53. Alice, Bob, and Huffman 00 101110110010111001011100010100 |||||||| 00 |||||||| 01 |||||||| 10 |||||||| 11 Natural Language Steganography and an “AI-complete” Security Primitive – p.88/182

  54. Alice, Bob, and Huffman 00 10 1110110010111001011100010100 |||||||| 00 |||||||| 01 |||||||| 10 |||||||| 11 Natural Language Steganography and an “AI-complete” Security Primitive – p.89/182

  55. Alice, Bob, and Huffman 0010 11 10110010111001011100010100 |||||||| 00 |||||||| 01 |||||||| 10 |||||||| 11 Natural Language Steganography and an “AI-complete” Security Primitive – p.90/182

  56. Alice, Bob, and Huffman 001011 10 110010111001011100010100 |||||||| 00 |||||||| 01 |||||||| 10 |||||||| 11 Natural Language Steganography and an “AI-complete” Security Primitive – p.91/182

  57. Alice, Bob, and Huffman 00101110 11 0010111001011100010100 |||||||| 00 |||||||| 01 |||||||| 10 |||||||| 11 Natural Language Steganography and an “AI-complete” Security Primitive – p.92/182

  58. Alice, Bob, and Huffman 0010111011 00 10111001011100010100 |||||||| 00 |||||||| 01 |||||||| 10 |||||||| 11 Natural Language Steganography and an “AI-complete” Security Primitive – p.93/182

  59. Alice, Bob, and Huffman 001011101100 10 111001011100010100 |||||||| 00 |||||||| 01 |||||||| 10 |||||||| 11 Natural Language Steganography and an “AI-complete” Security Primitive – p.94/182

  60. Alice, Bob, and Huffman 00101110110010 11 1001011100010100 |||||||| 00 |||||||| 01 |||||||| 10 |||||||| 11 Natural Language Steganography and an “AI-complete” Security Primitive – p.95/182

  61. Alice, Bob, and Huffman 0010111011001011 10 01011100010100 |||||||| 00 |||||||| 01 |||||||| 10 |||||||| 11 Natural Language Steganography and an “AI-complete” Security Primitive – p.96/182

  62. Alice, Bob, and Huffman 001011101100101110 01 011100010100 |||||||| 00 |||||||| 01 |||||||| 10 |||||||| 11 Natural Language Steganography and an “AI-complete” Security Primitive – p.97/182

  63. Alice, Bob, and Huffman 00101110110010111001 01 1100010100 |||||||| 00 |||||||| 01 |||||||| 10 |||||||| 11 Natural Language Steganography and an “AI-complete” Security Primitive – p.98/182

  64. Alice, Bob, and Huffman 0010111011001011100101 11 00010100 |||||||| 00 |||||||| 01 |||||||| 10 |||||||| 11 Natural Language Steganography and an “AI-complete” Security Primitive – p.99/182

  65. Alice, Bob, and Huffman 001011101100101110010111 00 010100 |||||||| 00 |||||||| 01 |||||||| 10 |||||||| 11 Natural Language Steganography and an “AI-complete” Security Primitive – p.100/182

Recommend

Natural Language Understanding We want to communicate with computers using natural language

Natural Language Understanding We want to communicate with computers using natural language

Natural Language Understanding We want to communicate with computers using natural language (spoken and written). unstructured natural language allow any statements, but make mistakes or failure. controlled natural language only

698 views • 20 slides
Advanced Natural Language Processing: What is Natural Language Processing (NLP)? Background

Advanced Natural Language Processing: What is Natural Language Processing (NLP)? Background

Course Logistics What is Natural Language Processing? computers using natural language as input and/or Instructor Regina Barzilay, Michael Collins output Email regina@csail.mit.edu, mcollins@csail.mit.edu computer language language

552 views • 13 slides
Linguistic Steganography on Twitter: Hierarchical Language Modelling with Manual Interaction

Linguistic Steganography on Twitter: Hierarchical Language Modelling with Manual Interaction

Linguistic Steganography on Twitter: Hierarchical Language Modelling with Manual Interaction Alex Wilson, Phil Blunsom, and Andrew D. Ker University of Oxford Twitter Twitter is a social networking site, launched in 2006. Users post

798 views • 30 slides
Natural language is a programming language: Applying natural language processing to software

Natural language is a programming language: Applying natural language processing to software

Natural language is a programming language: Applying natural language processing to software development Michael D. Ernst Presented by: Tomas Geffner, Subendhu Rongali & Natcha Simsiri Before we start, what is software? Not just code/AST

437 views • 23 slides
Steganography Implementation & Detection Robert Krenn rkrenn@xidc.nl January 21, 2004

Steganography Implementation & Detection Robert Krenn rkrenn@xidc.nl January 21, 2004

Steganography Implementation & Detection Robert Krenn rkrenn@xidc.nl January 21, 2004 Overview What is steganography? Implementations Detection Defeating steganography Conclusion Questions What is steganography?

488 views • 34 slides
Steganography with Public-Key Cryptography for Videoconference XXX CNMAC - Set/2007 Fbio

Steganography with Public-Key Cryptography for Videoconference XXX CNMAC - Set/2007 Fbio

Steganography with Public-Key Cryptography for Videoconference XXX CNMAC - Set/2007 Fbio Borges de Oliveira Steganography with Public-Key Cryptography for Videoconference p.1/26 Steganography Source: Steganography: Steganography with

786 views • 34 slides
Natural Language Processing George Konidaris gdk@cs.brown.edu Fall 2019 Natural Language

Natural Language Processing George Konidaris gdk@cs.brown.edu Fall 2019 Natural Language

Natural Language Processing George Konidaris gdk@cs.brown.edu Fall 2019 Natural Language Processing Understanding spoken/written sentences in a natural language. Major area of research in AI. Why? Humans use language to communicate.

1.17k views • 33 slides
Natural Language Processing Stages in understanding natural language Why its hard

Natural Language Processing Stages in understanding natural language Why its hard

Natural Language Processing Stages in understanding natural language Why its hard 14-11-2011 (Some slides adapted from presentations by Dan Jurafsky and Bonnie Dorr.) Computer Speech and Language Processing What is it? Getting

604 views • 11 slides
Neural Language Models The New Frontier of Natural Language Understanding Gabriele Sarti

Neural Language Models The New Frontier of Natural Language Understanding Gabriele Sarti

Neural Language Models The New Frontier of Natural Language Understanding Gabriele Sarti University of Trieste, SISSA & ItaliaNLP Lab StaTalk 2019 Table of Contents Natural Language Processing: On a Quest for Meaning Modeling Natural

773 views • 22 slides
NLTK: The Natural Language Toolkit Edward Loper Natural Language Processing Use

NLTK: The Natural Language Toolkit Edward Loper Natural Language Processing Use

NLTK: The Natural Language Toolkit Edward Loper Natural Language Processing Use computational methods to process human language. Examples: Machine translation Text classification Text summarization Question answering

502 views • 29 slides
Pragmatic aspects of natural language Vojtch Kov Natural Language Processing Centre

Pragmatic aspects of natural language Vojtch Kov Natural Language Processing Centre

Outline Pragmatics Grices cooperative principle Speech acts Pragmatic aspects of natural language Vojtch Kov Natural Language Processing Centre Faculty of Informatics, Masaryk University Botanick 68a, 602 00 Brno

260 views • 7 slides
Steganography and Steganalysis in digital age Tom Pevn Agent Technology Center, CTU 3rd

Steganography and Steganalysis in digital age Tom Pevn Agent Technology Center, CTU 3rd

Steganography and Steganalysis in digital age Tom Pevn Agent Technology Center, CTU 3rd December 2009 T. Pevn | Steganography and Steganalysis 1/30 Outline 1 Introduction What is steganography and steganalysis Definition of security

310 views • 30 slides
Outline of todays lecture Overview of Natural Language Generation Components of Natural

Outline of todays lecture Overview of Natural Language Generation Components of Natural

Natural Language Processing Outline of todays lecture Overview of Natural Language Generation Components of Natural Language Generation systems Data for NNs via classical realization Referring expressions Natural Language Processing

586 views • 37 slides
More NP-Complete Problems A language L is NP-Complete Lecture 4 L is in NP September 5,

More NP-Complete Problems A language L is NP-Complete Lecture 4 L is in NP September 5,

CS 573: Algorithms, Fall 2013 Recap NP : languages that have polynomial time certifiers/verifiers. More NP-Complete Problems A language L is NP-Complete Lecture 4 L is in NP September 5, 2013 for every L in NP , L P L L is

141 views • 12 slides
LANGUAGE MODELS 24.05.19 Statistical Natural Language Processing 1 Statistical natural

LANGUAGE MODELS 24.05.19 Statistical Natural Language Processing 1 Statistical natural

Jurafsky, D. and Martin, J. H. (2009): Speech and Language Processing. An Introduction to Natural Language Processing , Computational Linguistics and Speech Recognition. Second Edition. Pearson: New Jersey. Chapter 4 Manning, C. D. and

898 views • 60 slides
Natural Language Interaction Gurpreet Singh Papers Learning to Parse Natural Language

Natural Language Interaction Gurpreet Singh Papers Learning to Parse Natural Language

Natural Language Interaction Gurpreet Singh Papers Learning to Parse Natural Language Commands to a Robot Control System (Cynthia Matuszek, Evan Herbst, Luke Zettlemoyer, Dieter Fox) Interpreting Instruction Sequences in Spatial

445 views • 29 slides
1 NATURAL LOGIC IN NATURAL LANGUAGE Johan van Benthem,

1 NATURAL LOGIC IN NATURAL LANGUAGE Johan van Benthem,

1 NATURAL LOGIC IN NATURAL LANGUAGE Johan van Benthem, http://staff.fnwi.uva.nl/j.vanbenthem ILLC, Logic, Language and Computation, Monday 8 Sept 2014 Abstract

305 views • 4 slides
Natural Language Processing with Deep Learning CS224N/Ling284 Lecture 15: Natural Language

Natural Language Processing with Deep Learning CS224N/Ling284 Lecture 15: Natural Language

Natural Language Processing with Deep Learning CS224N/Ling284 Lecture 15: Natural Language Generation Christopher Manning Announcements Thank you for all your hard work! We know Assignment 5 was tough and a real challenge to do

1.24k views • 87 slides
Advanced Natural Language Processing: What is Natural Language Processing (NLP)? Background

Advanced Natural Language Processing: What is Natural Language Processing (NLP)? Background

Overview Advanced Natural Language Processing: What is Natural Language Processing (NLP)? Background and Overview Why is NLP hard? What will this course be about? Michael Collins EECS/CSAIL September 6, 2007 Advanced Natural

296 views • 7 slides
Let the AI do the Talk Adventures with Natural Language Generation @MarcoBonzanini PyParis 2018

Let the AI do the Talk Adventures with Natural Language Generation @MarcoBonzanini PyParis 2018

Let the AI do the Talk Adventures with Natural Language Generation @MarcoBonzanini PyParis 2018 PyData London Conference 12-14 July 2019 @PyDataLondon NATURAL LANGUAGE GENERATION Natural Language Processing 5 Natural Language Processing

1.43k views • 84 slides
Information Extraction Industrial Natural Language Processing Industrial Natural Language

Information Extraction Industrial Natural Language Processing Industrial Natural Language

Industrial Natural Language Processing & Information Extraction Industrial Natural Language Processing Industrial Natural Language Processing Overview Natural Language Processing Developing and applying techniques NLP and methods for

479 views • 20 slides
Introduction to Natural Language Processing CMSC 470 Marine Carpuat Natural Language Processing

Introduction to Natural Language Processing CMSC 470 Marine Carpuat Natural Language Processing

Introduction to Natural Language Processing CMSC 470 Marine Carpuat Natural Language Processing (NLP) The engineering discipline of doing what people do with language, but using computers Computational Linguistics (CL) The science of

934 views • 28 slides
Statistical Natural Language Processing Prasad Tadepalli CS430 lecture Natural Language

Statistical Natural Language Processing Prasad Tadepalli CS430 lecture Natural Language

Statistical Natural Language Processing Prasad Tadepalli CS430 lecture Natural Language Processing Some subproblems are partially solved Spelling correction, grammar checking Information retrieval with keywords Semi-automatic

483 views • 9 slides
Natural Language Processing: Part II Overview of Natural Language Processing (L90): ACS Lecture

Natural Language Processing: Part II Overview of Natural Language Processing (L90): ACS Lecture

Natural Language Processing: Part II Overview of Natural Language Processing (L90): ACS Natural Language Processing: Part II Overview of Natural Language Processing (L90): ACS Lecture 10: Discourse Simone Teufel (Materials by Ann Copestake)

501 views • 36 slides

More recommend