cl-string-match / Tickets / #3 Implement fast unicode string matching algorithm

#3 Implement fast unicode string matching algorithm

Milestone: 1.0

Status: open

Owner: nobody

Labels: None

Updated: 2013-08-12

Created: 2013-01-21

Creator: Victor Anyakin

Private: No

Implement fast string matching algorithm that can work with Unicode alphabets described in a paper:

A Fast Generic Sequence Matching Algorithm. David R. Musser, Gor V. Nishanov
http://arxiv.org/abs/0810.0264

Related

Discussion

Victor Anyakin - 2013-08-12

It is not really necessary to work out this specific algorithm. In some cases it is sufficient to turn a unicode string into its octets representation.

Figuring out a way to rapidly (better instantly) get an octets representation of a Lisp string would bring some benefits in general for different algorithms.

If you would like to refer to this comment somewhere else in this project, copy and paste the following link:

Victor Anyakin - 2013-08-12

See also ticket [#8] --- Rabin-Karp implementation might benefit from fixing this issue.

Related

Tickets: #8

If you would like to refer to this comment somewhere else in this project, copy and paste the following link:

Log in to post a comment.