ACL RD-TEC 1.0 Summarization of W05-1501
Paper Title:
EFFICIENT AND ROBUST LFG PARSING: SXLFG
EFFICIENT AND ROBUST LFG PARSING: SXLFG
Authors: Pierre Boullier and Benoît Sagot
Primarily assigned technology terms:
- algorithm
- automaton
- bottom-up left-to-right traversal strategy
- cf parsing
- computational linguistics
- computational technology
- context-free parser
- data representation
- deep parsing
- disambiguation
- disambiguation method
- disambiguation process
- earley algorithm
- earley parser
- earleylike parser
- efficient parsing
- error recovery
- evaluation system
- finite automata
- functional evaluation
- information representation
- interleaved method
- language production
- lazy copying
- lazy evaluation
- lfg parsing
- parser
- parser evaluation
- parsers
- parsing
- predictor
- processing
- pruning
- robust parsing
- segmentation
- skimming
- subcategorization
- unification
Other assigned terms:
- ambiguity
- annotated corpora
- approach
- argumentation
- association for computational linguistics
- automata
- case
- chunks
- complete parse
- concepts
- context-free grammar
- corpora
- derivation
- derivation trees
- empty string
- exponential time
- f-structure
- f-structures
- f-structures evaluation
- fact
- feature
- feature structures
- finite automaton
- forest
- formalism
- formalisms
- french
- functional structure
- grammar
- grammars
- heuristics
- input string
- lattice
- lattices
- lexeme
- lexical-functional grammars
- lexicon
- linguistic
- linguistic theory
- linguistics
- long-distance dependencies
- mechanisms
- method
- natural languages
- noise
- ordered list
- parse
- parse forest
- parsing process
- phrase
- polynomial time
- process
- relation
- root node
- segmentation level
- segments
- sentence
- sentences
- sentential form
- statistical data
- stochastic model
- symbol
- symbols
- syntactic error
- syntactic information
- tag derivation
- technique
- technology
- terminals
- terms
- text
- theory
- tokens
- tree
- trees
- utterance
- word
- word lattice
- words
