ACL RD-TEC 1.0 Summarization of C04-1013
Paper Title:
PARTIALLY DISTRIBUTION-FREE LEARNING OF REGULAR LANGUAGES FROM POSITIVE SAMPLES
PARTIALLY DISTRIBUTION-FREE LEARNING OF REGULAR LANGUAGES FROM POSITIVE SAMPLES
Authors: Alexander Clark and Franck Thollard
Primarily assigned technology terms:
- algorithm
- automaton
- binary classi cation
- classi cation
- computational biology
- density estimation
- distribution modelling
- induction
- language acquisition
- language modelling
- learning
- learning algorithm
- learning algorithms
- learning framework
- likelihood estimate
- loss function
- maximum likelihood
- modelling
- nlp
- parsing
- probability function
- re-sampling
- sampling
- state automaton
Other assigned terms:
- alphabet
- approach
- automata
- biology
- case
- computational complexity
- concept
- context free grammars
- convergence
- device
- distance metric
- distribution
- empty string
- estimation
- fact
- feature
- grammar
- grammars
- hypothesis
- index
- intention
- kolmogorov complexity
- kullback-leibler divergence
- learnability
- learning problem
- lemma
- likelihood
- maximum likelihood estimate
- norm
- opinion
- positive and negative examples
- probabilities
- probability
- probability density
- probability distribution
- root node
- sentences
- sources of information
- subclass
- symbol
- symbols
- target language
- theory
