{'fraction_non_alphanumeric': 0.020446096654275093, 'fraction_numerical': 0.0, 'mean_word_length': 5.4879518072289155, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
PNL-Enhanced Restricted Domain Question Answering System

The concept of PNL (Precisiated Natural Language) has been proposed by Zadeh for computation with perceptions and some problems described in natural language. We describe a design for restricted domain question answering systems enhanced by PNL-based reasoning. For a subset of a knowledge corpus (e.g. critical or frequently-asked topics) where fuzzy set definitions of vague terms are provided, more precise answers can be computed via protoformal deduction. Nested structure in the system design also enables processing of natural language statements that are not PNL protoforms using phrase-based deduction and concept matching to generate the most relevant facts for a query. If deduction results yield low confidence factor, standard search engine provides a baseline response (relevant paragraphs based on keyword matches). Our design principles aim for flexible, domain independent capability and minimize human input to provision of semantic clues and background knowledge during design or application set-up.