Obfuscation for privacy-preserving syntactic parsing

Open Access
Authors
Publication date 2020
Host editors
  • G. Bouma
  • Y. Matsumoto
  • S. Oepen
  • K. Sagae
  • D. Seddah
  • W. Sun
  • A. Søgaard
  • R. Tsarfaty
  • D. Zeman
Book title The 16th International Conference on Parsing Technologies and IWPT 2020 Shared Task on Parsing into Enhanced Universal Dependencies
Book subtitle IWPT 2020 : Proceedings of the Conference : July 9, 2020
ISBN (electronic)
  • 9781952148118
Event 16th International Conference on Parsing Technologies, IWPT 2020, co-located with the 58th Annual Meeting of the Association for Computational Linguistics, ACL 2020
Pages (from-to) 62-72
Number of pages 11
Publisher Stroudsburg, PA: Association for Computational Linguistics
Organisations
  • Interfacultary Research - Institute for Logic, Language and Computation (ILLC)
Abstract

The goal of homomorphic encryption is to encrypt data such that another party can operate on it without being explicitly exposed to the content of the original data. We introduce an idea for a privacy-preserving transformation on natural language data, inspired by homomorphic encryption. Our primary tool is obfuscation, relying on the properties of natural language. Specifically, a given English text is obfuscated using a neural model that aims to preserve the syntactic relationships of the original sentence so that the obfuscated sentence can be parsed instead of the original one. The model works at the word level, and learns to obfuscate each word separately by changing it into a new word that has a similar syntactic role. The text obfuscated by our model leads to better performance on three syntactic parsers (two dependency and one constituency parsers) in comparison to an upper-bound random substitution baseline. More specifically, the results demonstrate that as more terms are obfuscated (by their part of speech), the substitution upper bound significantly degrades, while the neural model maintains a relatively high performing parser. All of this is done without much sacrifice of privacy compared to the random substitution upper bound. We also further analyze the results, and discover that the substituted words have similar syntactic properties, but different semantic content, compared to the original words.

Document type Conference contribution
Language English
Published at https://doi.org/10.18653/v1/2020.iwpt-1.7
Other links https://github.com/ichn-hu/Parsing-Obfuscation http://slideslive.com/38929674 https://www.scopus.com/pages/publications/85118193947
Downloads
2020.iwpt-1.7 (Final published version)
Permalink to this page
Back