PATENT CLAIM ANALYSIS

Application Number: 15899389
Application Type: Utility
Filing Date: 2018-02
Publication Date: 2018-08
Patent Classification: ["704", "009000"]

Abstract:
The invention relates to a system and method for integrating domain information into state transitions of a Finite State Transducer (“FST”) for natural language processing. A system may integrate semantic parsing and information retrieval from an information domain to generate an FST parser that represents the information domain. The FST parser may include a plurality of FST paths, at least one of which may be used to generate a meaning representation from a natural language input. As such, the system may perform domain-based semantic parsing of a natural language input, generating more robust meaning representations using domain information. The system may be applied to a wide range of natural language applications that use natural language input from a user such as, for example, natural language interfaces to computing systems, communication with robots in natural language, personalized digital assistants, question-answer query systems, and/or other natural language processing applications.

Claim (Index 1):
A computer implemented method for integrating domain information and semantic parsing to generate meaning representations from natural language input, the method being implemented on a computer system having one or more physical processors programmed with computer program instructions to perform the method, the method comprising:\n receiving, by the computer system, a natural language input comprising at least a first input token; obtaining, by the computer system, a semantic grammar; determining, by the computer system, a semantic structure of the natural language input based on the semantic grammar; retrieving, by the computer system, from an information domain, a plurality of domain tokens that match the first token of the natural language input; and generating, by the computer system, a meaning representation based on the semantic structure and the plurality of domain tokens, wherein the meaning representation is used to execute a computer executable action.

Metadata:
- Claim Count in Document: 4.0
- Percentile: 88.0
- Lexical Diversity: 1.94118
- Patent Class: 704.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['14855346', '14951389', '15726394', '14176067', '15091191']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.3159668903063567
- 35 USC 102 Novelty (BERT): 0.6428889669382224
- Combined Prediction Score: 0.3486590979695433
- Mean Citation Score: 327.10835800000007
- Max Citation Score: 646.7632
- Similarity Product: 585.3816637395859

Labels:
- Claim Label 101: 0
- Claim Label 102: 1
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 0
- Label 101 Adjusted: 0

Dataset: test