Computer Science
Automaton
8%
Binary Feature
25%
Closure Property
8%
Computational Complexity
17%
Concept Lattice
58%
Context Free Languages
17%
Context Sensitive Grammars
5%
Context-Free Grammars
85%
context-free language
88%
Deterministic Finite Automaton
5%
Dimensional Feature Space
17%
Direct Approach
17%
Equational Theory
5%
Expressive Power
8%
Feature Map
8%
Formal Grammar
5%
Free Operation
5%
Grammatical Inference
29%
Grammatical Knowledge
5%
Hyperplane
17%
Language Class
8%
Language Development
17%
Language Modeling
5%
Leaning Parameter
8%
Learning Algorithm
26%
Learning System
17%
Machine Learning
17%
n-gram language model
17%
Passive Sentence
5%
Polynomial Algorithm
35%
Polynomial Time
23%
Potential Solution
8%
Primitive Element
17%
Query Equivalence
5%
Regular Language
28%
Scoring Function
5%
Simple Algorithm
8%
Statistical Model
17%
Subclasses
5%
Syntactic Phenomenon
5%
Syntactics
100%
Synthetic Data
8%
Theoretic Approach
17%
Theoretic Property
8%
Unsupervised Learning
17%
Arts and Humanities
Automata
17%
British National Corpus
17%
Categorial Grammar
17%
Denotation
8%
Formal languages
8%
Generative
17%
Grammaticality
17%
Grammaticality judgments
35%
Language Acquisition
17%
Limits
17%
Linguistic Representation
17%
Natural System
8%
Ngram
17%
Syntactic Structure
17%
Theoretical Linguistics
17%
Mathematics
Algebraic Theory
17%
Galois Connection
21%
Lattices
35%
Matrix
17%
Monoids
24%
Morphism
5%
Probability Theory
5%
Residuated Lattice
21%
Statistical Model
17%
