Remote Network Query Parsing Using Extended BNF Grammar
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Large-scale managed networks face challenges in efficiently and consistently parsing user queries due to varying data types, amounts, and search methods, leading to difficulties in retrieving desired results.
Innovation Solution
A remote network management platform uses extended Backus-Naur form (BNF) grammar rules and linguistic corrections to parse natural language queries, allowing for seamless updates and improved query understanding, including the use of regular expressions and metadata terms to enhance query processing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional database search methods are used, then data retrieval can be performed, but parsing efficiency and consistency deteriorate as query complexity and frequency increase
Solution Approach 1:
The patent introduces an extended BNF grammar system as an intermediary layer between natural language queries and database search operations. This grammar system acts as a mediator that translates varied user queries into standardized search sentences, resolving the contradiction by providing a consistent parsing mechanism that handles complexity without deteriorating efficiency
Solution Approach 2:
The patent modifies the traditional BNF grammar parameters by adding extended rules that incorporate linguistic patterns, regular expressions, and metadata terms. This parameter expansion allows the system to handle increasingly complex queries while maintaining parsing efficiency, directly addressing the contradiction between query complexity and retrieval productivity
2Measurement precision
If extended BNF grammar rules are implemented, then query parsing accuracy improves, but system complexity increases
Solution Approach 1:
The patent segments the extended BNF grammar into distinct modular components: core grammar rules, extended linguistic rules, regular expression patterns, and metadata term definitions. This segmentation allows the system to achieve high parsing accuracy through comprehensive rules while managing complexity through modular organization that enables selective application and easier maintenance
Solution Approach 2:
The extended BNF grammar system is designed as a universal parsing framework that handles multiple query types, languages, and complexities through a single integrated rule set. This multi-functionality improves parsing accuracy across diverse queries while avoiding the need for separate complex systems for each query type
3Measurement precision
If linguistic rules are applied to correct query terms, then search result accuracy improves, but processing time increases
Solution Approach 1:
The patent applies linguistic correction rules in advance during the query parsing stage, before the actual database search is executed. By performing term corrections, expansions, and validations preliminarily through the extended BNF grammar, the system ensures accurate search results while minimizing processing time during the critical search execution phase
Data Source
AI summary
An example embodiment may involve a software application executable on a computing device of a computational instance of a remote network management platform associated with a managed network. The software application may receive, from a client device of the managed network, a natural language query, determine that a first term of the query does not match any term in a list of predetermined terms, and revise the query by (i) applying a set of linguistic rules that modify the first term to generate a replacement term, (ii) determining whether the replacement term matches at least one term in the list, and (iii) after determining that the replacement term matches at least one term in the list, replacing the first term in the query with the replacement term. The software application may then parse the revised query, search the database, and transmit a result to the client device.