Suffix Trees for Document Retrieval
This thesis presents a look at the suitability of Suffix Trees for full text indexing and retrieval. Typically suffix trees are built on a character level, where the tree records which characters follow each other character. By building suffix trees for documents based on words instead of characters...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
DigitalCommons@CalPoly
2012
|
| Subjects: | |
| Online Access: | https://digitalcommons.calpoly.edu/theses/773 https://digitalcommons.calpoly.edu/cgi/viewcontent.cgi?article=1818&context=theses |