| 
|
Quote: use acyclic finite automata as compact recognizers of a lexicon; time and space efficient; better than tries
topics >
all references >
references c-d >
Topic:
state machine
Topic:
lexical analysis
Quotation Skeleton
Sometimes no data are associated with the keys … [of a symbol table or dictionary] … [ref]. we call a set of bare strings … [p.1088] This paper presents an algorithm to construct … formerly by Daciuk, Mihov, Watson, and Watson. Speed … automata. … [p. 1089] A comparison for real-world data sets shows … alternative data structures. … . [p. 1088] The exception of random data, where … such as natural languages. Google-1 Google-2
Copyright clearance needed for quotation.
Topic: state machine (67 items)
Topic: lexical analysis (14 items)