Saved in:
Bibliographic Details
Main Author: LAZEWNIK, GRAINOM
Format: Recurso educativo Open Access
Language:en
Published: 1968
Subjects:
Online Access:https://eric.ed.gov/?id=ED019668
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1867181771903205376
author LAZEWNIK, GRAINOM
author_facet LAZEWNIK, GRAINOM
LAZEWNIK, GRAINOM
collection Education Resources Information Center
contents CONSTRUCTION OF AN ALGORITHM FOR STEM RECOGNITION IN THE HEBREW LANGUAGE. APPLICATION OF HEBREW MORPHOLOGY TO COMPUTER TECHNIQUES FOR INVESTIGATION OF WORD ROOTS. LAZEWNIK, GRAINOM Algorithms Cataloging Computational Linguistics Computer Programs Hebrew Indexes Indexing Morphology (Languages) Nouns Verbs THE OBJECTIVE OF THIS PROJECT WAS TO DEVISE AN ALGORITHM FOR A STEM RECOGNITION PROGRAM DESIGNED TO SEARCH FOR THE ROOT OF ANY HEBREW WORD AS WELL AS TO DETECT INNER CHANGES ON THE GIVEN ROOT. SUCH AN ALGORITHM COULD BE USED IN LIBRARY CATALOGING AND IN CREATING INDEXES AND CONCORDANCES OF TEXTS IN THE HEBREW LANGUAGE. IN THIS STUDY THE HEBREW WORD WAS CONCEIVED AS A CONSONANTAL, MORPHOLOGICAL UNIT. CENTRAL TO THE ENTIRE RESEARCH WERE TABLES AND LISTINGS ORGANIZED ON A GRAMMATICAL BASIS AND SO DEVISED AS TO PRESENT CERTAIN PERTINENT CORRELATIONS BETWEEN VERBALS AND NOMINALS AND THE AFFIXAL ELEMENTS. THIRTY-SIX GRAMMATICAL CATEGORIES WERE SET UP. FOUR TYPES OF AFFIXES WERE CORRELATED WITH THESE CATEGORIES. THE COMPUTER TECHNIQUE CONSISTED OF FRACTIONATING TEST WORDS INTO PREVIOUSLY DEFINED ELEMENTS AND FORMING VARIOUS COMBINATIONS WHICH WERE SUBSEQUENTLY SUBJECTED TO VALIDATION. THE RESULT OF THE COMPUTER FUNCTIONING REMAINED VALIDATED BY OBJECTIVE CRITERIA. A SPECIAL REFERENCE DICTIONARY IS NOW BEING COMPILED FOR THE PURPOSE OF TESTING THE RESIDUUM OF GRAMMATICALLY LEGITIMATE COMBINATIONS. (AUTHOR/DO)
format Recurso educativo Open Access
id eric_ED019668
institution ERIC Institute of Education Sciences
language en
publishDate 1968
record_format eric
spellingShingle CONSTRUCTION OF AN ALGORITHM FOR STEM RECOGNITION IN THE HEBREW LANGUAGE. APPLICATION OF HEBREW MORPHOLOGY TO COMPUTER TECHNIQUES FOR INVESTIGATION OF WORD ROOTS.
LAZEWNIK, GRAINOM
Algorithms
Cataloging
Computational Linguistics
Computer Programs
Hebrew
Indexes
Indexing
Morphology (Languages)
Nouns
Verbs
CONSTRUCTION OF AN ALGORITHM FOR STEM RECOGNITION IN THE HEBREW LANGUAGE. APPLICATION OF HEBREW MORPHOLOGY TO COMPUTER TECHNIQUES FOR INVESTIGATION OF WORD ROOTS. LAZEWNIK, GRAINOM Algorithms Cataloging Computational Linguistics Computer Programs Hebrew Indexes Indexing Morphology (Languages) Nouns Verbs THE OBJECTIVE OF THIS PROJECT WAS TO DEVISE AN ALGORITHM FOR A STEM RECOGNITION PROGRAM DESIGNED TO SEARCH FOR THE ROOT OF ANY HEBREW WORD AS WELL AS TO DETECT INNER CHANGES ON THE GIVEN ROOT. SUCH AN ALGORITHM COULD BE USED IN LIBRARY CATALOGING AND IN CREATING INDEXES AND CONCORDANCES OF TEXTS IN THE HEBREW LANGUAGE. IN THIS STUDY THE HEBREW WORD WAS CONCEIVED AS A CONSONANTAL, MORPHOLOGICAL UNIT. CENTRAL TO THE ENTIRE RESEARCH WERE TABLES AND LISTINGS ORGANIZED ON A GRAMMATICAL BASIS AND SO DEVISED AS TO PRESENT CERTAIN PERTINENT CORRELATIONS BETWEEN VERBALS AND NOMINALS AND THE AFFIXAL ELEMENTS. THIRTY-SIX GRAMMATICAL CATEGORIES WERE SET UP. FOUR TYPES OF AFFIXES WERE CORRELATED WITH THESE CATEGORIES. THE COMPUTER TECHNIQUE CONSISTED OF FRACTIONATING TEST WORDS INTO PREVIOUSLY DEFINED ELEMENTS AND FORMING VARIOUS COMBINATIONS WHICH WERE SUBSEQUENTLY SUBJECTED TO VALIDATION. THE RESULT OF THE COMPUTER FUNCTIONING REMAINED VALIDATED BY OBJECTIVE CRITERIA. A SPECIAL REFERENCE DICTIONARY IS NOW BEING COMPILED FOR THE PURPOSE OF TESTING THE RESIDUUM OF GRAMMATICALLY LEGITIMATE COMBINATIONS. (AUTHOR/DO)
title CONSTRUCTION OF AN ALGORITHM FOR STEM RECOGNITION IN THE HEBREW LANGUAGE. APPLICATION OF HEBREW MORPHOLOGY TO COMPUTER TECHNIQUES FOR INVESTIGATION OF WORD ROOTS.
topic Algorithms
Cataloging
Computational Linguistics
Computer Programs
Hebrew
Indexes
Indexing
Morphology (Languages)
Nouns
Verbs
url https://eric.ed.gov/?id=ED019668