Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Path decoding method and device, computer device, and storage medium

A decoding method and path technology, applied in the field of text processing, can solve problems such as untrustworthy and small path scores

Active Publication Date: 2019-02-26
北京如布科技有限公司
View PDF12 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] The invention provides a path decoding method, device, computer equipment and storage medium, which can improve the accuracy of obtaining the optimal path through the HMM model, and solve the problem that the path score is too small and unreliable when the HMM model is actually applied to text path decoding The problem

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Path decoding method and device, computer device, and storage medium
  • Path decoding method and device, computer device, and storage medium
  • Path decoding method and device, computer device, and storage medium

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0044] figure 1 It is a schematic flowchart of the path decoding method provided by Embodiment 1 of the present invention. Such as figure 1 As shown, the path decoding method may include the following steps:

[0045] Step 101. Determine N corresponding state matrices according to the short text to be decoded; wherein, N is a natural number greater than or equal to 1.

[0046] In a specific embodiment of the present invention, the computer device can determine N corresponding state matrices according to the short text to be decoded; wherein, N is a natural number greater than or equal to 1. Specifically, the computer device may first divide the short text to be decoded into several phrases to determine several observation sequences; then mark each phrase to determine a state matrix corresponding to the short text to be decoded. Since the computer device can divide the short text to be decoded into several phrases, and these phrases may have different combinations, each combi...

Embodiment 2

[0053] figure 2 It is a schematic flowchart of the path decoding method provided by Embodiment 2 of the present invention. Such as figure 2 As shown, the path decoding method may include the following steps:

[0054] Step 201. Determine N corresponding state matrices according to the short text to be decoded; wherein, N is a natural number greater than or equal to 1.

[0055] In a specific embodiment of the present invention, the computer device can determine N corresponding state matrices according to the short text to be decoded; wherein, N is a natural number greater than or equal to 1. Specifically, the computer device may first divide the short text to be decoded into several phrases; then mark each phrase to determine a state matrix corresponding to the short text to be decoded. Since the computer device can divide the short text to be decoded into several phrases, and these phrases may have different combinations, each combination corresponds to an observation sequ...

Embodiment 3

[0066] image 3 It is a schematic flowchart of the path decoding method provided by Embodiment 3 of the present invention. Such as image 3 As shown, the path decoding method may include the following steps:

[0067] Step 301. Determine N corresponding state matrices according to the short text to be decoded; wherein, N is a natural number greater than or equal to 1.

[0068] In a specific embodiment of the present invention, the computer device can determine N corresponding state matrices according to the short text to be decoded; wherein, N is a natural number greater than or equal to 1. Specifically, the computer device may first divide the short text to be decoded into several phrases; then mark each phrase to determine a state matrix corresponding to the short text to be decoded. Since the computer device can divide the short text to be decoded into several phrases, and these phrases may have different combinations, each combination corresponds to an observation sequen...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a path decoding method and device, a computer device and a storage medium. The method comprises the following steps of: determining N state matrices corresponding to the shorttext to be decoded according to the short text to be decoded, wherein N is a natural number greater than or equal to 1; obtaining an optimal state sequence corresponding to each state matrix of the Nstate matrices by using a fractional addition method; determining M optimal paths corresponding to the short text to be decoded among N optimal state sequences, wherein M is a natural number greater than or equal to 1 and less than or equal to N. The method can improve the accuracy of obtaining the optimal path through HMM model, and solve the problem that the path score of HMM model is too smallto be trusted when it is applied to text path decoding.

Description

technical field [0001] The embodiments of the present invention relate to the technical field of text processing, and in particular to a path decoding method, device, computer equipment and storage medium. Background technique [0002] With the continuous development of Internet technology, a large number of short message streams appear. The amount of these messages is huge, but the length is generally very short. Such messages are often called short texts. Specifically, short texts refer to texts that are very short in length, generally within 140 characters, such as common mobile phone short messages sent through mobile communication networks, instant messages sent through instant messaging software, comments on weblogs, and texts on Internet news. comments and more. [0003] In the existing path decoding methods, the original short text is usually divided into several words by word segmentation; at least one original text path corresponding to the original short text is ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06F8/41
CPCG06F8/427
Inventor 吴开宇雷宇
Owner 北京如布科技有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com