Academia.eduAcademia.edu

Outline

Principles of Document Processing

1997, Lecture Notes in Computer Science

https://doi.org/10.1007/3-540-63620-X

Abstract
sparkles

AI

The Third International Workshop on Principles of Document Processing (PODP'96) served as a platform for discussing the integration of theories and techniques from diverse fields like computer science and psychology into the electronic document processing ecosystem. With the rapid evolution of hardware and technology, the workshop aimed to clarify and establish unifying principles for document processing systems, thereby enhancing theoretical and practical approaches to document management. The next workshop, PODDP'98, promises to continue this crucial dialogue.

References (93)

  1. Conclusions ................................................. 37 SGML and Exceptions Pekka Kilpeli~inen and Derick Wood .............................. 39
  2. Introduction ................................................. 39
  3. Extended Context-Free Grammars with Exceptions .............. 41
  4. Exception-Removal for DTDs .................................. 45
  5. Concluding Remarks and Open Problems ....................... 47
  6. Grammar-Compatible Stylesheets
  7. Thomas Schroff and Anne Briiggemann-Klein ....................... 51
  8. Introduction ................................................. 51
  9. Documents and Grammars .................................... 52
  10. Transformations and Sty]esheets ............................... 53
  11. Grammar Compatibility .................................. 54
  12. 2 Constructing a Partially-Bracketed Grammar fiom Gsource .... 54
  13. 4 Constructing a Bracketed Grammar from G2 ................ 55
  14. Results ..................................................... 56
  15. Conclusions ................................................. 57
  16. Introduction ................................................. 87
  17. A Taxonomy of Constraints ................................... 88
  18. 1 Introduction ............................................. 88
  19. 2 The Constraint Taxonomy ................................ 90
  20. Interval Temporal Logic ...................................... 91
  21. 1 Introduction ............................................. 91
  22. 2 ITL -Atomic Operators .................................. 91
  23. 3 ITL -Examples ......................................... 92
  24. ITL as a Formalism for Multimedia Documents .................. 93
  25. 1 Atomic Constraints -Clock Time and Duration ............. 93
  26. 2 Relative Constraints -Two Media Items .................... 94
  27. 3 Relations Involving More Than Two Media Items ............ 95
  28. Projection and Related Constructs ............................. 96
  29. 1 Multiplication ........................................... 96
  30. 2 Imprecision and Adjustment ............................... 97
  31. 3 User Interaction ......................................... 97
  32. Executability and Display Forms ............................... 98
  33. Discussion .................................................. 99
  34. Appendix ......................................................
  35. Towards Automatic Hypertextual Representation of Linear Texts A. Myka, H. Argenton, and U. Giintzer ........................... 103
  36. Introduction ................................................. 103
  37. Extraction of Nonlinear Structures ............................. 104
  38. Statistical Evaluations ........................................ 108
  39. Natural-Language Parsing ..................................... 110
  40. High-Level Modeling ......................................... 112
  41. Monitoring User Actions ...................................... 113
  42. Link Inheritance and Accumulation ............................ 114
  43. Comparison of Methods ....................................... 115
  44. Conclusion .................................................. 118
  45. Contextual Document Representation .......................... 125
  46. Spreading Activation ..................................... 125
  47. 2 Our Method ............................................. 126
  48. 3 Example ................................................ 128
  49. Applications to Document Classification ........................ 129
  50. Discussion and Future Work ................................... 131
  51. Conclusion .................................................. 132
  52. Typed Structured Documents for Information Retrieval Chanda Dharap and C. Mic Bowman ............................. 135
  53. Introduction ................................................. 135
  54. Motivation .................................................. 136
  55. Related Work ............................................... 137
  56. Model ...................................................... 138
  57. 1 Type ................................................... 139
  58. 2 Tags ................................................... 139
  59. 3 Templates ............................................... 141
  60. 4 Objects ................................................. 142
  61. Tools to Implement Structured Types .......................... 143
  62. Advantages ................................................. 144
  63. 1 Multiple Inheritance ...................................... 144
  64. Precision Experiments ........................................ 145
  65. 1 Measures of Usability ..................................... 146
  66. Conclusions ................................................. 150 Transformation of Documents and Schemas by Patterns and Contextual Conditions Makoto Murata ................................................. 153
  67. Introduction ................................................. 153
  68. Transformations of Strings .................................... 156
  69. 1 Preliminaries ............................................ 156
  70. 2 Transformation Rules ..................................... 157
  71. 3 Applying Transformation Rules to Strings ................... 157
  72. Schema Transformation ................................... 158
  73. Transformations of Binary Trees ............................... 160
  74. 1 Preliminaries ............................................ 160
  75. 2 Transformation Rules ..................................... 162
  76. 3 Applying Transformation Rules to Trees .................... 163
  77. Schema Transformation ................................... 166
  78. Introduction ................................................. 171
  79. Complexity Analysis ......................................... 173
  80. Definition of TFALN ......................................... 174
  81. A Formatting Algorithm ...................................... 176
  82. 1 An Exponential-Time Algorithm ........................... 177
  83. 2 A Polynomial-Time Greedy Algorithm ...................... 178
  84. 3 An Efficient Algorithm ................................... 179
  85. Conclusions ................................................. 180 Visual Definition of Virtual Documents for the World-Wide Web Mark Minas and Leon Shklar ..................................... 183
  86. Introduction ................................................. 183
  87. Building Information Repositories .............................. 184
  88. 1 The Object Model ....................................... 184
  89. 2 Method Sharing ......................................... 185
  90. The Visual Repository Definition Language ..................... 188
  91. Example .................................................... 193
  92. Related Work ............................................... 194
  93. Conclusions ................................................. 194