Bookmarks in Grammar-Compressed Strings.
Patrick Hagge CordingPawel GawrychowskiOren WeimannPublished in: SPIRE (2016)
Keyphrases
- suffix array
- finite state automata
- natural language
- data compression
- data structure
- context free grammars
- web resources
- string matching
- edit distance
- approximate string matching
- social bookmarking
- space efficient
- graph grammars
- finite automata
- grammatical inference
- hierarchical structure
- compressed domain
- finite alphabet
- syntactic pattern recognition
- natural language parsing
- formal languages
- suffix tree
- pattern matching
- regular languages
- context free
- user interests
- context sensitive
- social tags
- image quality
- grammar induction
- production rules
- variable length
- hamming distance
- pattern languages
- tree grammars
- shortest common supersequence