Bidirectional probabilistic natural language rewriting and selection
US10599645B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Oct 6, 2017 |
| Grant date | Mar 24, 2020 |
| Priority date | — |
| Expiry date | Jun 17, 2038 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG10L15/183
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A speech recognition and natural language understanding system performs insertion, deletion, and replacement edits of tokens at positions with low probabilities according to both a forward and a backward statistical language model (SLM) to produce rewritten token sequences. Multiple rewrites can be produced with scores depending on the probabilities of tokens according to the SLMs. The rewritten token sequences can be parsed according to natural language grammars to produce further weighted scores. Token sequences can be rewritten iteratively using a graph-based search algorithm to find the best rewrite. Mappings of input token sequences to rewritten token sequences can be stored in a cache, and searching for a best rewrite can be bypassed by using cached rewrites when present. Analysis of various initial token sequences that produce the same new rewritten token sequence can be useful to improve natural language grammars.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.