| CPC H04M 3/5175 (2013.01) [G06F 21/6254 (2013.01); G06F 40/279 (2020.01); G06F 40/30 (2020.01); G10L 15/02 (2013.01); G10L 15/1815 (2013.01); G10L 15/26 (2013.01); G10L 15/30 (2013.01); G10L 25/72 (2013.01); H04M 3/42221 (2013.01); H04M 3/5191 (2013.01); G10L 2015/088 (2013.01); H04M 2203/301 (2013.01); H04M 2203/303 (2013.01); H04M 2203/401 (2013.01); H04M 2203/551 (2013.01); H04M 2203/6009 (2013.01)] | 30 Claims |

|
1. A method of managing a customer journey, comprising:
receiving a first communication from a customer, the first communication being associated with an enterprise;
receiving a second communication from the customer, the second communication being associated with a same enterprise;
analyzing the first communication and the second communication using a computer-based communications analytics facility for a language characteristic and at least one non-word characteristic, the at least one non-word characteristic including at least one of a non-word symbol or an acoustic characteristic;
linking the first communication and the second communication as being associated with the enterprise and being from the same customer, the linking involving storing information from the language characteristic and the at least one non-word characteristic in a unified database;
determining, based on the stored information, a root cause of repeat contact of the customer with the enterprise and a loyalty score for the customer;
determining, from the at least one of the non-word symbol or the acoustic characteristic, an emotional state indicator of the customer;
providing, via a graphical user interface, a dynamic graphical representation of the emotional state indicator, the dynamic graphical representation including a visual indication; and
changing the visual indication based on the emotional state indicator,
wherein the unified database is searchable by a user according to discrete searches, and the discrete searches are configured to be weighted by the user, whereby false positive and false negative search results are minimized by the weighted discrete searches.
|