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

DOI10.1016/0898-1221(83)90016-0zbMath0521.68096OpenAlexW2004689660MaRDI QIDQ1055206

John Boates, Nick Cercone, Max Krause

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

perfect hash functionsautomated natural language understandingnatural language lexicon design

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The preference semantics family
• The external language KLIPA for the URAL-2 digital computer
• Reciprocal hashing
• On Additive Bases and Harmonious Graphs
• Estimating the Efficiency of Backtrack Programs
• Perfect hashing functions
• Space/time trade-offs in hash coding with allowable errors
• A Dictionary for Minimum Redundancy Encoding

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