ACL RD-TEC 1.0 Summarization of J95-2002
Paper Title:
AN EFFICIENT PROBABILISTIC CONTEXT-FREE PARSING ALGORITHM THAT COMPUTES PREFIX PROBABILITIES
AN EFFICIENT PROBABILISTIC CONTEXT-FREE PARSING ALGORITHM THAT COMPUTES PREFIX PROBABILITIES
Primarily assigned technology terms:
- algorithm
- approximation
- baum-welch algorithm
- bottom-up algorithm
- bottom-up chart parsing
- bottom-up filtering
- bottom-up parser
- bottom-up parsing
- bracketing
- chart parser
- chart parsing
- collapsing
- complexity analysis
- computational linguistics
- computer science
- computing
- context-free parsing
- context-free parsing algorithm
- cyk algorithm
- cyk parsing
- decoder
- decoding
- delta function
- earley algorithm
- earley parser
- earley parsing
- earley-style parsing
- efficient parsing
- em algorithm
- estimation algorithm
- estimation procedure
- expectation-maximization
- final state
- finite-state parsing
- forward pass
- hidden markov
- hidden markov models
- hmm estimation
- hmms
- induction
- language parsing
- left-to-right processing
- linking
- lr parsing
- matching
- matrix inversion
- matrix multiplication
- modeling
- natural language parsing
- non-linear parsing
- normalization
- one-to-one mapping
- parser
- parsers
- parsing
- parsing algorithm
- parsing method
- preprocessing
- probabilistic context-free parsing
- probabilistic parsing
- probabilistic prediction
- probability estimation
- processing
- pruning
- ranking
- recognition
- robust parsing
- rule probability estimation
- scfg estimation
- scoring
- speech decoding
- speech recognition
- speech system
- speech technology
- speech understanding
- speech understanding system
- stack decoder
- table lookup
- terminology
- top-down filtering
- top-down parsing
- top-down prediction
- truncation
- viterbi
- viterbi algorithm
Other assigned terms:
- abbreviation
- abbreviations
- alphabet
- ambiguity
- analogy
- approach
- array
- association for computational linguistics
- case
- chomsky normal form
- computational complexity
- concept
- conditional independence
- conditional probabilities
- conditional probability
- context-free formalism
- context-free grammar
- context-free grammars
- context-free rule
- convergence
- dependency graph
- derivation
- derivations
- distribution
- earley state
- empty string
- estimation
- fact
- feature
- formalism
- generation
- grammar
- grammar rule
- grammar rules
- grammars
- implementation
- index
- input string
- interpretation
- joint probability
- language grammar
- language models
- language syntax
- lattices
- leaf
- left-most derivation
- left-recursion
- lemma
- likelihood
- likelihood function
- linear time
- linguistics
- local maxima
- local maximum
- lookahead
- mapping
- markov models
- measures
- method
- n-gram
- natural language
- natural language grammar
- natural language syntax
- nonterminal
- nonterminals
- normal form
- parameter values
- parse
- parse tree
- parsing information
- parsing procedure
- partial parse
- partial parse tree
- partial parses
- phrase
- phrase structure
- probabilistic context-free grammars
- probabilistic information
- probabilistic model
- probabilities
- probability
- probability distribution
- probability theory
- procedure
- process
- recursion
- relation
- reordering
- right-hand side
- root node
- rule format
- run-time
- runtime
- semantic
- sentence
- sentences
- sentential form
- stochastic context-free grammar
- stochastic context-free grammars
- substring
- subtrees
- suffix
- symbol
- symbols
- syntax
- technique
- technology
- term
- terminals
- terms
- test corpus
- theorem
- theory
- topics
- training
- training corpus
- training set
- transition probabilities
- transitive closure
- tree
- trees
- understanding
- ungrammatical input
- viterbi parse
- viterbi path
- wildcard
- word
- words
