Linguistic Applications of Finite Automata with Translucent Letters.
Benedek NagyLászló KovácsPublished in: ICAART (1) (2013)
Keyphrases
- finite automata
- deterministic automata
- grammatical inference
- regular expressions
- probabilistic automata
- tree automata
- natural language
- natural language processing
- regular languages
- finite automaton
- hidden markov models
- pattern matching
- relational databases
- structured data
- information extraction
- query processing
- expert systems