Content deleted Content added
I think this is good enough to untag |
ce |
||
Line 13:
| year = 2012}}</ref>
These data structures typically treat their text and pattern as [[string (computer science)|strings]] over a fixed alphabet, and search for locations where the pattern occurs as a substring of the text. The symbols of the alphabet may be characters (for instance in [[Unicode]]) but in practical applications for [[text retrieval]] it may be preferable to treat the ([[Stemming|stemmed]]) words of a document as the symbols of its alphabet, because doing this reduces the lengths of both the text and pattern as measured in
| last = Risvik | first = Knut Magne
| editor-last = Farach-Colton | editor-first = Martin | editor-link = Martin Farach-Colton
| |||