ACL RD-TEC 1.0 Summarization of W06-2936
Paper Title:
MAXIMUM SPANNING TREE ALGORITHM FOR NON-PROJECTIVE LABELED DEPENDENCY PARSING
MAXIMUM SPANNING TREE ALGORITHM FOR NON-PROJECTIVE LABELED DEPENDENCY PARSING
Primarily assigned technology terms:
- algorithm
- batch learning
- bottom-up parsing
- c + +
- computational linguistics
- computational natural language learning
- decoder
- decoding
- dependency parsing
- error analysis
- factoring
- hardware
- labeled dependency parsing
- language learning
- learning
- maximum spanning tree
- mst algorithm
- natural language learning
- non-projective dependency parsing
- non-projective labeled dependency parsing
- non-projective parsing
- online learning
- parser
- parsing
- parsing algorithm
- perceptron
- scoring
- spanning tree
- structured prediction
- terminology
- tree algorithm
- unlabeled dependency parsing
- voted perceptron
- word ordering
Other assigned terms:
- association for computational linguistics
- case
- complete graph
- conll-x
- dependency relation
- dependency relations
- dependency structure
- dependency structures
- dependency tree
- determiner
- error rate
- feature
- feature set
- index
- linguistics
- maps
- method
- morphological features
- natural language
- non-projective dependency
- nouns
- parse
- part-of-speech
- pos tag
- preposition
- preposition attachment
- prepositions
- procedure
- relation
- sentence
- stems
- tag set
- tags
- test set
- tokens
- training
- training time
- tree
- unlabeled dependency
- verb
- vertex
- weight vector
- word
- words
