1423 search results - page 134 / 285 » Languages of Nested Trees |
116
Voted
EACL
1993
ACL Anthology
15 years 5 months ago
1993
ACL Anthology
This paper presents a method for parsing associative Lambek grammars based on graphtheoretic properties. Connection graphs, which are a simplified version of proof-nets, are actua...
136
Voted
ENTCS
2010
15 years 3 months ago
2010
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...
163
click to vote
EMNLP
2011
14 years 3 months ago
2011
In this paper, we propose a novel approach to automatic generation of aspect-oriented summaries from multiple documents. We first develop an event-aspect LDA model to cluster sen...
131
click to vote
DRR
2010
15 years 6 months ago
2010
In this paper we present an OCR validation module, implemented for the System for Preservation of Electronic Resources (SPER) developed at the U.S. National Library of Medicine.1 ...
124
Voted
DAGM
2008
Springer
15 years 5 months ago
2008
Springer
This paper introduces an novel framework for speech understanding using extended context-free grammars (ECFGs) by combining statistical methods and rule based knowledge. By only us...