146 search results - page 1 / 30 » Efficient algorithms for the block edit problems |
IANDC
2010
13 years 3 months ago
2010
IPL
2008
13 years 5 months ago
2008
The guided tree edit distance problem is to find a minimum cost series of edit operations that transforms two input forests F and G into isomorphic forests F and G such that a thi...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
LREC
2010
13 years 6 months ago
2010
An important feature of spoken language corpora is existence of different spelling variants of words in transcription. So there is an important problem for linguist who works with...
JUCS
2008
13 years 5 months ago
2008
Abstract: As web sites are getting more complicated, the construction of web information extraction systems becomes more troublesome and time-consuming. A common theme is the diffi...