Sciweavers

2475 search results - page 151 / 495
» On the accuracy of language trees
Sort
View
EACL
1993
ACL Anthology
15 years 7 months ago
Towards efficient parsing with proof-nets
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...
Alain Lecomte
ENTCS
2010
90views more  ENTCS 2010»
15 years 6 months ago
Recursive Program Schemes and Context-Free Monads
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 ...
Jirí Adámek, Stefan Milius, Jiri Vel...
EMNLP
2011
14 years 6 months ago
Generating Aspect-oriented Multi-Document Summarization with Event-aspect model
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...
Peng Li, Yinglin Wang, Wei Gao, Jing Jiang
DAGM
2008
Springer
15 years 8 months ago
Natural Language Understanding by Combining Statistical Methods and Extended Context-Free Grammars
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...
Stefan Schwärzler, Joachim Schenk, Frank Wall...
LREC
2008
109views Education» more  LREC 2008»
15 years 8 months ago
The Metadata-Database of a Next Generation Sustainability Web-Platform for Language Resources
Our goal is to provide a web-based platform for the long-term preservation and distribution of a heterogeneous collection of linguistic resources. We discuss the corpus preprocess...
Georg Rehm, Oliver Schonefeld, Andreas Witt, Timm ...