Sciweavers

7 search results - page 2 / 2
» Large Nearly Regular Induced Subgraphs
Sort
View
ACL
2000
13 years 6 months ago
Minimally Supervised Morphological Analysis by Multimodal Alignment
This paper presents a corpus-based algorithm capable of inducing inflectional morphological analyses of both regular and highly irregular forms (such as broughtbring) from distrib...
David Yarowsky, Richard Wicentowski
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
14 years 5 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira