This work aims to design and develop a system for fast searching of variable length of strings taking the advantage of using the enumeration and multilevel hashing to improve the searching time by providing a semi-uniform searching performance, with the use of weighting scheme and some data structure concepts. The designed system takes into consideration various kinds of factors that affect the searching process (e.g. the search space size). Also, in order to provide an efficient system performance capable of handling some spelling mistakes an updated algorithm for string similarity measure was proposed, which is a combined set of well-known algorithms with some improvements by using certain conditions which are introduced after conducting on a number of experimental tests. The proposed algorithm “Optimized Dice Coefficient, N-grame and Damerau-Levenshtein Algorithms using Numeration Operations (ODADNN)” provides efficient results to assess the similarity between two words without the need to restrict the words length.
"Sinopsis" puede pertenecer a otra edición de este libro.
Librería: California Books, Miami, FL, Estados Unidos de America
Condición: New. Nº de ref. del artículo: I-9786208498993
Cantidad disponible: Más de 20 disponibles
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 156 pp. Englisch. Nº de ref. del artículo: 9786208498993
Cantidad disponible: 2 disponibles
Librería: CitiRetail, Stevenage, Reino Unido
Paperback. Condición: new. Paperback. This work aims to design and develop a system for fast searching of variable length of strings taking the advantage of using the enumeration and multilevel hashing to improve the searching time by providing a semi-uniform searching performance, with the use of weighting scheme and some data structure concepts. The designed system takes into consideration various kinds of factors that affect the searching process (e.g. the search space size). Also, in order to provide an efficient system performance capable of handling some spelling mistakes an updated algorithm for string similarity measure was proposed, which is a combined set of well-known algorithms with some improvements by using certain conditions which are introduced after conducting on a number of experimental tests. The proposed algorithm "Optimized Dice Coefficient, N-grame and Damerau-Levenshtein Algorithms using Numeration Operations (ODADNN)" provides efficient results to assess the similarity between two words without the need to restrict the words length. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Nº de ref. del artículo: 9786208498993
Cantidad disponible: 1 disponibles
Librería: preigu, Osnabrück, Alemania
Taschenbuch. Condición: Neu. Fast String Searching Based on Multilevel Hashing. 2nd Edition | Building Word Dictionary for Fast String Search | Safa S. Abdul-Jabbar (u. a.) | Taschenbuch | Englisch | 2025 | LAP LAMBERT Academic Publishing | EAN 9786208498993 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. Nº de ref. del artículo: 133937012
Cantidad disponible: 5 disponibles
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This work aims to design and develop a system for fast searching of variable length of strings taking the advantage of using the enumeration and multilevel hashing to improve the searching time by providing a semi-uniform searching performance, with the use of weighting scheme and some data structure concepts. The designed system takes into consideration various kinds of factors that affect the searching process (e.g. the search space size). Also, in order to provide an efficient system performance capable of handling some spelling mistakes an updated algorithm for string similarity measure was proposed, which is a combined set of well-known algorithms with some improvements by using certain conditions which are introduced after conducting on a number of experimental tests. The proposed algorithm 'Optimized Dice Coefficient, N-grame and Damerau-Levenshtein Algorithms using Numeration Operations (ODADNN)' provides efficient results to assess the similarity between two words without the need to restrict the words length.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 156 pp. Englisch. Nº de ref. del artículo: 9786208498993
Cantidad disponible: 1 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering. Nº de ref. del artículo: 9786208498993
Cantidad disponible: 1 disponibles
Librería: Books Puddle, New York, NY, Estados Unidos de America
Condición: New. Print on Demand. Nº de ref. del artículo: 26405276155
Cantidad disponible: 4 disponibles
Librería: Majestic Books, Hounslow, Reino Unido
Condición: New. Print on Demand. Nº de ref. del artículo: 408926756
Cantidad disponible: 4 disponibles
Librería: Biblios, Frankfurt am main, HESSE, Alemania
Condición: New. PRINT ON DEMAND. Nº de ref. del artículo: 18405276145
Cantidad disponible: 4 disponibles