A Paraphrasing System for Transforming Regular Expressions into Honorifics.
Dongli HanShuntaro KamochiXin SongNaoki AkegawaTomomasa HoriPublished in: COLING (Demos) (2010)
Keyphrases
- regular expressions
- pattern matching
- finite automata
- query language
- xml schema
- semistructured data
- context sensitive
- regular path queries
- matching algorithm
- regular languages
- deterministic finite automata
- tree automata
- context free grammars
- frequent sequences
- finite state machines
- grammatical inference
- query evaluation
- structured data
- information extraction
- domain knowledge
- np hard