Techniques for recognizing multiple patterns within a string
US8131758B2 · kind B2 · utility
1Cited by
11References
21Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Dec 26, 2007 |
| Grant date | Mar 6, 2012 |
| Priority date | — |
| Expiry date | Feb 16, 2029 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F40/284
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Techniques for recognizing multiple patterns within a string of characters are presented. A dictionary is hierarchically organized, such that leaf nodes within the dictionary represents words defined in the dictionary. A string of characters are received. Each character within the string is traversed by attempting to match it with a character defined in the dictionary. As long as a match continues with the dictionary the characters within the string are traversed. Once a longest possible match to a word within the dictionary is found, the next character following the last matched character for the string is processed.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.