{"id":{"repo_id":"unlv","oai_identifier":"oai:oasis.library.unlv.edu:rtds-2578"},"canonical_url":"https://search.dev.ndltd.org/etd/unlv/oai:oasis.library.unlv.edu:rtds-2578","repository":{"repo_id":"unlv","name":"University of Nevada - Las Vegas","base_url":"https://oasis.library.unlv.edu/do/oai/"},"display":{"title":"The design, implementation, and effectiveness of a Farsi word stemmer","abstract":"A stemmer for the Farsi language has been designed, implemented, and evaluated. The stemmer uses Farsi morphology to remove affixes, producing effective stems. The implementation is written in C, using strings of unicode-encoded characters to represent Farsi words. It is meant to enhance the Farsi information retrieval system currently being developed at the Information Science Research Institute at the University of Nevada at Las Vegas. The effectiveness of the Farsi stemmer and stopword list on recall/precision was tested.","abstract_html":"A stemmer for the Farsi language has been designed, implemented, and evaluated. The stemmer uses Farsi morphology to remove affixes, producing effective stems. The implementation is written in C, using strings of unicode-encoded characters to represent Farsi words. It is meant to enhance the Farsi information retrieval system currently being developed at the Information Science Research Institute at the University of Nevada at Las Vegas. The effectiveness of the Farsi stemmer and stopword list on recall/precision was tested.","abstract_has_math":false,"creators":["Beckley, Russell"],"institution":"University of Nevada, Las Vegas","degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Kazem Tagva"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2003,"date_issued":"2003-01-01T08:00:00Z","date_published":"2003-01-01T08:00:00Z","updated_at":"2026-07-24T05:25:40Z","subjects":[],"languages":["English"],"rights":["IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["https://oasis.library.unlv.edu/rtds/1579"],"render_values":[{"text":"https://oasis.library.unlv.edu/rtds/1579","href":"https://oasis.library.unlv.edu/rtds/1579","code":true}]}]},"links":{"outbound_url":"https://doi.org/10.25669/n3jx-l5zg","outbound_label":"DOI","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Kazem Tagva"]},{"key":"dc:creator","label":"Author","values":["Beckley, Russell"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:publisher","label":"Institution","values":["University of Nevada, Las Vegas"]},{"key":"dc:type","label":"Dc Type","values":["Text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]},{"key":"dc:rights","label":"Dc Rights","values":["IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["10.25669/n3jx-l5zg","https://oasis.library.unlv.edu/rtds/1579","https://oasis.library.unlv.edu/context/rtds/article/2578/viewcontent/uc.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["A stemmer for the Farsi language has been designed, implemented, and evaluated. The stemmer uses Farsi morphology to remove affixes, producing effective stems. The implementation is written in C, using strings of unicode-encoded characters to represent Farsi words. It is meant to enhance the Farsi information retrieval system currently being developed at the Information Science Research Institute at the University of Nevada at Las Vegas. The effectiveness of the Farsi stemmer and stopword list on recall/precision was tested."]},{"key":"dc:format","label":"Dc Format","values":["pdf"]},{"key":"dc:title","label":"Title","values":["The design, implementation, and effectiveness of a Farsi word stemmer"]}]}],"canonical_facts":{"dc:contributor":["Kazem Tagva"],"dc:creator":["Beckley, Russell"],"dc:description.abstract":["A stemmer for the Farsi language has been designed, implemented, and evaluated. The stemmer uses Farsi morphology to remove affixes, producing effective stems. The implementation is written in C, using strings of unicode-encoded characters to represent Farsi words. It is meant to enhance the Farsi information retrieval system currently being developed at the Information Science Research Institute at the University of Nevada at Las Vegas. The effectiveness of the Farsi stemmer and stopword list on recall/precision was tested."],"dc:format":["pdf"],"dc:identifier":["10.25669/n3jx-l5zg","https://oasis.library.unlv.edu/rtds/1579","https://oasis.library.unlv.edu/context/rtds/article/2578/viewcontent/uc.pdf"],"dc:language":["English"],"dc:publisher":["University of Nevada, Las Vegas"],"dc:rights":["IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/"],"dc:title":["The design, implementation, and effectiveness of a Farsi word stemmer"],"dc:type":["Text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-07-24T05:25:40Z"}