Finite automata for compact representation of tuple dictionaries.

DOI10.1016/j.tcs.2003.10.003zbMath1069.68064OpenAlexW2150789257MaRDI QIDQ1426158

Gertjan van Noord, Jan Daciuk

Publication date: 14 March 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.10.003

zbMATH Keywords

Finite automataLanguage modelsPerfect hashingTuple dictionaries

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Storing a sparse table
• Head-Driven Statistical Models for Natural Language Parsing
• Unnamed Item