Assisted Contracts Validation through LCS problem resolution

Autori

  • Francesca Martinucci Network Contacts – Research and Development Department Molfetta, Italia
  • Michele Stingo Network Contacts - Research and Development Department, Molfetta, Italia
  • Massimiliano Polito Università degli Studi di Salerno, Fisciano (SA), Italia

Parole chiave:

Longest Common Subsequence, Text Comparison, Text Validation, Natural Language Processing

Abstract

Verbal stipulation of contracts over the phone has become increasingly important in terms of sales volume for both b2b (business to business) and b2c (business to consumers) companies, especially when involved in main industrial branches such as those of telecommunication and energy. So, in order to be considered legally valid, a contract over the phone has to be spoken out correctly in its entirety — especially for those words concerning sensitive data — by the marketing outbound operator in charge with the stipulation. As a means of retrieving an esteem of re–liability for the stipulation outcomes and, in turn, as a useful and handy tool at disposal of the internal marketing analysts for the validation of concluded contracts, the present paper describes a software pipeline which exploits the resolution of the Longest Common Subsequence Problem in order to compare audio transcription of contracts stipulated over the phone against the certified written source of the same.

Pubblicato

30-12-2020

Fascicolo

Sezione

Contributi