On the minimum vocabulary problem

N. Chandrasekharan, R. Sridhar and S. S. Iyengar

Journal of the American Society for Information Science, 1987, vol. 38, issue 4, 234-238

Abstract: The “minimum vocabulary problem” for a dictionary has applications in indexing and other domains of information retrieval. A simple directed‐graph model of a dictionary results in a linear‐time algorithm for this problem. Since it is known that many minimum vocabularies can exist for a dictionary, a computationally useful criterion for finding a “desirable minimum vocabulary” is suggested and an O(|V|3) algorithm is outlined, where |V| is the number of words in the dictionary, duplicates eliminated. Furthermore, some enrichments to the model and the computational intractability of a variant called the 1‐lexicon problem are discussed. Directions for further work are indicated. © 1987 John Wiley & Sons, Inc.

Date: 1987
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/(SICI)1097-4571(198707)38:43.0.CO;2-O

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:jamest:v:38:y:1987:i:4:p:234-238

Ordering information: This journal article can be ordered from
https://doi.org/10.1002/(ISSN)1097-4571

Access Statistics for this article

More articles in Journal of the American Society for Information Science from Association for Information Science & Technology
Bibliographic data for series maintained by Wiley Content Delivery ().