Sciweavers

773 search results - page 99 / 155
» Suffix Trees on Words
Sort
View
ACL
1998
15 years 1 months ago
A Connectionist Architecture for Learning to Parse
We present a connectionist architecture and demonstrate that it can learn syntactic parsing from a corpus of parsed text. The architecture can represent syntactic constituents, an...
James Henderson, Peter Lane
DAM
2006
100views more  DAM 2006»
14 years 12 months ago
A combinatorial algorithm for weighted stable sets in bipartite graphs
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
Ulrich Faigle, Gereon Frahling
TCS
2008
14 years 11 months ago
Fine hierarchies and m-reducibilities in theoretical computer science
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and relate...
Victor L. Selivanov
GRAMMARS
2002
116views more  GRAMMARS 2002»
14 years 11 months ago
An Informal Sketch of a Formal Architecture for Construction Grammar
Abstract. A formal architecture for Construction Grammar (CG) is sketched. Modeling domain objects (constructs) are constituent structures with feature structures at the nodes, aka...
Paul Kay
IPL
2010
84views more  IPL 2010»
14 years 10 months ago
Wee LCP
We prove that longest common prefix (LCP) information can be stored in much less space than previously known. More precisely, we show that in the presence of the text and the su...
Johannes Fischer