-
1
-
-
0000359296
-
A Minimum Distance Error-Correcting Parser for Context-Free Languages
-
A. V. Aho, T. G. Peterson: A Minimum Distance Error-Correcting Parser for Context-Free Languages. SIAM J. Comput. 1(4): 305-312 (1972)
-
(1972)
SIAM J. Comput.
, vol.1
, Issue.4
, pp. 305-312
-
-
Aho, A.V.1
Peterson, T.G.2
-
2
-
-
80052917068
-
Sampling the Repairs of Functional Dependency Violations under Hard Constraints
-
G. Beskales, I. F. Ilyas and L. Golab: Sampling the Repairs of Functional Dependency Violations under Hard Constraints. PVLDB 3(1): 197-207 (2010)
-
(2010)
PVLDB
, vol.3
, Issue.1
, pp. 197-207
-
-
Beskales, G.1
Ilyas, I.F.2
Golab, L.3
-
3
-
-
84893833429
-
-
G. J. Bex, F. Neven, T. Schwentick, K. Tuyls: Inference of Concise DTDs from XML Data, VLDB 2006: 115-126
-
(2006)
Inference of Concise DTDs from XML Data, VLDB
, pp. 115-126
-
-
Bex, G.J.1
Neven, F.2
Schwentick, T.3
Tuyls, K.4
-
5
-
-
35048821930
-
Correctors for XML Data
-
U. Boobna, and M. de Rougemont: Correctors for XML Data.XSym 2004: 97-111
-
(2004)
XSym
, pp. 97-111
-
-
Boobna, U.1
de Rougemont, M.2
-
6
-
-
29844436973
-
A Cost-Based Model and Effective Heuristic for Repairing Constraints by Value Modification
-
P. Bohannon, M. Flaster, W. Fan and R. Rastogi: A Cost-Based Model and Effective Heuristic for Repairing Constraints by Value Modification. SIGMOD 2005: 143-154
-
(2005)
SIGMOD
, pp. 143-154
-
-
Bohannon, P.1
Flaster, M.2
Fan, W.3
Rastogi, R.4
-
7
-
-
0344379436
-
What are real DTDs like?
-
B. Choi: What are real DTDs like? WebDB 2002: 43-48
-
(2002)
WebDB
, pp. 43-48
-
-
Choi, B.1
-
9
-
-
29144484106
-
A Methodology for Clustering XML Documents by Structure
-
T. Dalamagas, T. Cheng, K. Winkel, T. K. Sellis: A Methodology for Clustering XML Documents by Structure. Inf. Syst. 31(3): 187-228 (2006)
-
(2006)
Inf. Syst.
, vol.31
, Issue.3
, pp. 187-228
-
-
Dalamagas, T.1
Cheng, T.2
Winkel, K.3
Sellis, T.K.4
-
10
-
-
79959944062
-
Interaction between record matching and data repairing
-
W. Fan, J. Li, S. Ma, N. Tang and W. Yu: Interaction between record matching and data repairing. SIGMOD 2011: 469-480
-
(2011)
SIGMOD
, pp. 469-480
-
-
Fan, W.1
Li, J.2
Ma, S.3
Tang, N.4
Yu, W.5
-
11
-
-
57649190914
-
DTD Inference from XML Documents: The XTRACT Approach
-
M. N. Garofalakis, A. Gionis, R. Rastogi, S. Seshadri and K. Shim: DTD Inference from XML Documents: The XTRACT Approach. IEEE Data Eng. Bull. 26(3): 19-25 (2003)
-
(2003)
IEEE Data Eng. Bull.
, vol.26
, Issue.3
, pp. 19-25
-
-
Garofalakis, M.N.1
Gionis, A.2
Rastogi, R.3
Seshadri, S.4
Shim, K.5
-
12
-
-
49949150022
-
Language Identification in the Limit
-
E. M. Gold: Language Identification in the Limit, Information and Control 10(5): 447-474 (1967)
-
(1967)
Information and Control
, vol.10
, Issue.5
, pp. 447-474
-
-
Gold, E.M.1
-
13
-
-
0036361233
-
Approximate XML Joins
-
S. Guha, H. V. Jagadish, N. Koudas, D. Srivastava, T. Yu: Approximate XML Joins. SIGMOD 2002 : 287-298
-
(2002)
SIGMOD
, pp. 287-298
-
-
Guha, S.1
Jagadish, H.V.2
Koudas, N.3
Srivastava, D.4
Yu, T.5
-
14
-
-
0000348710
-
The Hardest Context-Free Language
-
S. A. Greibach: The Hardest Context-Free Language, SIAM J. Comput. 2(4): 304-310 (1973)
-
(1973)
SIAM J. Comput.
, vol.2
, Issue.4
, pp. 304-310
-
-
Greibach, S.A.1
-
15
-
-
83055166031
-
The quality of the XML web
-
S. Grijzenhout and M. Marx: The quality of the XML web. CIKM 2011: 1719-1724
-
(2011)
CIKM
, pp. 1719-1724
-
-
Grijzenhout, S.1
Marx, M.2
-
16
-
-
0012524644
-
Fast context-free grammar parsing requires fast boolean matrix multiplication, J
-
L. Lee: Fast context-free grammar parsing requires fast boolean matrix multiplication, J. ACM 49(1): 1-15 (2002)
-
(2002)
ACM
, vol.49
, Issue.1
, pp. 1-15
-
-
Lee, L.1
-
17
-
-
0001116877
-
Binary codes capable of correcting deletions, insertions, and reversals
-
V. I. Levenshtein: Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady 10(8): 707-710 (1966).
-
(1966)
Soviet Physics Doklady
, vol.10
, Issue.8
, pp. 707-710
-
-
Levenshtein, V.I.1
-
18
-
-
77954753210
-
Recognizing well-parenthesized expressions in the streaming model
-
F. Magniez, C. Mathieu and A. Nayak, Recognizing well-parenthesized expressions in the streaming model, STOC 2010: 261-270
-
(2010)
STOC
, pp. 261-270
-
-
Magniez, F.1
Mathieu, C.2
Nayak, A.3
-
19
-
-
8744271664
-
Approximately Matching Context-Free Languages
-
G. Myers: Approximately Matching Context-Free Languages. Inf. Process. Lett. 54(2): 85-92 (1995)
-
(1995)
Inf. Process. Lett.
, vol.54
, Issue.2
, pp. 85-92
-
-
Myers, G.1
-
20
-
-
0345566149
-
A guided tour to approximate string matching
-
G. Navarro. A guided tour to approximate string matching. ACM Comput. Surv., 33(1):31-88 (2001)
-
(2001)
ACM Comput. Surv.
, vol.33
, Issue.1
, pp. 31-88
-
-
Navarro, G.1
-
21
-
-
84863761505
-
RTED: A Robust Algorithm for the Tree Edit Distance
-
M. Pawlik, N. Augsten: RTED: A Robust Algorithm for the Tree Edit Distance. PVLDB 5(4): 334-345 (2011)
-
(2011)
PVLDB
, vol.5
, Issue.4
, pp. 334-345
-
-
Pawlik, M.1
Augsten, N.2
-
22
-
-
84864229049
-
Automated Repair of HTML Generation Errors in PHP Applications Using String Constraint Solving
-
H. Samimi, M. Schaefer, S. Artzi, T. Millstein, F. Tip and L. Hendren: Automated Repair of HTML Generation Errors in PHP Applications Using String Constraint Solving. Int'l Conf. Software Engineering 2012
-
(2012)
Int'l Conf. Software Engineering
-
-
Samimi, H.1
Schaefer, M.2
Artzi, S.3
Millstein, T.4
Tip, F.5
Hendren, L.6
-
23
-
-
84865032011
-
Constant-Memory Validation of Streaming XML Documents Against DTDs
-
L. Segoufin and C. Sirangelo: Constant-Memory Validation of Streaming XML Documents Against DTDs. ICDT 2007: 299-313
-
(2007)
ICDT
, pp. 299-313
-
-
Segoufin, L.1
Sirangelo, C.2
-
24
-
-
0036036851
-
Validating Streaming XML Documents
-
L. Segoufin and V. Vianu: Validating Streaming XML Documents. PODS 2002: 53-64
-
(2002)
PODS
, pp. 53-64
-
-
Segoufin, L.1
Vianu, V.2
-
25
-
-
33845248894
-
Validity-Sensitive Querying of XML Databases
-
S. Staworko and J. Chomicki: Validity-Sensitive Querying of XML Databases. EDBT Workshops 2006: 164-177
-
(2006)
EDBT Workshops
, pp. 164-177
-
-
Staworko, S.1
Chomicki, J.2
-
26
-
-
33644539174
-
Finding an optimum edit script between an XML document and a DTD
-
N. Suzuki: Finding an optimum edit script between an XML document and a DTD. SAC 2005: 647-653
-
(2005)
SAC
, pp. 647-653
-
-
Suzuki, N.1
-
27
-
-
84959140517
-
Time Warps, String Edits and Macromolecules Theory and Practice of Sequence Comparison, 1983
-
D. Sankoff, J. B. Kruskal: Time Warps, String Edits and Macromolecules Theory and Practice of Sequence Comparison, 1983. Addison Wesley
-
Addison Wesley
-
-
Sankoff, D.1
Kruskal, J.B.2
-
28
-
-
80053300757
-
Predicting at-risk novice Java programmers through the analysis of online protocols
-
E. S. Tabanao, M. M. T. Rodrigo, M. C. Jadud: Predicting at-risk novice Java programmers through the analysis of online protocols. ICER 2011: 85-92
-
(2011)
ICER
, pp. 85-92
-
-
Tabanao, E.S.1
Rodrigo, M.M.T.2
Jadud, M.C.3
-
29
-
-
0344927764
-
X-Diff: An Effective Change Detection Algorithm for XML Documents
-
Y. Wang, D. J. DeWitt, J. Cai: X-Diff: An Effective Change Detection Algorithm for XML Documents. ICDE 2003: 519-530
-
(2003)
ICDE
, pp. 519-530
-
-
Wang, Y.1
DeWitt, D.J.2
Cai, J.3
-
30
-
-
0015960104
-
The string-to-string correction problem
-
R. A. Wagner and M. J. Fischer. The string-to-string correction problem. Journal of the ACM, 21(1):168-173 (1974)
-
(1974)
Journal of the ACM,
, vol.21
, Issue.1
, pp. 168-173
-
-
Wagner, R.A.1
Fischer, M.J.2
-
31
-
-
0024889169
-
Simple Fast Algorithms for the Editing distance between Trees and Related Problems
-
K. Zhang and D. Shasha: Simple Fast Algorithms for the Editing distance between Trees and Related Problems. SIAM J. Computing, 18(6): 1245-1262 (1989)
-
(1989)
SIAM J. Computing
, vol.18
, Issue.6
, pp. 1245-1262
-
-
Zhang, K.1
Shasha, D.2
|