magic-pdf 0.9.3__py3-none-any.whl → 0.10.0__py3-none-any.whl
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- magic_pdf/config/constants.py +53 -0
- magic_pdf/config/drop_reason.py +35 -0
- magic_pdf/config/drop_tag.py +19 -0
- magic_pdf/config/make_content_config.py +11 -0
- magic_pdf/{libs/ModelBlockTypeEnum.py → config/model_block_type.py} +2 -1
- magic_pdf/data/read_api.py +1 -1
- magic_pdf/dict2md/mkcontent.py +226 -185
- magic_pdf/dict2md/ocr_mkcontent.py +11 -11
- magic_pdf/filter/pdf_meta_scan.py +101 -79
- magic_pdf/integrations/rag/utils.py +4 -5
- magic_pdf/libs/config_reader.py +5 -5
- magic_pdf/libs/draw_bbox.py +3 -2
- magic_pdf/libs/pdf_image_tools.py +36 -12
- magic_pdf/libs/version.py +1 -1
- magic_pdf/model/doc_analyze_by_custom_model.py +2 -0
- magic_pdf/model/magic_model.py +13 -13
- magic_pdf/model/pdf_extract_kit.py +122 -76
- magic_pdf/model/sub_modules/model_init.py +40 -35
- magic_pdf/model/sub_modules/ocr/paddleocr/ocr_utils.py +33 -7
- magic_pdf/model/sub_modules/ocr/paddleocr/ppocr_273_mod.py +12 -4
- magic_pdf/model/sub_modules/table/rapidtable/rapid_table.py +2 -0
- magic_pdf/model/sub_modules/table/tablemaster/tablemaster_paddle.py +30 -28
- magic_pdf/para/para_split.py +411 -248
- magic_pdf/para/para_split_v2.py +352 -182
- magic_pdf/para/para_split_v3.py +110 -53
- magic_pdf/pdf_parse_by_ocr.py +2 -0
- magic_pdf/pdf_parse_by_txt.py +2 -0
- magic_pdf/pdf_parse_union_core.py +174 -100
- magic_pdf/pdf_parse_union_core_v2.py +202 -36
- magic_pdf/pipe/AbsPipe.py +28 -44
- magic_pdf/pipe/OCRPipe.py +5 -5
- magic_pdf/pipe/TXTPipe.py +5 -6
- magic_pdf/pipe/UNIPipe.py +24 -25
- magic_pdf/post_proc/pdf_post_filter.py +7 -14
- magic_pdf/pre_proc/cut_image.py +9 -11
- magic_pdf/pre_proc/equations_replace.py +203 -212
- magic_pdf/pre_proc/ocr_detect_all_bboxes.py +235 -49
- magic_pdf/pre_proc/ocr_dict_merge.py +5 -5
- magic_pdf/pre_proc/ocr_span_list_modify.py +122 -63
- magic_pdf/pre_proc/pdf_pre_filter.py +37 -33
- magic_pdf/pre_proc/remove_bbox_overlap.py +20 -18
- magic_pdf/pre_proc/remove_colored_strip_bbox.py +36 -14
- magic_pdf/pre_proc/remove_footer_header.py +2 -5
- magic_pdf/pre_proc/remove_rotate_bbox.py +111 -63
- magic_pdf/pre_proc/resolve_bbox_conflict.py +10 -17
- magic_pdf/spark/spark_api.py +15 -17
- magic_pdf/tools/cli.py +3 -4
- magic_pdf/tools/cli_dev.py +6 -9
- magic_pdf/tools/common.py +26 -36
- magic_pdf/user_api.py +29 -38
- {magic_pdf-0.9.3.dist-info → magic_pdf-0.10.0.dist-info}/METADATA +11 -12
- {magic_pdf-0.9.3.dist-info → magic_pdf-0.10.0.dist-info}/RECORD +57 -58
- magic_pdf/libs/Constants.py +0 -55
- magic_pdf/libs/MakeContentConfig.py +0 -11
- magic_pdf/libs/drop_reason.py +0 -27
- magic_pdf/libs/drop_tag.py +0 -19
- magic_pdf/para/para_pipeline.py +0 -297
- /magic_pdf/{libs → config}/ocr_content_type.py +0 -0
- {magic_pdf-0.9.3.dist-info → magic_pdf-0.10.0.dist-info}/LICENSE.md +0 -0
- {magic_pdf-0.9.3.dist-info → magic_pdf-0.10.0.dist-info}/WHEEL +0 -0
- {magic_pdf-0.9.3.dist-info → magic_pdf-0.10.0.dist-info}/entry_points.txt +0 -0
- {magic_pdf-0.9.3.dist-info → magic_pdf-0.10.0.dist-info}/top_level.txt +0 -0
magic_pdf/para/para_split.py
CHANGED
@@ -1,12 +1,12 @@
|
|
1
|
-
from sklearn.cluster import DBSCAN
|
2
1
|
import numpy as np
|
3
2
|
from loguru import logger
|
3
|
+
from sklearn.cluster import DBSCAN
|
4
4
|
|
5
|
-
from magic_pdf.
|
6
|
-
from magic_pdf.libs.
|
7
|
-
|
5
|
+
from magic_pdf.config.ocr_content_type import ContentType
|
6
|
+
from magic_pdf.libs.boxbase import \
|
7
|
+
_is_in_or_part_overlap_with_area_ratio as is_in_layout
|
8
8
|
|
9
|
-
LINE_STOP_FLAG = ['.', '!', '?', '。', '!', '?',
|
9
|
+
LINE_STOP_FLAG = ['.', '!', '?', '。', '!', '?', ':', ':', ')', ')', ';']
|
10
10
|
INLINE_EQUATION = ContentType.InlineEquation
|
11
11
|
INTERLINE_EQUATION = ContentType.InterlineEquation
|
12
12
|
TEXT = ContentType.Text
|
@@ -14,30 +14,36 @@ TEXT = ContentType.Text
|
|
14
14
|
|
15
15
|
def __get_span_text(span):
|
16
16
|
c = span.get('content', '')
|
17
|
-
if len(c)==0:
|
17
|
+
if len(c) == 0:
|
18
18
|
c = span.get('image_path', '')
|
19
|
-
|
19
|
+
|
20
20
|
return c
|
21
|
-
|
21
|
+
|
22
22
|
|
23
23
|
def __detect_list_lines(lines, new_layout_bboxes, lang):
|
24
|
-
"""
|
25
|
-
|
24
|
+
"""探测是否包含了列表,并且把列表的行分开.
|
25
|
+
|
26
26
|
这样的段落特点是,顶格字母大写/数字,紧跟着几行缩进的。缩进的行首字母含小写的。
|
27
27
|
"""
|
28
|
+
|
28
29
|
def find_repeating_patterns(lst):
|
29
30
|
indices = []
|
30
31
|
ones_indices = []
|
31
32
|
i = 0
|
32
33
|
while i < len(lst) - 1: # 确保余下元素至少有2个
|
33
|
-
if lst[i] == 1 and lst[i+1] in [2, 3]: # 额外检查以防止连续出现的1
|
34
|
+
if lst[i] == 1 and lst[i + 1] in [2, 3]: # 额外检查以防止连续出现的1
|
34
35
|
start = i
|
35
36
|
ones_in_this_interval = [i]
|
36
37
|
i += 1
|
37
38
|
while i < len(lst) and lst[i] in [2, 3]:
|
38
39
|
i += 1
|
39
40
|
# 验证下一个序列是否符合条件
|
40
|
-
if
|
41
|
+
if (
|
42
|
+
i < len(lst) - 1
|
43
|
+
and lst[i] == 1
|
44
|
+
and lst[i + 1] in [2, 3]
|
45
|
+
and lst[i - 1] in [2, 3]
|
46
|
+
):
|
41
47
|
while i < len(lst) and lst[i] in [1, 2, 3]:
|
42
48
|
if lst[i] == 1:
|
43
49
|
ones_in_this_interval.append(i)
|
@@ -49,11 +55,13 @@ def __detect_list_lines(lines, new_layout_bboxes, lang):
|
|
49
55
|
else:
|
50
56
|
i += 1
|
51
57
|
return indices, ones_indices
|
58
|
+
|
52
59
|
"""===================="""
|
60
|
+
|
53
61
|
def split_indices(slen, index_array):
|
54
62
|
result = []
|
55
63
|
last_end = 0
|
56
|
-
|
64
|
+
|
57
65
|
for start, end in sorted(index_array):
|
58
66
|
if start > last_end:
|
59
67
|
# 前一个区间结束到下一个区间开始之间的部分标记为"text"
|
@@ -67,9 +75,10 @@ def __detect_list_lines(lines, new_layout_bboxes, lang):
|
|
67
75
|
result.append(('text', last_end, slen - 1))
|
68
76
|
|
69
77
|
return result
|
78
|
+
|
70
79
|
"""===================="""
|
71
80
|
|
72
|
-
if lang!='en':
|
81
|
+
if lang != 'en':
|
73
82
|
return lines, None
|
74
83
|
else:
|
75
84
|
total_lines = len(lines)
|
@@ -81,7 +90,7 @@ def __detect_list_lines(lines, new_layout_bboxes, lang):
|
|
81
90
|
3. 如果非顶格,首字符大写,编码为2
|
82
91
|
4. 如果非顶格,首字符非大写编码为3
|
83
92
|
"""
|
84
|
-
for l in lines:
|
93
|
+
for l in lines: # noqa: E741
|
85
94
|
first_char = __get_span_text(l['spans'][0])[0]
|
86
95
|
layout_left = __find_layout_bbox_by_line(l['bbox'], new_layout_bboxes)[0]
|
87
96
|
if l['bbox'][0] == layout_left:
|
@@ -94,68 +103,79 @@ def __detect_list_lines(lines, new_layout_bboxes, lang):
|
|
94
103
|
line_fea_encode.append(2)
|
95
104
|
else:
|
96
105
|
line_fea_encode.append(3)
|
97
|
-
|
106
|
+
|
98
107
|
# 然后根据编码进行分段, 选出来 1,2,3连续出现至少2次的行,认为是列表。
|
99
|
-
|
100
|
-
list_indice, list_start_idx
|
101
|
-
if len(list_indice)>0:
|
102
|
-
logger.info(f
|
103
|
-
|
108
|
+
|
109
|
+
list_indice, list_start_idx = find_repeating_patterns(line_fea_encode)
|
110
|
+
if len(list_indice) > 0:
|
111
|
+
logger.info(f'发现了列表,列表行数:{list_indice}, {list_start_idx}')
|
112
|
+
|
104
113
|
# TODO check一下这个特列表里缩进的行左侧是不是对齐的。
|
105
|
-
|
114
|
+
|
106
115
|
for start, end in list_indice:
|
107
|
-
for i in range(start, end+1):
|
108
|
-
if i>0:
|
116
|
+
for i in range(start, end + 1):
|
117
|
+
if i > 0:
|
109
118
|
if line_fea_encode[i] == 4:
|
110
|
-
logger.info(f
|
119
|
+
logger.info(f'列表行的第{i}行不是顶格的')
|
111
120
|
break
|
112
121
|
else:
|
113
|
-
logger.info(f
|
114
|
-
|
122
|
+
logger.info(f'列表行的第{start}到第{end}行是列表')
|
123
|
+
|
115
124
|
return split_indices(total_lines, list_indice), list_start_idx
|
116
|
-
|
117
|
-
|
125
|
+
|
118
126
|
|
119
127
|
def __valign_lines(blocks, layout_bboxes):
|
120
|
-
"""
|
121
|
-
|
122
|
-
|
123
|
-
|
124
|
-
"""
|
125
|
-
|
128
|
+
"""在一个layoutbox内对齐行的左侧和右侧。 扫描行的左侧和右侧,如果x0,
|
129
|
+
x1差距不超过一个阈值,就强行对齐到所处layout的左右两侧(和layout有一段距离)。
|
130
|
+
3是个经验值,TODO,计算得来,可以设置为1.5个正文字符。"""
|
131
|
+
|
126
132
|
min_distance = 3
|
127
133
|
min_sample = 2
|
128
134
|
new_layout_bboxes = []
|
129
|
-
|
135
|
+
|
130
136
|
for layout_box in layout_bboxes:
|
131
|
-
blocks_in_layoutbox = [
|
132
|
-
|
137
|
+
blocks_in_layoutbox = [
|
138
|
+
b for b in blocks if is_in_layout(b['bbox'], layout_box['layout_bbox'])
|
139
|
+
]
|
140
|
+
if len(blocks_in_layoutbox) == 0:
|
133
141
|
continue
|
134
|
-
|
135
|
-
x0_lst = np.array(
|
136
|
-
|
142
|
+
|
143
|
+
x0_lst = np.array(
|
144
|
+
[
|
145
|
+
[line['bbox'][0], 0]
|
146
|
+
for block in blocks_in_layoutbox
|
147
|
+
for line in block['lines']
|
148
|
+
]
|
149
|
+
)
|
150
|
+
x1_lst = np.array(
|
151
|
+
[
|
152
|
+
[line['bbox'][2], 0]
|
153
|
+
for block in blocks_in_layoutbox
|
154
|
+
for line in block['lines']
|
155
|
+
]
|
156
|
+
)
|
137
157
|
x0_clusters = DBSCAN(eps=min_distance, min_samples=min_sample).fit(x0_lst)
|
138
158
|
x1_clusters = DBSCAN(eps=min_distance, min_samples=min_sample).fit(x1_lst)
|
139
159
|
x0_uniq_label = np.unique(x0_clusters.labels_)
|
140
160
|
x1_uniq_label = np.unique(x1_clusters.labels_)
|
141
|
-
|
142
|
-
x0_2_new_val = {}
|
161
|
+
|
162
|
+
x0_2_new_val = {} # 存储旧值对应的新值映射
|
143
163
|
x1_2_new_val = {}
|
144
164
|
for label in x0_uniq_label:
|
145
|
-
if label
|
165
|
+
if label == -1:
|
146
166
|
continue
|
147
|
-
x0_index_of_label = np.where(x0_clusters.labels_==label)
|
148
|
-
x0_raw_val = x0_lst[x0_index_of_label][:,0]
|
149
|
-
x0_new_val = np.min(x0_lst[x0_index_of_label][:,0])
|
167
|
+
x0_index_of_label = np.where(x0_clusters.labels_ == label)
|
168
|
+
x0_raw_val = x0_lst[x0_index_of_label][:, 0]
|
169
|
+
x0_new_val = np.min(x0_lst[x0_index_of_label][:, 0])
|
150
170
|
x0_2_new_val.update({idx: x0_new_val for idx in x0_raw_val})
|
151
171
|
for label in x1_uniq_label:
|
152
|
-
if label
|
172
|
+
if label == -1:
|
153
173
|
continue
|
154
|
-
x1_index_of_label = np.where(x1_clusters.labels_==label)
|
155
|
-
x1_raw_val = x1_lst[x1_index_of_label][:,0]
|
156
|
-
x1_new_val = np.max(x1_lst[x1_index_of_label][:,0])
|
174
|
+
x1_index_of_label = np.where(x1_clusters.labels_ == label)
|
175
|
+
x1_raw_val = x1_lst[x1_index_of_label][:, 0]
|
176
|
+
x1_new_val = np.max(x1_lst[x1_index_of_label][:, 0])
|
157
177
|
x1_2_new_val.update({idx: x1_new_val for idx in x1_raw_val})
|
158
|
-
|
178
|
+
|
159
179
|
for block in blocks_in_layoutbox:
|
160
180
|
for line in block['lines']:
|
161
181
|
x0, x1 = line['bbox'][0], line['bbox'][2]
|
@@ -165,34 +185,34 @@ def __valign_lines(blocks, layout_bboxes):
|
|
165
185
|
if x1 in x1_2_new_val:
|
166
186
|
line['bbox'][2] = int(x1_2_new_val[x1])
|
167
187
|
# 其余对不齐的保持不动
|
168
|
-
|
188
|
+
|
169
189
|
# 由于修改了block里的line长度,现在需要重新计算block的bbox
|
170
190
|
for block in blocks_in_layoutbox:
|
171
|
-
block['bbox'] = [
|
172
|
-
|
173
|
-
|
174
|
-
|
175
|
-
|
191
|
+
block['bbox'] = [
|
192
|
+
min([line['bbox'][0] for line in block['lines']]),
|
193
|
+
min([line['bbox'][1] for line in block['lines']]),
|
194
|
+
max([line['bbox'][2] for line in block['lines']]),
|
195
|
+
max([line['bbox'][3] for line in block['lines']]),
|
196
|
+
]
|
197
|
+
|
176
198
|
"""新计算layout的bbox,因为block的bbox变了。"""
|
177
199
|
layout_x0 = min([block['bbox'][0] for block in blocks_in_layoutbox])
|
178
200
|
layout_y0 = min([block['bbox'][1] for block in blocks_in_layoutbox])
|
179
201
|
layout_x1 = max([block['bbox'][2] for block in blocks_in_layoutbox])
|
180
202
|
layout_y1 = max([block['bbox'][3] for block in blocks_in_layoutbox])
|
181
203
|
new_layout_bboxes.append([layout_x0, layout_y0, layout_x1, layout_y1])
|
182
|
-
|
204
|
+
|
183
205
|
return new_layout_bboxes
|
184
206
|
|
185
207
|
|
186
208
|
def __align_text_in_layout(blocks, layout_bboxes):
|
187
|
-
"""
|
188
|
-
由于ocr出来的line,有时候会在前后有一段空白,这个时候需要对文本进行对齐,超出的部分被layout左右侧截断。
|
189
|
-
"""
|
209
|
+
"""由于ocr出来的line,有时候会在前后有一段空白,这个时候需要对文本进行对齐,超出的部分被layout左右侧截断。"""
|
190
210
|
for layout in layout_bboxes:
|
191
211
|
lb = layout['layout_bbox']
|
192
212
|
blocks_in_layoutbox = [b for b in blocks if is_in_layout(b['bbox'], lb)]
|
193
|
-
if len(blocks_in_layoutbox)==0:
|
213
|
+
if len(blocks_in_layoutbox) == 0:
|
194
214
|
continue
|
195
|
-
|
215
|
+
|
196
216
|
for block in blocks_in_layoutbox:
|
197
217
|
for line in block['lines']:
|
198
218
|
x0, x1 = line['bbox'][0], line['bbox'][2]
|
@@ -200,69 +220,67 @@ def __align_text_in_layout(blocks, layout_bboxes):
|
|
200
220
|
line['bbox'][0] = lb[0]
|
201
221
|
if x1 > lb[2]:
|
202
222
|
line['bbox'][2] = lb[2]
|
203
|
-
|
204
|
-
|
223
|
+
|
224
|
+
|
205
225
|
def __common_pre_proc(blocks, layout_bboxes):
|
206
|
-
"""
|
207
|
-
|
208
|
-
"""
|
209
|
-
#__add_line_period(blocks, layout_bboxes)
|
226
|
+
"""不分语言的,对文本进行预处理."""
|
227
|
+
# __add_line_period(blocks, layout_bboxes)
|
210
228
|
__align_text_in_layout(blocks, layout_bboxes)
|
211
229
|
aligned_layout_bboxes = __valign_lines(blocks, layout_bboxes)
|
212
|
-
|
230
|
+
|
213
231
|
return aligned_layout_bboxes
|
214
232
|
|
233
|
+
|
215
234
|
def __pre_proc_zh_blocks(blocks, layout_bboxes):
|
216
|
-
"""
|
217
|
-
对中文文本进行分段预处理
|
218
|
-
"""
|
235
|
+
"""对中文文本进行分段预处理."""
|
219
236
|
pass
|
220
237
|
|
221
238
|
|
222
239
|
def __pre_proc_en_blocks(blocks, layout_bboxes):
|
223
|
-
"""
|
224
|
-
对英文文本进行分段预处理
|
225
|
-
"""
|
240
|
+
"""对英文文本进行分段预处理."""
|
226
241
|
pass
|
227
242
|
|
228
243
|
|
229
|
-
def __group_line_by_layout(blocks, layout_bboxes, lang=
|
230
|
-
"""
|
231
|
-
每个layout内的行进行聚合
|
232
|
-
"""
|
244
|
+
def __group_line_by_layout(blocks, layout_bboxes, lang='en'):
|
245
|
+
"""每个layout内的行进行聚合."""
|
233
246
|
# 因为只是一个block一行目前, 一个block就是一个段落
|
234
247
|
lines_group = []
|
235
|
-
|
248
|
+
|
236
249
|
for lyout in layout_bboxes:
|
237
|
-
lines = [
|
250
|
+
lines = [
|
251
|
+
line
|
252
|
+
for block in blocks
|
253
|
+
if is_in_layout(block['bbox'], lyout['layout_bbox'])
|
254
|
+
for line in block['lines']
|
255
|
+
]
|
238
256
|
lines_group.append(lines)
|
239
257
|
|
240
258
|
return lines_group
|
241
|
-
|
242
259
|
|
243
|
-
|
260
|
+
|
261
|
+
def __split_para_in_layoutbox(lines_group, new_layout_bbox, lang='en', char_avg_len=10):
|
244
262
|
"""
|
245
263
|
lines_group 进行行分段——layout内部进行分段。lines_group内每个元素是一个Layoutbox内的所有行。
|
246
264
|
1. 先计算每个group的左右边界。
|
247
265
|
2. 然后根据行末尾特征进行分段。
|
248
266
|
末尾特征:以句号等结束符结尾。并且距离右侧边界有一定距离。
|
249
267
|
且下一行开头不留空白。
|
250
|
-
|
268
|
+
|
251
269
|
"""
|
252
|
-
list_info = []
|
270
|
+
list_info = [] # 这个layout最后是不是列表,记录每一个layout里是不是列表开头,列表结尾
|
253
271
|
layout_paras = []
|
254
272
|
right_tail_distance = 1.5 * char_avg_len
|
255
|
-
|
273
|
+
|
256
274
|
for lines in lines_group:
|
257
275
|
paras = []
|
258
276
|
total_lines = len(lines)
|
259
|
-
if total_lines==0:
|
260
|
-
continue
|
261
|
-
if total_lines==1:
|
277
|
+
if total_lines == 0:
|
278
|
+
continue # 0行无需处理
|
279
|
+
if total_lines == 1: # 1行无法分段。
|
262
280
|
layout_paras.append([lines])
|
263
281
|
list_info.append([False, False])
|
264
282
|
continue
|
265
|
-
|
283
|
+
|
266
284
|
"""在进入到真正的分段之前,要对文字块从统计维度进行对齐方式的探测,
|
267
285
|
对齐方式分为以下:
|
268
286
|
1. 左对齐的文本块(特点是左侧顶格,或者左侧不顶格但是右侧顶格的行数大于非顶格的行数,顶格的首字母有大写也有小写)
|
@@ -271,139 +289,183 @@ def __split_para_in_layoutbox(lines_group, new_layout_bbox, lang="en", char_avg_
|
|
271
289
|
2. 左对齐的列表块(其特点是左侧顶格的行数小于等于非顶格的行数,非定格首字母会有小写,顶格90%是大写。并且左侧顶格行数大于1,大于1是为了这种模式连续出现才能称之为列表)
|
272
290
|
这样的文本块,顶格的为一个段落开头,紧随其后非顶格的行属于这个段落。
|
273
291
|
"""
|
274
|
-
|
275
|
-
text_segments, list_start_line = __detect_list_lines(
|
292
|
+
|
293
|
+
text_segments, list_start_line = __detect_list_lines(
|
294
|
+
lines, new_layout_bbox, lang
|
295
|
+
)
|
276
296
|
"""根据list_range,把lines分成几个部分
|
277
|
-
|
297
|
+
|
278
298
|
"""
|
279
|
-
|
299
|
+
|
280
300
|
layout_right = __find_layout_bbox_by_line(lines[0]['bbox'], new_layout_bbox)[2]
|
281
301
|
layout_left = __find_layout_bbox_by_line(lines[0]['bbox'], new_layout_bbox)[0]
|
282
|
-
para = []
|
283
|
-
layout_list_info = [
|
302
|
+
para = [] # 元素是line
|
303
|
+
layout_list_info = [
|
304
|
+
False,
|
305
|
+
False,
|
306
|
+
] # 这个layout最后是不是列表,记录每一个layout里是不是列表开头,列表结尾
|
284
307
|
for content_type, start, end in text_segments:
|
285
308
|
if content_type == 'list':
|
286
|
-
for i, line in enumerate(lines[start:end+1]):
|
309
|
+
for i, line in enumerate(lines[start : end + 1]):
|
287
310
|
line_x0 = line['bbox'][0]
|
288
|
-
if line_x0 == layout_left:
|
289
|
-
if len(para)>0:
|
311
|
+
if line_x0 == layout_left: # 列表开头
|
312
|
+
if len(para) > 0:
|
290
313
|
paras.append(para)
|
291
314
|
para = []
|
292
315
|
para.append(line)
|
293
316
|
else:
|
294
317
|
para.append(line)
|
295
|
-
if len(para)>0:
|
318
|
+
if len(para) > 0:
|
296
319
|
paras.append(para)
|
297
320
|
para = []
|
298
|
-
if start==0:
|
321
|
+
if start == 0:
|
299
322
|
layout_list_info[0] = True
|
300
|
-
if end==total_lines-1:
|
323
|
+
if end == total_lines - 1:
|
301
324
|
layout_list_info[1] = True
|
302
|
-
else:
|
303
|
-
for i, line in enumerate(lines[start:end+1]):
|
325
|
+
else: # 是普通文本
|
326
|
+
for i, line in enumerate(lines[start : end + 1]):
|
304
327
|
# 如果i有下一行,那么就要根据下一行位置综合判断是否要分段。如果i之后没有行,那么只需要判断i行自己的结尾特征。
|
305
328
|
cur_line_type = line['spans'][-1]['type']
|
306
|
-
next_line = lines[i+1] if i<total_lines-1 else None
|
307
|
-
|
329
|
+
next_line = lines[i + 1] if i < total_lines - 1 else None
|
330
|
+
|
308
331
|
if cur_line_type in [TEXT, INLINE_EQUATION]:
|
309
332
|
if line['bbox'][2] < layout_right - right_tail_distance:
|
310
333
|
para.append(line)
|
311
334
|
paras.append(para)
|
312
335
|
para = []
|
313
|
-
elif
|
336
|
+
elif (
|
337
|
+
line['bbox'][2] >= layout_right - right_tail_distance
|
338
|
+
and next_line
|
339
|
+
and next_line['bbox'][0] == layout_left
|
340
|
+
): # 现在这行到了行尾沾满,下一行存在且顶格。
|
314
341
|
para.append(line)
|
315
|
-
else:
|
342
|
+
else:
|
316
343
|
para.append(line)
|
317
344
|
paras.append(para)
|
318
345
|
para = []
|
319
|
-
else:
|
320
|
-
if len(para)>0: # 先把之前的段落加入到结果中
|
346
|
+
else: # 其他,图片、表格、行间公式,各自占一段
|
347
|
+
if len(para) > 0: # 先把之前的段落加入到结果中
|
321
348
|
paras.append(para)
|
322
349
|
para = []
|
323
|
-
paras.append(
|
350
|
+
paras.append(
|
351
|
+
[line]
|
352
|
+
) # 再把当前行加入到结果中。当前行为行间公式、图、表等。
|
324
353
|
para = []
|
325
|
-
|
326
|
-
if len(para)>0:
|
354
|
+
|
355
|
+
if len(para) > 0:
|
327
356
|
paras.append(para)
|
328
357
|
para = []
|
329
|
-
|
358
|
+
|
330
359
|
list_info.append(layout_list_info)
|
331
360
|
layout_paras.append(paras)
|
332
361
|
paras = []
|
333
|
-
|
334
|
-
|
362
|
+
|
335
363
|
return layout_paras, list_info
|
336
364
|
|
337
|
-
|
338
|
-
|
339
|
-
|
340
|
-
|
341
|
-
"""
|
342
|
-
|
365
|
+
|
366
|
+
def __connect_list_inter_layout(
|
367
|
+
layout_paras, new_layout_bbox, layout_list_info, page_num, lang
|
368
|
+
):
|
369
|
+
"""如果上个layout的最后一个段落是列表,下一个layout的第一个段落也是列表,那么将他们连接起来。 TODO
|
370
|
+
因为没有区分列表和段落,所以这个方法暂时不实现。
|
371
|
+
根据layout_list_info判断是不是列表。,下个layout的第一个段如果不是列表,那么看他们是否有几行都有相同的缩进。"""
|
372
|
+
if (
|
373
|
+
len(layout_paras) == 0 or len(layout_list_info) == 0
|
374
|
+
): # 0的时候最后的return 会出错
|
343
375
|
return layout_paras, [False, False]
|
344
|
-
|
376
|
+
|
345
377
|
for i in range(1, len(layout_paras)):
|
346
|
-
pre_layout_list_info = layout_list_info[i-1]
|
378
|
+
pre_layout_list_info = layout_list_info[i - 1]
|
347
379
|
next_layout_list_info = layout_list_info[i]
|
348
|
-
pre_last_para = layout_paras[i-1][-1]
|
380
|
+
pre_last_para = layout_paras[i - 1][-1]
|
349
381
|
next_paras = layout_paras[i]
|
350
|
-
|
351
|
-
|
352
|
-
|
353
|
-
|
382
|
+
|
383
|
+
if (
|
384
|
+
pre_layout_list_info[1] and not next_layout_list_info[0]
|
385
|
+
): # 前一个是列表结尾,后一个是非列表开头,此时检测是否有相同的缩进
|
386
|
+
logger.info(f'连接page {page_num} 内的list')
|
354
387
|
# 向layout_paras[i] 寻找开头具有相同缩进的连续的行
|
355
388
|
may_list_lines = []
|
356
389
|
for j in range(len(next_paras)):
|
357
390
|
line = next_paras[j]
|
358
|
-
if len(line)==1:
|
359
|
-
if
|
391
|
+
if len(line) == 1: # 只可能是一行,多行情况再需要分析了
|
392
|
+
if (
|
393
|
+
line[0]['bbox'][0]
|
394
|
+
> __find_layout_bbox_by_line(line[0]['bbox'], new_layout_bbox)[
|
395
|
+
0
|
396
|
+
]
|
397
|
+
):
|
360
398
|
may_list_lines.append(line[0])
|
361
399
|
else:
|
362
400
|
break
|
363
401
|
else:
|
364
402
|
break
|
365
403
|
# 如果这些行的缩进是相等的,那么连到上一个layout的最后一个段落上。
|
366
|
-
if
|
404
|
+
if (
|
405
|
+
len(may_list_lines) > 0
|
406
|
+
and len(set([x['bbox'][0] for x in may_list_lines])) == 1
|
407
|
+
):
|
367
408
|
pre_last_para.extend(may_list_lines)
|
368
|
-
layout_paras[i] = layout_paras[i][len(may_list_lines):]
|
369
|
-
|
370
|
-
return layout_paras, [
|
371
|
-
|
372
|
-
|
373
|
-
|
374
|
-
|
375
|
-
|
376
|
-
|
377
|
-
|
378
|
-
|
409
|
+
layout_paras[i] = layout_paras[i][len(may_list_lines) :]
|
410
|
+
|
411
|
+
return layout_paras, [
|
412
|
+
layout_list_info[0][0],
|
413
|
+
layout_list_info[-1][1],
|
414
|
+
] # 同时还返回了这个页面级别的开头、结尾是不是列表的信息
|
415
|
+
|
416
|
+
|
417
|
+
def __connect_list_inter_page(
|
418
|
+
pre_page_paras,
|
419
|
+
next_page_paras,
|
420
|
+
pre_page_layout_bbox,
|
421
|
+
next_page_layout_bbox,
|
422
|
+
pre_page_list_info,
|
423
|
+
next_page_list_info,
|
424
|
+
page_num,
|
425
|
+
lang,
|
426
|
+
):
|
427
|
+
"""如果上个layout的最后一个段落是列表,下一个layout的第一个段落也是列表,那么将他们连接起来。 TODO
|
428
|
+
因为没有区分列表和段落,所以这个方法暂时不实现。
|
429
|
+
根据layout_list_info判断是不是列表。,下个layout的第一个段如果不是列表,那么看他们是否有几行都有相同的缩进。"""
|
430
|
+
if (
|
431
|
+
len(pre_page_paras) == 0 or len(next_page_paras) == 0
|
432
|
+
): # 0的时候最后的return 会出错
|
379
433
|
return False
|
380
|
-
|
381
|
-
if
|
382
|
-
|
434
|
+
|
435
|
+
if (
|
436
|
+
pre_page_list_info[1] and not next_page_list_info[0]
|
437
|
+
): # 前一个是列表结尾,后一个是非列表开头,此时检测是否有相同的缩进
|
438
|
+
logger.info(f'连接page {page_num} 内的list')
|
383
439
|
# 向layout_paras[i] 寻找开头具有相同缩进的连续的行
|
384
440
|
may_list_lines = []
|
385
441
|
for j in range(len(next_page_paras[0])):
|
386
442
|
line = next_page_paras[0][j]
|
387
|
-
if len(line)==1:
|
388
|
-
if
|
443
|
+
if len(line) == 1: # 只可能是一行,多行情况再需要分析了
|
444
|
+
if (
|
445
|
+
line[0]['bbox'][0]
|
446
|
+
> __find_layout_bbox_by_line(
|
447
|
+
line[0]['bbox'], next_page_layout_bbox
|
448
|
+
)[0]
|
449
|
+
):
|
389
450
|
may_list_lines.append(line[0])
|
390
451
|
else:
|
391
452
|
break
|
392
453
|
else:
|
393
454
|
break
|
394
455
|
# 如果这些行的缩进是相等的,那么连到上一个layout的最后一个段落上。
|
395
|
-
if
|
456
|
+
if (
|
457
|
+
len(may_list_lines) > 0
|
458
|
+
and len(set([x['bbox'][0] for x in may_list_lines])) == 1
|
459
|
+
):
|
396
460
|
pre_page_paras[-1].append(may_list_lines)
|
397
|
-
next_page_paras[0] = next_page_paras[0][len(may_list_lines):]
|
461
|
+
next_page_paras[0] = next_page_paras[0][len(may_list_lines) :]
|
398
462
|
return True
|
399
|
-
|
463
|
+
|
400
464
|
return False
|
401
465
|
|
402
466
|
|
403
467
|
def __find_layout_bbox_by_line(line_bbox, layout_bboxes):
|
404
|
-
"""
|
405
|
-
根据line找到所在的layout
|
406
|
-
"""
|
468
|
+
"""根据line找到所在的layout."""
|
407
469
|
for layout in layout_bboxes:
|
408
470
|
if is_in_layout(line_bbox, layout):
|
409
471
|
return layout
|
@@ -420,48 +482,74 @@ def __connect_para_inter_layoutbox(layout_paras, new_layout_bbox, lang):
|
|
420
482
|
|
421
483
|
"""
|
422
484
|
connected_layout_paras = []
|
423
|
-
if len(layout_paras)==0:
|
485
|
+
if len(layout_paras) == 0:
|
424
486
|
return connected_layout_paras
|
425
|
-
|
487
|
+
|
426
488
|
connected_layout_paras.append(layout_paras[0])
|
427
489
|
for i in range(1, len(layout_paras)):
|
428
490
|
try:
|
429
|
-
if
|
491
|
+
if (
|
492
|
+
len(layout_paras[i]) == 0 or len(layout_paras[i - 1]) == 0
|
493
|
+
): # TODO 考虑连接问题,
|
430
494
|
continue
|
431
|
-
pre_last_line = layout_paras[i-1][-1][-1]
|
495
|
+
pre_last_line = layout_paras[i - 1][-1][-1]
|
432
496
|
next_first_line = layout_paras[i][0][0]
|
433
|
-
except Exception
|
434
|
-
logger.error(f
|
497
|
+
except Exception:
|
498
|
+
logger.error(f'page layout {i} has no line')
|
435
499
|
continue
|
436
|
-
pre_last_line_text = ''.join(
|
500
|
+
pre_last_line_text = ''.join(
|
501
|
+
[__get_span_text(span) for span in pre_last_line['spans']]
|
502
|
+
)
|
437
503
|
pre_last_line_type = pre_last_line['spans'][-1]['type']
|
438
|
-
next_first_line_text = ''.join(
|
504
|
+
next_first_line_text = ''.join(
|
505
|
+
[__get_span_text(span) for span in next_first_line['spans']]
|
506
|
+
)
|
439
507
|
next_first_line_type = next_first_line['spans'][0]['type']
|
440
|
-
if pre_last_line_type not in [
|
508
|
+
if pre_last_line_type not in [
|
509
|
+
TEXT,
|
510
|
+
INLINE_EQUATION,
|
511
|
+
] or next_first_line_type not in [TEXT, INLINE_EQUATION]:
|
441
512
|
connected_layout_paras.append(layout_paras[i])
|
442
513
|
continue
|
443
|
-
|
444
|
-
pre_x2_max = __find_layout_bbox_by_line(pre_last_line['bbox'], new_layout_bbox)[
|
445
|
-
|
446
|
-
|
514
|
+
|
515
|
+
pre_x2_max = __find_layout_bbox_by_line(pre_last_line['bbox'], new_layout_bbox)[
|
516
|
+
2
|
517
|
+
]
|
518
|
+
next_x0_min = __find_layout_bbox_by_line(
|
519
|
+
next_first_line['bbox'], new_layout_bbox
|
520
|
+
)[0]
|
521
|
+
|
447
522
|
pre_last_line_text = pre_last_line_text.strip()
|
448
523
|
next_first_line_text = next_first_line_text.strip()
|
449
|
-
if
|
524
|
+
if (
|
525
|
+
pre_last_line['bbox'][2] == pre_x2_max
|
526
|
+
and pre_last_line_text[-1] not in LINE_STOP_FLAG
|
527
|
+
and next_first_line['bbox'][0] == next_x0_min
|
528
|
+
): # 前面一行沾满了整个行,并且没有结尾符号.下一行没有空白开头。
|
450
529
|
"""连接段落条件成立,将前一个layout的段落和后一个layout的段落连接。"""
|
451
530
|
connected_layout_paras[-1][-1].extend(layout_paras[i][0])
|
452
|
-
layout_paras[i].pop(
|
453
|
-
|
531
|
+
layout_paras[i].pop(
|
532
|
+
0
|
533
|
+
) # 删除后一个layout的第一个段落, 因为他已经被合并到前一个layout的最后一个段落了。
|
534
|
+
if len(layout_paras[i]) == 0:
|
454
535
|
layout_paras.pop(i)
|
455
536
|
else:
|
456
537
|
connected_layout_paras.append(layout_paras[i])
|
457
|
-
else:
|
538
|
+
else:
|
458
539
|
"""连接段落条件不成立,将前一个layout的段落加入到结果中。"""
|
459
540
|
connected_layout_paras.append(layout_paras[i])
|
460
|
-
|
541
|
+
|
461
542
|
return connected_layout_paras
|
462
543
|
|
463
544
|
|
464
|
-
def __connect_para_inter_page(
|
545
|
+
def __connect_para_inter_page(
|
546
|
+
pre_page_paras,
|
547
|
+
next_page_paras,
|
548
|
+
pre_page_layout_bbox,
|
549
|
+
next_page_layout_bbox,
|
550
|
+
page_num,
|
551
|
+
lang,
|
552
|
+
):
|
465
553
|
"""
|
466
554
|
连接起来相邻两个页面的段落——前一个页面最后一个段落和后一个页面的第一个段落。
|
467
555
|
是否可以连接的条件:
|
@@ -469,34 +557,60 @@ def __connect_para_inter_page(pre_page_paras, next_page_paras, pre_page_layout_b
|
|
469
557
|
2. 后一个页面的第一个段落第一行没有空白开头。
|
470
558
|
"""
|
471
559
|
# 有的页面可能压根没有文字
|
472
|
-
if
|
560
|
+
if (
|
561
|
+
len(pre_page_paras) == 0
|
562
|
+
or len(next_page_paras) == 0
|
563
|
+
or len(pre_page_paras[0]) == 0
|
564
|
+
or len(next_page_paras[0]) == 0
|
565
|
+
): # TODO [[]]为什么出现在pre_page_paras里?
|
473
566
|
return False
|
474
567
|
pre_last_para = pre_page_paras[-1][-1]
|
475
568
|
next_first_para = next_page_paras[0][0]
|
476
569
|
pre_last_line = pre_last_para[-1]
|
477
570
|
next_first_line = next_first_para[0]
|
478
|
-
pre_last_line_text = ''.join(
|
571
|
+
pre_last_line_text = ''.join(
|
572
|
+
[__get_span_text(span) for span in pre_last_line['spans']]
|
573
|
+
)
|
479
574
|
pre_last_line_type = pre_last_line['spans'][-1]['type']
|
480
|
-
next_first_line_text = ''.join(
|
575
|
+
next_first_line_text = ''.join(
|
576
|
+
[__get_span_text(span) for span in next_first_line['spans']]
|
577
|
+
)
|
481
578
|
next_first_line_type = next_first_line['spans'][0]['type']
|
482
|
-
|
483
|
-
if pre_last_line_type not in [
|
579
|
+
|
580
|
+
if pre_last_line_type not in [
|
581
|
+
TEXT,
|
582
|
+
INLINE_EQUATION,
|
583
|
+
] or next_first_line_type not in [
|
584
|
+
TEXT,
|
585
|
+
INLINE_EQUATION,
|
586
|
+
]: # TODO,真的要做好,要考虑跨table, image, 行间的情况
|
484
587
|
# 不是文本,不连接
|
485
588
|
return False
|
486
|
-
|
487
|
-
pre_x2_max = __find_layout_bbox_by_line(
|
488
|
-
|
489
|
-
|
589
|
+
|
590
|
+
pre_x2_max = __find_layout_bbox_by_line(
|
591
|
+
pre_last_line['bbox'], pre_page_layout_bbox
|
592
|
+
)[2]
|
593
|
+
next_x0_min = __find_layout_bbox_by_line(
|
594
|
+
next_first_line['bbox'], next_page_layout_bbox
|
595
|
+
)[0]
|
596
|
+
|
490
597
|
pre_last_line_text = pre_last_line_text.strip()
|
491
598
|
next_first_line_text = next_first_line_text.strip()
|
492
|
-
if
|
599
|
+
if (
|
600
|
+
pre_last_line['bbox'][2] == pre_x2_max
|
601
|
+
and pre_last_line_text[-1] not in LINE_STOP_FLAG
|
602
|
+
and next_first_line['bbox'][0] == next_x0_min
|
603
|
+
): # 前面一行沾满了整个行,并且没有结尾符号.下一行没有空白开头。
|
493
604
|
"""连接段落条件成立,将前一个layout的段落和后一个layout的段落连接。"""
|
494
605
|
pre_last_para.extend(next_first_para)
|
495
|
-
next_page_paras[0].pop(
|
606
|
+
next_page_paras[0].pop(
|
607
|
+
0
|
608
|
+
) # 删除后一个页面的第一个段落, 因为他已经被合并到前一个页面的最后一个段落了。
|
496
609
|
return True
|
497
610
|
else:
|
498
611
|
return False
|
499
612
|
|
613
|
+
|
500
614
|
def find_consecutive_true_regions(input_array):
|
501
615
|
start_index = None # 连续True区域的起始索引
|
502
616
|
regions = [] # 用于保存所有连续True区域的起始和结束索引
|
@@ -509,77 +623,103 @@ def find_consecutive_true_regions(input_array):
|
|
509
623
|
# 如果我们找到了一个False值,并且当前在连续True区域中
|
510
624
|
elif not input_array[i] and start_index is not None:
|
511
625
|
# 如果连续True区域长度大于1,那么将其添加到结果列表中
|
512
|
-
if i - start_index > 1:
|
513
|
-
regions.append((start_index, i-1))
|
626
|
+
if i - start_index > 1:
|
627
|
+
regions.append((start_index, i - 1))
|
514
628
|
start_index = None # 重置起始索引
|
515
629
|
|
516
630
|
# 如果最后一个元素是True,那么需要将最后一个连续True区域加入到结果列表中
|
517
631
|
if start_index is not None and len(input_array) - start_index > 1:
|
518
|
-
regions.append((start_index, len(input_array)-1))
|
632
|
+
regions.append((start_index, len(input_array) - 1))
|
519
633
|
|
520
634
|
return regions
|
521
635
|
|
522
636
|
|
523
|
-
def __connect_middle_align_text(
|
637
|
+
def __connect_middle_align_text(
|
638
|
+
page_paras, new_layout_bbox, page_num, lang, debug_mode
|
639
|
+
):
|
524
640
|
"""
|
525
641
|
找出来中间对齐的连续单行文本,如果连续行高度相同,那么合并为一个段落。
|
526
642
|
一个line居中的条件是:
|
527
643
|
1. 水平中心点跨越layout的中心点。
|
528
644
|
2. 左右两侧都有空白
|
529
645
|
"""
|
530
|
-
|
646
|
+
|
531
647
|
for layout_i, layout_para in enumerate(page_paras):
|
532
648
|
layout_box = new_layout_bbox[layout_i]
|
533
649
|
single_line_paras_tag = []
|
534
650
|
for i in range(len(layout_para)):
|
535
|
-
single_line_paras_tag.append(
|
536
|
-
|
651
|
+
single_line_paras_tag.append(
|
652
|
+
len(layout_para[i]) == 1
|
653
|
+
and layout_para[i][0]['spans'][0]['type'] == TEXT
|
654
|
+
)
|
655
|
+
|
537
656
|
"""找出来连续的单行文本,如果连续行高度相同,那么合并为一个段落。"""
|
538
|
-
consecutive_single_line_indices = find_consecutive_true_regions(
|
539
|
-
|
657
|
+
consecutive_single_line_indices = find_consecutive_true_regions(
|
658
|
+
single_line_paras_tag
|
659
|
+
)
|
660
|
+
if len(consecutive_single_line_indices) > 0:
|
540
661
|
index_offset = 0
|
541
662
|
"""检查这些行是否是高度相同的,居中的"""
|
542
663
|
for start, end in consecutive_single_line_indices:
|
543
664
|
start += index_offset
|
544
665
|
end += index_offset
|
545
|
-
line_hi = np.array(
|
546
|
-
|
547
|
-
|
666
|
+
line_hi = np.array(
|
667
|
+
[
|
668
|
+
line[0]['bbox'][3] - line[0]['bbox'][1]
|
669
|
+
for line in layout_para[start : end + 1]
|
670
|
+
]
|
671
|
+
)
|
672
|
+
first_line_text = ''.join(
|
673
|
+
[__get_span_text(span) for span in layout_para[start][0]['spans']]
|
674
|
+
)
|
675
|
+
if 'Table' in first_line_text or 'Figure' in first_line_text:
|
548
676
|
pass
|
549
677
|
if debug_mode:
|
550
678
|
logger.debug(line_hi.std())
|
551
|
-
|
552
|
-
if line_hi.std()<2:
|
553
|
-
"""
|
554
|
-
all_left_x0 = [
|
555
|
-
|
679
|
+
|
680
|
+
if line_hi.std() < 2:
|
681
|
+
"""行高度相同,那么判断是否居中."""
|
682
|
+
all_left_x0 = [
|
683
|
+
line[0]['bbox'][0] for line in layout_para[start : end + 1]
|
684
|
+
]
|
685
|
+
all_right_x1 = [
|
686
|
+
line[0]['bbox'][2] for line in layout_para[start : end + 1]
|
687
|
+
]
|
556
688
|
layout_center = (layout_box[0] + layout_box[2]) / 2
|
557
|
-
if
|
558
|
-
|
559
|
-
|
560
|
-
|
561
|
-
|
689
|
+
if (
|
690
|
+
all(
|
691
|
+
[
|
692
|
+
x0 < layout_center < x1
|
693
|
+
for x0, x1 in zip(all_left_x0, all_right_x1)
|
694
|
+
]
|
695
|
+
)
|
696
|
+
and not all([x0 == layout_box[0] for x0 in all_left_x0])
|
697
|
+
and not all([x1 == layout_box[2] for x1 in all_right_x1])
|
698
|
+
):
|
699
|
+
merge_para = [l[0] for l in layout_para[start : end + 1]] # noqa: E741
|
700
|
+
para_text = ''.join(
|
701
|
+
[
|
702
|
+
__get_span_text(span)
|
703
|
+
for line in merge_para
|
704
|
+
for span in line['spans']
|
705
|
+
]
|
706
|
+
)
|
562
707
|
if debug_mode:
|
563
708
|
logger.debug(para_text)
|
564
|
-
layout_para[start:end+1] = [merge_para]
|
565
|
-
index_offset -= end-start
|
566
|
-
|
709
|
+
layout_para[start : end + 1] = [merge_para]
|
710
|
+
index_offset -= end - start
|
711
|
+
|
567
712
|
return
|
568
|
-
|
713
|
+
|
569
714
|
|
570
715
|
def __merge_signle_list_text(page_paras, new_layout_bbox, page_num, lang):
|
571
|
-
"""
|
572
|
-
|
573
|
-
"""
|
574
|
-
|
716
|
+
"""找出来连续的单行文本,如果首行顶格,接下来的几个单行段落缩进对齐,那么合并为一个段落。"""
|
717
|
+
|
575
718
|
pass
|
576
719
|
|
577
720
|
|
578
721
|
def __do_split_page(blocks, layout_bboxes, new_layout_bbox, page_num, lang):
|
579
|
-
"""
|
580
|
-
根据line和layout情况进行分段
|
581
|
-
先实现一个根据行末尾特征分段的简单方法。
|
582
|
-
"""
|
722
|
+
"""根据line和layout情况进行分段 先实现一个根据行末尾特征分段的简单方法。"""
|
583
723
|
"""
|
584
724
|
算法思路:
|
585
725
|
1. 扫描layout里每一行,找出来行尾距离layout有边界有一定距离的行。
|
@@ -587,52 +727,73 @@ def __do_split_page(blocks, layout_bboxes, new_layout_bbox, page_num, lang):
|
|
587
727
|
3. 参照上述行尾特征进行分段。
|
588
728
|
4. 图、表,目前独占一行,不考虑分段。
|
589
729
|
"""
|
590
|
-
if page_num==343:
|
730
|
+
if page_num == 343:
|
591
731
|
pass
|
592
|
-
lines_group = __group_line_by_layout(blocks, layout_bboxes, lang)
|
593
|
-
layout_paras, layout_list_info = __split_para_in_layoutbox(
|
594
|
-
|
595
|
-
|
596
|
-
|
597
|
-
|
732
|
+
lines_group = __group_line_by_layout(blocks, layout_bboxes, lang) # block内分段
|
733
|
+
layout_paras, layout_list_info = __split_para_in_layoutbox(
|
734
|
+
lines_group, new_layout_bbox, lang
|
735
|
+
) # layout内分段
|
736
|
+
layout_paras2, page_list_info = __connect_list_inter_layout(
|
737
|
+
layout_paras, new_layout_bbox, layout_list_info, page_num, lang
|
738
|
+
) # layout之间连接列表段落
|
739
|
+
connected_layout_paras = __connect_para_inter_layoutbox(
|
740
|
+
layout_paras2, new_layout_bbox, lang
|
741
|
+
) # layout间链接段落
|
742
|
+
|
598
743
|
return connected_layout_paras, page_list_info
|
599
|
-
|
600
|
-
|
601
|
-
def para_split(pdf_info_dict, debug_mode, lang=
|
602
|
-
"""
|
603
|
-
|
604
|
-
|
605
|
-
new_layout_of_pages = [] # 数组的数组,每个元素是一个页面的layoutS
|
606
|
-
all_page_list_info = [] # 保存每个页面开头和结尾是否是列表
|
744
|
+
|
745
|
+
|
746
|
+
def para_split(pdf_info_dict, debug_mode, lang='en'):
|
747
|
+
"""根据line和layout情况进行分段."""
|
748
|
+
new_layout_of_pages = [] # 数组的数组,每个元素是一个页面的layoutS
|
749
|
+
all_page_list_info = [] # 保存每个页面开头和结尾是否是列表
|
607
750
|
for page_num, page in pdf_info_dict.items():
|
608
751
|
blocks = page['preproc_blocks']
|
609
752
|
layout_bboxes = page['layout_bboxes']
|
610
753
|
new_layout_bbox = __common_pre_proc(blocks, layout_bboxes)
|
611
754
|
new_layout_of_pages.append(new_layout_bbox)
|
612
|
-
splited_blocks, page_list_info = __do_split_page(
|
755
|
+
splited_blocks, page_list_info = __do_split_page(
|
756
|
+
blocks, layout_bboxes, new_layout_bbox, page_num, lang
|
757
|
+
)
|
613
758
|
all_page_list_info.append(page_list_info)
|
614
759
|
page['para_blocks'] = splited_blocks
|
615
|
-
|
760
|
+
|
616
761
|
"""连接页面与页面之间的可能合并的段落"""
|
617
762
|
pdf_infos = list(pdf_info_dict.values())
|
618
763
|
for page_num, page in enumerate(pdf_info_dict.values()):
|
619
|
-
if page_num==0:
|
764
|
+
if page_num == 0:
|
620
765
|
continue
|
621
|
-
pre_page_paras = pdf_infos[page_num-1]['para_blocks']
|
766
|
+
pre_page_paras = pdf_infos[page_num - 1]['para_blocks']
|
622
767
|
next_page_paras = pdf_infos[page_num]['para_blocks']
|
623
|
-
pre_page_layout_bbox = new_layout_of_pages[page_num-1]
|
768
|
+
pre_page_layout_bbox = new_layout_of_pages[page_num - 1]
|
624
769
|
next_page_layout_bbox = new_layout_of_pages[page_num]
|
625
|
-
|
626
|
-
is_conn = __connect_para_inter_page(
|
770
|
+
|
771
|
+
is_conn = __connect_para_inter_page(
|
772
|
+
pre_page_paras,
|
773
|
+
next_page_paras,
|
774
|
+
pre_page_layout_bbox,
|
775
|
+
next_page_layout_bbox,
|
776
|
+
page_num,
|
777
|
+
lang,
|
778
|
+
)
|
627
779
|
if debug_mode:
|
628
780
|
if is_conn:
|
629
|
-
logger.info(f
|
630
|
-
|
631
|
-
is_list_conn = __connect_list_inter_page(
|
781
|
+
logger.info(f'连接了第{page_num-1}页和第{page_num}页的段落')
|
782
|
+
|
783
|
+
is_list_conn = __connect_list_inter_page(
|
784
|
+
pre_page_paras,
|
785
|
+
next_page_paras,
|
786
|
+
pre_page_layout_bbox,
|
787
|
+
next_page_layout_bbox,
|
788
|
+
all_page_list_info[page_num - 1],
|
789
|
+
all_page_list_info[page_num],
|
790
|
+
page_num,
|
791
|
+
lang,
|
792
|
+
)
|
632
793
|
if debug_mode:
|
633
794
|
if is_list_conn:
|
634
|
-
logger.info(f
|
635
|
-
|
795
|
+
logger.info(f'连接了第{page_num-1}页和第{page_num}页的列表段落')
|
796
|
+
|
636
797
|
"""接下来可能会漏掉一些特别的一些可以合并的内容,对他们进行段落连接
|
637
798
|
1. 正文中有时出现一个行顶格,接下来几行缩进的情况。
|
638
799
|
2. 居中的一些连续单行,如果高度相同,那么可能是一个段落。
|
@@ -640,5 +801,7 @@ def para_split(pdf_info_dict, debug_mode, lang="en"):
|
|
640
801
|
for page_num, page in enumerate(pdf_info_dict.values()):
|
641
802
|
page_paras = page['para_blocks']
|
642
803
|
new_layout_bbox = new_layout_of_pages[page_num]
|
643
|
-
__connect_middle_align_text(
|
804
|
+
__connect_middle_align_text(
|
805
|
+
page_paras, new_layout_bbox, page_num, lang, debug_mode=debug_mode
|
806
|
+
)
|
644
807
|
__merge_signle_list_text(page_paras, new_layout_bbox, page_num, lang)
|