Sciweavers

661 search results - page 85 / 133
» Levels of a scale-free tree
Sort
View
ACL
2006
13 years 10 months ago
A Pipeline Framework for Dependency Parsing
Pipeline computation, in which a task is decomposed into several stages that are solved sequentially, is a common computational strategy in natural language processing. The key pr...
Ming-Wei Chang, Quang Do, Dan Roth
IJCAI
2003
13 years 10 months ago
Evaluating Coverage for Large Symbolic NLG Grammars
After many successes, statistical approaches that have been popular in the parsing community are now making headway into Natural Language Generation (NLG). These systems are aimed...
Charles B. Callaway
ANLP
2000
89views more  ANLP 2000»
13 years 10 months ago
Assigning Function Tags to Parsed Text
It is generally recognized that the common nonterminal labels for syntactic constituents (NP, VP, etc.) do not exhaust the syntactic and semantic information one would like about ...
Don Blaheta, Eugene Charniak
AAAI
1996
13 years 10 months ago
Formalizing Dependency Directed Backtracking and Explanation Based Learning in Refinement Search
The ideas of dependency directed backtracking (DDB) and explanation based learning (EBL) have developed independently in constraint satisfaction, planning and problem solving comm...
Subbarao Kambhampati
AAAI
1994
13 years 10 months ago
Evolving Neural Networks to Focus Minimax Search
Neural networks were evolved through genetic algorithms to focus minimax search in the game of Othello. At each level of the search tree, the focus networks decide which moves are...
David E. Moriarty, Risto Miikkulainen