Sciweavers

34 search results - page 3 / 7
» Parsing Preferences and Linguistic Strategies
Sort
View
ACL
2011
12 years 9 months ago
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems
We study the problem of finding the best headdriven parsing strategy for Linear ContextFree Rewriting System productions. A headdriven strategy must begin with a specified right...
Pierluigi Crescenzi, Daniel Gildea, Andrea Marino,...
ATAL
2006
Springer
13 years 9 months ago
Learning a common language through an emergent interaction topology
We study the effects of various emergent topologies of interaction on the rate of language convergence in a population of communicating agents. The agents generate, parse, and lea...
Samarth Swarup, Kiran Lakkaraju, Les Gasser
NAACL
2010
13 years 3 months ago
An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
Yoav Goldberg, Michael Elhadad
ACL
2009
13 years 3 months ago
Exploiting Heterogeneous Treebanks for Parsing
We address the issue of using heterogeneous treebanks for parsing by breaking it down into two sub-problems, converting grammar formalisms of the treebanks to the same one, and pa...
Zheng-Yu Niu, Haifeng Wang, Hua Wu
DEDUCTIVE
1993
140views Database» more  DEDUCTIVE 1993»
13 years 7 months ago
AMOS: A Natural Language Parser Implemented as a Deductive Database in LOLA
In this paper we present the set-oriented bottom-up parsing system AMOS which is a major application of the deductive database system LOLA. AMOS supports the morpho-syntactical an...
Günther Specht, Burkhard Freitag