Algorithms for information retrieval
The main focus of this dissertation is in its testing and evaluation of five string matching algorithms. All the selected algorithms were coded in C programs, and then a few test cases were also developed to test the efficiencies of the above algorithms under different simulations. From the results,...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/13344 |
| _version_ | 1826119978570481664 |
|---|---|
| author | Kwok, Jee Ann. |
| author2 | Cheng, Tee Hiang |
| author_facet | Cheng, Tee Hiang Kwok, Jee Ann. |
| author_sort | Kwok, Jee Ann. |
| collection | NTU |
| description | The main focus of this dissertation is in its testing and evaluation of five string matching algorithms. All the selected algorithms were coded in C programs, and then a few test cases were also developed to test the efficiencies of the above algorithms under different simulations. From the results, the dissertation concludes that there is a variation of performance in terms of execution time as well as number of comparisons made for different algorithms when subjected under different testing conditions. In terms of execution time, the Horspool algorithm has achieved the best performance. The Boyer- Moore algorithm is more efficient in terms of direct character comparisons. |
| first_indexed | 2024-10-01T05:09:00Z |
| format | Thesis |
| id | ntu-10356/13344 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T05:09:00Z |
| publishDate | 2008 |
| record_format | dspace |
| spelling | ntu-10356/133442023-07-04T15:07:37Z Algorithms for information retrieval Kwok, Jee Ann. Cheng, Tee Hiang School of Electrical and Electronic Engineering DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems The main focus of this dissertation is in its testing and evaluation of five string matching algorithms. All the selected algorithms were coded in C programs, and then a few test cases were also developed to test the efficiencies of the above algorithms under different simulations. From the results, the dissertation concludes that there is a variation of performance in terms of execution time as well as number of comparisons made for different algorithms when subjected under different testing conditions. In terms of execution time, the Horspool algorithm has achieved the best performance. The Boyer- Moore algorithm is more efficient in terms of direct character comparisons. Master of Science (Communication and Network Systems) 2008-10-20T07:25:46Z 2008-10-20T07:25:46Z 1999 1999 Thesis http://hdl.handle.net/10356/13344 en 111 p. application/pdf |
| spellingShingle | DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems Kwok, Jee Ann. Algorithms for information retrieval |
| title | Algorithms for information retrieval |
| title_full | Algorithms for information retrieval |
| title_fullStr | Algorithms for information retrieval |
| title_full_unstemmed | Algorithms for information retrieval |
| title_short | Algorithms for information retrieval |
| title_sort | algorithms for information retrieval |
| topic | DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems |
| url | http://hdl.handle.net/10356/13344 |
| work_keys_str_mv | AT kwokjeeann algorithmsforinformationretrieval |