Parallel Multiple Context-Free Grammars, Finite-State Translation Systems, and Polynomial-Time Recognizable Subclasses of Lexical-Functional Grammars.
Hiroyuki SekiRyuichi NakanishiYuichi KajiSachiko AndoTadao KasamiPublished in: ACL (1993)
Keyphrases
- context free grammars
- finite state
- context free
- tree automata
- context free languages
- formal languages
- grammatical inference
- finite automata
- markov chain
- probabilistic context free grammars
- context sensitive
- markov decision processes
- lexical semantics
- model checking
- syntactic pattern recognition
- context dependent
- tree adjoining
- closure properties
- grammar induction
- machine learning
- regular expressions
- knowledge based systems
- positive data
- building blocks
- visual languages