Minimal and almost minimal perfect hash function search with application to natural language lexicon design

DOI10.1016/0898-1221(83)90016-0MaRDI QIDQ1055206zbMATH OpenOpenAlexFDO

Authors Nick Cercone, Max Krause, John Boates

Publication date 1983

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0898-1221(83)90016-0

zbMATH Keywords

automated natural language understandingnatural language lexicon designperfect hash functions

Mathematics Subject Classification ID

Natural language processing (68T50) Artificial intelligence (68T99)

Cites work

• A Dictionary for Minimum Redundancy Encoding
• Estimating the Efficiency of Backtrack Programs
• scientific article; zbMATH DE number 3660776 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3599490 (Why is no real title available?)
• scientific article; zbMATH DE number 3227181 (Why is no real title available?)
• On Additive Bases and Harmonious Graphs
• Perfect hashing functions
• Reciprocal hashing
• Space/time trade-offs in hash coding with allowable errors
• The external language KLIPA for the URAL-2 digital computer
• The preference semantics family

This page was built for publication: Minimal and almost minimal perfect hash function search with application to natural language lexicon design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1055206)