magic-pdf 0.10.0__py3-none-any.whl → 0.10.2__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/data/data_reader_writer/filebase.py +3 -0
- magic_pdf/filter/pdf_meta_scan.py +3 -17
- magic_pdf/libs/commons.py +0 -161
- magic_pdf/libs/draw_bbox.py +2 -3
- magic_pdf/libs/markdown_utils.py +0 -21
- magic_pdf/libs/pdf_image_tools.py +2 -1
- magic_pdf/libs/version.py +1 -1
- magic_pdf/model/doc_analyze_by_custom_model.py +2 -2
- magic_pdf/model/magic_model.py +0 -30
- magic_pdf/model/sub_modules/ocr/paddleocr/ocr_utils.py +3 -28
- magic_pdf/model/sub_modules/ocr/paddleocr/ppocr_273_mod.py +3 -3
- magic_pdf/para/para_split_v3.py +7 -2
- magic_pdf/pdf_parse_union_core_v2.py +97 -124
- magic_pdf/pre_proc/construct_page_dict.py +0 -55
- magic_pdf/pre_proc/cut_image.py +0 -37
- magic_pdf/pre_proc/ocr_detect_all_bboxes.py +5 -178
- magic_pdf/pre_proc/ocr_dict_merge.py +1 -224
- magic_pdf/pre_proc/ocr_span_list_modify.py +2 -252
- magic_pdf/rw/S3ReaderWriter.py +1 -1
- {magic_pdf-0.10.0.dist-info → magic_pdf-0.10.2.dist-info}/METADATA +3 -77
- {magic_pdf-0.10.0.dist-info → magic_pdf-0.10.2.dist-info}/RECORD +25 -76
- {magic_pdf-0.10.0.dist-info → magic_pdf-0.10.2.dist-info}/WHEEL +1 -1
- magic_pdf/dict2md/mkcontent.py +0 -438
- magic_pdf/layout/__init__.py +0 -0
- magic_pdf/layout/bbox_sort.py +0 -681
- magic_pdf/layout/layout_det_utils.py +0 -182
- magic_pdf/layout/layout_sort.py +0 -921
- magic_pdf/layout/layout_spiler_recog.py +0 -101
- magic_pdf/layout/mcol_sort.py +0 -336
- magic_pdf/libs/calc_span_stats.py +0 -239
- magic_pdf/libs/detect_language_from_model.py +0 -21
- magic_pdf/libs/nlp_utils.py +0 -203
- magic_pdf/libs/textbase.py +0 -33
- magic_pdf/libs/vis_utils.py +0 -308
- magic_pdf/para/block_continuation_processor.py +0 -562
- magic_pdf/para/block_termination_processor.py +0 -480
- magic_pdf/para/commons.py +0 -222
- magic_pdf/para/denoise.py +0 -246
- magic_pdf/para/draw.py +0 -121
- magic_pdf/para/exceptions.py +0 -198
- magic_pdf/para/layout_match_processor.py +0 -40
- magic_pdf/para/para_split.py +0 -807
- magic_pdf/para/para_split_v2.py +0 -959
- magic_pdf/para/raw_processor.py +0 -207
- magic_pdf/para/stats.py +0 -268
- magic_pdf/para/title_processor.py +0 -1014
- magic_pdf/pdf_parse_union_core.py +0 -345
- magic_pdf/post_proc/__init__.py +0 -0
- magic_pdf/post_proc/detect_para.py +0 -3472
- magic_pdf/post_proc/pdf_post_filter.py +0 -60
- magic_pdf/post_proc/remove_footnote.py +0 -153
- magic_pdf/pre_proc/citationmarker_remove.py +0 -161
- magic_pdf/pre_proc/detect_equation.py +0 -134
- magic_pdf/pre_proc/detect_footer_by_model.py +0 -64
- magic_pdf/pre_proc/detect_footer_header_by_statistics.py +0 -284
- magic_pdf/pre_proc/detect_footnote.py +0 -170
- magic_pdf/pre_proc/detect_header.py +0 -64
- magic_pdf/pre_proc/detect_images.py +0 -647
- magic_pdf/pre_proc/detect_page_number.py +0 -64
- magic_pdf/pre_proc/detect_tables.py +0 -62
- magic_pdf/pre_proc/equations_replace.py +0 -550
- magic_pdf/pre_proc/fix_image.py +0 -244
- magic_pdf/pre_proc/fix_table.py +0 -270
- magic_pdf/pre_proc/main_text_font.py +0 -23
- magic_pdf/pre_proc/ocr_detect_layout.py +0 -133
- magic_pdf/pre_proc/pdf_pre_filter.py +0 -78
- magic_pdf/pre_proc/post_layout_split.py +0 -0
- magic_pdf/pre_proc/remove_colored_strip_bbox.py +0 -101
- magic_pdf/pre_proc/remove_footer_header.py +0 -114
- magic_pdf/pre_proc/remove_rotate_bbox.py +0 -236
- magic_pdf/pre_proc/resolve_bbox_conflict.py +0 -184
- magic_pdf/pre_proc/solve_line_alien.py +0 -29
- magic_pdf/pre_proc/statistics.py +0 -12
- {magic_pdf-0.10.0.dist-info → magic_pdf-0.10.2.dist-info}/LICENSE.md +0 -0
- {magic_pdf-0.10.0.dist-info → magic_pdf-0.10.2.dist-info}/entry_points.txt +0 -0
- {magic_pdf-0.10.0.dist-info → magic_pdf-0.10.2.dist-info}/top_level.txt +0 -0
magic_pdf/para/para_split.py
DELETED
@@ -1,807 +0,0 @@
|
|
1
|
-
import numpy as np
|
2
|
-
from loguru import logger
|
3
|
-
from sklearn.cluster import DBSCAN
|
4
|
-
|
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
|
-
|
9
|
-
LINE_STOP_FLAG = ['.', '!', '?', '。', '!', '?', ':', ':', ')', ')', ';']
|
10
|
-
INLINE_EQUATION = ContentType.InlineEquation
|
11
|
-
INTERLINE_EQUATION = ContentType.InterlineEquation
|
12
|
-
TEXT = ContentType.Text
|
13
|
-
|
14
|
-
|
15
|
-
def __get_span_text(span):
|
16
|
-
c = span.get('content', '')
|
17
|
-
if len(c) == 0:
|
18
|
-
c = span.get('image_path', '')
|
19
|
-
|
20
|
-
return c
|
21
|
-
|
22
|
-
|
23
|
-
def __detect_list_lines(lines, new_layout_bboxes, lang):
|
24
|
-
"""探测是否包含了列表,并且把列表的行分开.
|
25
|
-
|
26
|
-
这样的段落特点是,顶格字母大写/数字,紧跟着几行缩进的。缩进的行首字母含小写的。
|
27
|
-
"""
|
28
|
-
|
29
|
-
def find_repeating_patterns(lst):
|
30
|
-
indices = []
|
31
|
-
ones_indices = []
|
32
|
-
i = 0
|
33
|
-
while i < len(lst) - 1: # 确保余下元素至少有2个
|
34
|
-
if lst[i] == 1 and lst[i + 1] in [2, 3]: # 额外检查以防止连续出现的1
|
35
|
-
start = i
|
36
|
-
ones_in_this_interval = [i]
|
37
|
-
i += 1
|
38
|
-
while i < len(lst) and lst[i] in [2, 3]:
|
39
|
-
i += 1
|
40
|
-
# 验证下一个序列是否符合条件
|
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
|
-
):
|
47
|
-
while i < len(lst) and lst[i] in [1, 2, 3]:
|
48
|
-
if lst[i] == 1:
|
49
|
-
ones_in_this_interval.append(i)
|
50
|
-
i += 1
|
51
|
-
indices.append((start, i - 1))
|
52
|
-
ones_indices.append(ones_in_this_interval)
|
53
|
-
else:
|
54
|
-
i += 1
|
55
|
-
else:
|
56
|
-
i += 1
|
57
|
-
return indices, ones_indices
|
58
|
-
|
59
|
-
"""===================="""
|
60
|
-
|
61
|
-
def split_indices(slen, index_array):
|
62
|
-
result = []
|
63
|
-
last_end = 0
|
64
|
-
|
65
|
-
for start, end in sorted(index_array):
|
66
|
-
if start > last_end:
|
67
|
-
# 前一个区间结束到下一个区间开始之间的部分标记为"text"
|
68
|
-
result.append(('text', last_end, start - 1))
|
69
|
-
# 区间内标记为"list"
|
70
|
-
result.append(('list', start, end))
|
71
|
-
last_end = end + 1
|
72
|
-
|
73
|
-
if last_end < slen:
|
74
|
-
# 如果最后一个区间结束后还有剩余的字符串,将其标记为"text"
|
75
|
-
result.append(('text', last_end, slen - 1))
|
76
|
-
|
77
|
-
return result
|
78
|
-
|
79
|
-
"""===================="""
|
80
|
-
|
81
|
-
if lang != 'en':
|
82
|
-
return lines, None
|
83
|
-
else:
|
84
|
-
total_lines = len(lines)
|
85
|
-
line_fea_encode = []
|
86
|
-
"""
|
87
|
-
对每一行进行特征编码,编码规则如下:
|
88
|
-
1. 如果行顶格,且大写字母开头或者数字开头,编码为1
|
89
|
-
2. 如果顶格,其他非大写开头编码为4
|
90
|
-
3. 如果非顶格,首字符大写,编码为2
|
91
|
-
4. 如果非顶格,首字符非大写编码为3
|
92
|
-
"""
|
93
|
-
for l in lines: # noqa: E741
|
94
|
-
first_char = __get_span_text(l['spans'][0])[0]
|
95
|
-
layout_left = __find_layout_bbox_by_line(l['bbox'], new_layout_bboxes)[0]
|
96
|
-
if l['bbox'][0] == layout_left:
|
97
|
-
if first_char.isupper() or first_char.isdigit():
|
98
|
-
line_fea_encode.append(1)
|
99
|
-
else:
|
100
|
-
line_fea_encode.append(4)
|
101
|
-
else:
|
102
|
-
if first_char.isupper():
|
103
|
-
line_fea_encode.append(2)
|
104
|
-
else:
|
105
|
-
line_fea_encode.append(3)
|
106
|
-
|
107
|
-
# 然后根据编码进行分段, 选出来 1,2,3连续出现至少2次的行,认为是列表。
|
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
|
-
|
113
|
-
# TODO check一下这个特列表里缩进的行左侧是不是对齐的。
|
114
|
-
|
115
|
-
for start, end in list_indice:
|
116
|
-
for i in range(start, end + 1):
|
117
|
-
if i > 0:
|
118
|
-
if line_fea_encode[i] == 4:
|
119
|
-
logger.info(f'列表行的第{i}行不是顶格的')
|
120
|
-
break
|
121
|
-
else:
|
122
|
-
logger.info(f'列表行的第{start}到第{end}行是列表')
|
123
|
-
|
124
|
-
return split_indices(total_lines, list_indice), list_start_idx
|
125
|
-
|
126
|
-
|
127
|
-
def __valign_lines(blocks, layout_bboxes):
|
128
|
-
"""在一个layoutbox内对齐行的左侧和右侧。 扫描行的左侧和右侧,如果x0,
|
129
|
-
x1差距不超过一个阈值,就强行对齐到所处layout的左右两侧(和layout有一段距离)。
|
130
|
-
3是个经验值,TODO,计算得来,可以设置为1.5个正文字符。"""
|
131
|
-
|
132
|
-
min_distance = 3
|
133
|
-
min_sample = 2
|
134
|
-
new_layout_bboxes = []
|
135
|
-
|
136
|
-
for layout_box in layout_bboxes:
|
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:
|
141
|
-
continue
|
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
|
-
)
|
157
|
-
x0_clusters = DBSCAN(eps=min_distance, min_samples=min_sample).fit(x0_lst)
|
158
|
-
x1_clusters = DBSCAN(eps=min_distance, min_samples=min_sample).fit(x1_lst)
|
159
|
-
x0_uniq_label = np.unique(x0_clusters.labels_)
|
160
|
-
x1_uniq_label = np.unique(x1_clusters.labels_)
|
161
|
-
|
162
|
-
x0_2_new_val = {} # 存储旧值对应的新值映射
|
163
|
-
x1_2_new_val = {}
|
164
|
-
for label in x0_uniq_label:
|
165
|
-
if label == -1:
|
166
|
-
continue
|
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])
|
170
|
-
x0_2_new_val.update({idx: x0_new_val for idx in x0_raw_val})
|
171
|
-
for label in x1_uniq_label:
|
172
|
-
if label == -1:
|
173
|
-
continue
|
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])
|
177
|
-
x1_2_new_val.update({idx: x1_new_val for idx in x1_raw_val})
|
178
|
-
|
179
|
-
for block in blocks_in_layoutbox:
|
180
|
-
for line in block['lines']:
|
181
|
-
x0, x1 = line['bbox'][0], line['bbox'][2]
|
182
|
-
if x0 in x0_2_new_val:
|
183
|
-
line['bbox'][0] = int(x0_2_new_val[x0])
|
184
|
-
|
185
|
-
if x1 in x1_2_new_val:
|
186
|
-
line['bbox'][2] = int(x1_2_new_val[x1])
|
187
|
-
# 其余对不齐的保持不动
|
188
|
-
|
189
|
-
# 由于修改了block里的line长度,现在需要重新计算block的bbox
|
190
|
-
for block in blocks_in_layoutbox:
|
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
|
-
|
198
|
-
"""新计算layout的bbox,因为block的bbox变了。"""
|
199
|
-
layout_x0 = min([block['bbox'][0] for block in blocks_in_layoutbox])
|
200
|
-
layout_y0 = min([block['bbox'][1] for block in blocks_in_layoutbox])
|
201
|
-
layout_x1 = max([block['bbox'][2] for block in blocks_in_layoutbox])
|
202
|
-
layout_y1 = max([block['bbox'][3] for block in blocks_in_layoutbox])
|
203
|
-
new_layout_bboxes.append([layout_x0, layout_y0, layout_x1, layout_y1])
|
204
|
-
|
205
|
-
return new_layout_bboxes
|
206
|
-
|
207
|
-
|
208
|
-
def __align_text_in_layout(blocks, layout_bboxes):
|
209
|
-
"""由于ocr出来的line,有时候会在前后有一段空白,这个时候需要对文本进行对齐,超出的部分被layout左右侧截断。"""
|
210
|
-
for layout in layout_bboxes:
|
211
|
-
lb = layout['layout_bbox']
|
212
|
-
blocks_in_layoutbox = [b for b in blocks if is_in_layout(b['bbox'], lb)]
|
213
|
-
if len(blocks_in_layoutbox) == 0:
|
214
|
-
continue
|
215
|
-
|
216
|
-
for block in blocks_in_layoutbox:
|
217
|
-
for line in block['lines']:
|
218
|
-
x0, x1 = line['bbox'][0], line['bbox'][2]
|
219
|
-
if x0 < lb[0]:
|
220
|
-
line['bbox'][0] = lb[0]
|
221
|
-
if x1 > lb[2]:
|
222
|
-
line['bbox'][2] = lb[2]
|
223
|
-
|
224
|
-
|
225
|
-
def __common_pre_proc(blocks, layout_bboxes):
|
226
|
-
"""不分语言的,对文本进行预处理."""
|
227
|
-
# __add_line_period(blocks, layout_bboxes)
|
228
|
-
__align_text_in_layout(blocks, layout_bboxes)
|
229
|
-
aligned_layout_bboxes = __valign_lines(blocks, layout_bboxes)
|
230
|
-
|
231
|
-
return aligned_layout_bboxes
|
232
|
-
|
233
|
-
|
234
|
-
def __pre_proc_zh_blocks(blocks, layout_bboxes):
|
235
|
-
"""对中文文本进行分段预处理."""
|
236
|
-
pass
|
237
|
-
|
238
|
-
|
239
|
-
def __pre_proc_en_blocks(blocks, layout_bboxes):
|
240
|
-
"""对英文文本进行分段预处理."""
|
241
|
-
pass
|
242
|
-
|
243
|
-
|
244
|
-
def __group_line_by_layout(blocks, layout_bboxes, lang='en'):
|
245
|
-
"""每个layout内的行进行聚合."""
|
246
|
-
# 因为只是一个block一行目前, 一个block就是一个段落
|
247
|
-
lines_group = []
|
248
|
-
|
249
|
-
for lyout in layout_bboxes:
|
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
|
-
]
|
256
|
-
lines_group.append(lines)
|
257
|
-
|
258
|
-
return lines_group
|
259
|
-
|
260
|
-
|
261
|
-
def __split_para_in_layoutbox(lines_group, new_layout_bbox, lang='en', char_avg_len=10):
|
262
|
-
"""
|
263
|
-
lines_group 进行行分段——layout内部进行分段。lines_group内每个元素是一个Layoutbox内的所有行。
|
264
|
-
1. 先计算每个group的左右边界。
|
265
|
-
2. 然后根据行末尾特征进行分段。
|
266
|
-
末尾特征:以句号等结束符结尾。并且距离右侧边界有一定距离。
|
267
|
-
且下一行开头不留空白。
|
268
|
-
|
269
|
-
"""
|
270
|
-
list_info = [] # 这个layout最后是不是列表,记录每一个layout里是不是列表开头,列表结尾
|
271
|
-
layout_paras = []
|
272
|
-
right_tail_distance = 1.5 * char_avg_len
|
273
|
-
|
274
|
-
for lines in lines_group:
|
275
|
-
paras = []
|
276
|
-
total_lines = len(lines)
|
277
|
-
if total_lines == 0:
|
278
|
-
continue # 0行无需处理
|
279
|
-
if total_lines == 1: # 1行无法分段。
|
280
|
-
layout_paras.append([lines])
|
281
|
-
list_info.append([False, False])
|
282
|
-
continue
|
283
|
-
|
284
|
-
"""在进入到真正的分段之前,要对文字块从统计维度进行对齐方式的探测,
|
285
|
-
对齐方式分为以下:
|
286
|
-
1. 左对齐的文本块(特点是左侧顶格,或者左侧不顶格但是右侧顶格的行数大于非顶格的行数,顶格的首字母有大写也有小写)
|
287
|
-
1) 右侧对齐的行,单独成一段
|
288
|
-
2) 中间对齐的行,按照字体/行高聚合成一段
|
289
|
-
2. 左对齐的列表块(其特点是左侧顶格的行数小于等于非顶格的行数,非定格首字母会有小写,顶格90%是大写。并且左侧顶格行数大于1,大于1是为了这种模式连续出现才能称之为列表)
|
290
|
-
这样的文本块,顶格的为一个段落开头,紧随其后非顶格的行属于这个段落。
|
291
|
-
"""
|
292
|
-
|
293
|
-
text_segments, list_start_line = __detect_list_lines(
|
294
|
-
lines, new_layout_bbox, lang
|
295
|
-
)
|
296
|
-
"""根据list_range,把lines分成几个部分
|
297
|
-
|
298
|
-
"""
|
299
|
-
|
300
|
-
layout_right = __find_layout_bbox_by_line(lines[0]['bbox'], new_layout_bbox)[2]
|
301
|
-
layout_left = __find_layout_bbox_by_line(lines[0]['bbox'], new_layout_bbox)[0]
|
302
|
-
para = [] # 元素是line
|
303
|
-
layout_list_info = [
|
304
|
-
False,
|
305
|
-
False,
|
306
|
-
] # 这个layout最后是不是列表,记录每一个layout里是不是列表开头,列表结尾
|
307
|
-
for content_type, start, end in text_segments:
|
308
|
-
if content_type == 'list':
|
309
|
-
for i, line in enumerate(lines[start : end + 1]):
|
310
|
-
line_x0 = line['bbox'][0]
|
311
|
-
if line_x0 == layout_left: # 列表开头
|
312
|
-
if len(para) > 0:
|
313
|
-
paras.append(para)
|
314
|
-
para = []
|
315
|
-
para.append(line)
|
316
|
-
else:
|
317
|
-
para.append(line)
|
318
|
-
if len(para) > 0:
|
319
|
-
paras.append(para)
|
320
|
-
para = []
|
321
|
-
if start == 0:
|
322
|
-
layout_list_info[0] = True
|
323
|
-
if end == total_lines - 1:
|
324
|
-
layout_list_info[1] = True
|
325
|
-
else: # 是普通文本
|
326
|
-
for i, line in enumerate(lines[start : end + 1]):
|
327
|
-
# 如果i有下一行,那么就要根据下一行位置综合判断是否要分段。如果i之后没有行,那么只需要判断i行自己的结尾特征。
|
328
|
-
cur_line_type = line['spans'][-1]['type']
|
329
|
-
next_line = lines[i + 1] if i < total_lines - 1 else None
|
330
|
-
|
331
|
-
if cur_line_type in [TEXT, INLINE_EQUATION]:
|
332
|
-
if line['bbox'][2] < layout_right - right_tail_distance:
|
333
|
-
para.append(line)
|
334
|
-
paras.append(para)
|
335
|
-
para = []
|
336
|
-
elif (
|
337
|
-
line['bbox'][2] >= layout_right - right_tail_distance
|
338
|
-
and next_line
|
339
|
-
and next_line['bbox'][0] == layout_left
|
340
|
-
): # 现在这行到了行尾沾满,下一行存在且顶格。
|
341
|
-
para.append(line)
|
342
|
-
else:
|
343
|
-
para.append(line)
|
344
|
-
paras.append(para)
|
345
|
-
para = []
|
346
|
-
else: # 其他,图片、表格、行间公式,各自占一段
|
347
|
-
if len(para) > 0: # 先把之前的段落加入到结果中
|
348
|
-
paras.append(para)
|
349
|
-
para = []
|
350
|
-
paras.append(
|
351
|
-
[line]
|
352
|
-
) # 再把当前行加入到结果中。当前行为行间公式、图、表等。
|
353
|
-
para = []
|
354
|
-
|
355
|
-
if len(para) > 0:
|
356
|
-
paras.append(para)
|
357
|
-
para = []
|
358
|
-
|
359
|
-
list_info.append(layout_list_info)
|
360
|
-
layout_paras.append(paras)
|
361
|
-
paras = []
|
362
|
-
|
363
|
-
return layout_paras, list_info
|
364
|
-
|
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 会出错
|
375
|
-
return layout_paras, [False, False]
|
376
|
-
|
377
|
-
for i in range(1, len(layout_paras)):
|
378
|
-
pre_layout_list_info = layout_list_info[i - 1]
|
379
|
-
next_layout_list_info = layout_list_info[i]
|
380
|
-
pre_last_para = layout_paras[i - 1][-1]
|
381
|
-
next_paras = layout_paras[i]
|
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')
|
387
|
-
# 向layout_paras[i] 寻找开头具有相同缩进的连续的行
|
388
|
-
may_list_lines = []
|
389
|
-
for j in range(len(next_paras)):
|
390
|
-
line = next_paras[j]
|
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
|
-
):
|
398
|
-
may_list_lines.append(line[0])
|
399
|
-
else:
|
400
|
-
break
|
401
|
-
else:
|
402
|
-
break
|
403
|
-
# 如果这些行的缩进是相等的,那么连到上一个layout的最后一个段落上。
|
404
|
-
if (
|
405
|
-
len(may_list_lines) > 0
|
406
|
-
and len(set([x['bbox'][0] for x in may_list_lines])) == 1
|
407
|
-
):
|
408
|
-
pre_last_para.extend(may_list_lines)
|
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 会出错
|
433
|
-
return False
|
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')
|
439
|
-
# 向layout_paras[i] 寻找开头具有相同缩进的连续的行
|
440
|
-
may_list_lines = []
|
441
|
-
for j in range(len(next_page_paras[0])):
|
442
|
-
line = next_page_paras[0][j]
|
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
|
-
):
|
450
|
-
may_list_lines.append(line[0])
|
451
|
-
else:
|
452
|
-
break
|
453
|
-
else:
|
454
|
-
break
|
455
|
-
# 如果这些行的缩进是相等的,那么连到上一个layout的最后一个段落上。
|
456
|
-
if (
|
457
|
-
len(may_list_lines) > 0
|
458
|
-
and len(set([x['bbox'][0] for x in may_list_lines])) == 1
|
459
|
-
):
|
460
|
-
pre_page_paras[-1].append(may_list_lines)
|
461
|
-
next_page_paras[0] = next_page_paras[0][len(may_list_lines) :]
|
462
|
-
return True
|
463
|
-
|
464
|
-
return False
|
465
|
-
|
466
|
-
|
467
|
-
def __find_layout_bbox_by_line(line_bbox, layout_bboxes):
|
468
|
-
"""根据line找到所在的layout."""
|
469
|
-
for layout in layout_bboxes:
|
470
|
-
if is_in_layout(line_bbox, layout):
|
471
|
-
return layout
|
472
|
-
return None
|
473
|
-
|
474
|
-
|
475
|
-
def __connect_para_inter_layoutbox(layout_paras, new_layout_bbox, lang):
|
476
|
-
"""
|
477
|
-
layout之间进行分段。
|
478
|
-
主要是计算前一个layOut的最后一行和后一个layout的第一行是否可以连接。
|
479
|
-
连接的条件需要同时满足:
|
480
|
-
1. 上一个layout的最后一行沾满整个行。并且没有结尾符号。
|
481
|
-
2. 下一行开头不留空白。
|
482
|
-
|
483
|
-
"""
|
484
|
-
connected_layout_paras = []
|
485
|
-
if len(layout_paras) == 0:
|
486
|
-
return connected_layout_paras
|
487
|
-
|
488
|
-
connected_layout_paras.append(layout_paras[0])
|
489
|
-
for i in range(1, len(layout_paras)):
|
490
|
-
try:
|
491
|
-
if (
|
492
|
-
len(layout_paras[i]) == 0 or len(layout_paras[i - 1]) == 0
|
493
|
-
): # TODO 考虑连接问题,
|
494
|
-
continue
|
495
|
-
pre_last_line = layout_paras[i - 1][-1][-1]
|
496
|
-
next_first_line = layout_paras[i][0][0]
|
497
|
-
except Exception:
|
498
|
-
logger.error(f'page layout {i} has no line')
|
499
|
-
continue
|
500
|
-
pre_last_line_text = ''.join(
|
501
|
-
[__get_span_text(span) for span in pre_last_line['spans']]
|
502
|
-
)
|
503
|
-
pre_last_line_type = pre_last_line['spans'][-1]['type']
|
504
|
-
next_first_line_text = ''.join(
|
505
|
-
[__get_span_text(span) for span in next_first_line['spans']]
|
506
|
-
)
|
507
|
-
next_first_line_type = next_first_line['spans'][0]['type']
|
508
|
-
if pre_last_line_type not in [
|
509
|
-
TEXT,
|
510
|
-
INLINE_EQUATION,
|
511
|
-
] or next_first_line_type not in [TEXT, INLINE_EQUATION]:
|
512
|
-
connected_layout_paras.append(layout_paras[i])
|
513
|
-
continue
|
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
|
-
|
522
|
-
pre_last_line_text = pre_last_line_text.strip()
|
523
|
-
next_first_line_text = next_first_line_text.strip()
|
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
|
-
): # 前面一行沾满了整个行,并且没有结尾符号.下一行没有空白开头。
|
529
|
-
"""连接段落条件成立,将前一个layout的段落和后一个layout的段落连接。"""
|
530
|
-
connected_layout_paras[-1][-1].extend(layout_paras[i][0])
|
531
|
-
layout_paras[i].pop(
|
532
|
-
0
|
533
|
-
) # 删除后一个layout的第一个段落, 因为他已经被合并到前一个layout的最后一个段落了。
|
534
|
-
if len(layout_paras[i]) == 0:
|
535
|
-
layout_paras.pop(i)
|
536
|
-
else:
|
537
|
-
connected_layout_paras.append(layout_paras[i])
|
538
|
-
else:
|
539
|
-
"""连接段落条件不成立,将前一个layout的段落加入到结果中。"""
|
540
|
-
connected_layout_paras.append(layout_paras[i])
|
541
|
-
|
542
|
-
return connected_layout_paras
|
543
|
-
|
544
|
-
|
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
|
-
):
|
553
|
-
"""
|
554
|
-
连接起来相邻两个页面的段落——前一个页面最后一个段落和后一个页面的第一个段落。
|
555
|
-
是否可以连接的条件:
|
556
|
-
1. 前一个页面的最后一个段落最后一行沾满整个行。并且没有结尾符号。
|
557
|
-
2. 后一个页面的第一个段落第一行没有空白开头。
|
558
|
-
"""
|
559
|
-
# 有的页面可能压根没有文字
|
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里?
|
566
|
-
return False
|
567
|
-
pre_last_para = pre_page_paras[-1][-1]
|
568
|
-
next_first_para = next_page_paras[0][0]
|
569
|
-
pre_last_line = pre_last_para[-1]
|
570
|
-
next_first_line = next_first_para[0]
|
571
|
-
pre_last_line_text = ''.join(
|
572
|
-
[__get_span_text(span) for span in pre_last_line['spans']]
|
573
|
-
)
|
574
|
-
pre_last_line_type = pre_last_line['spans'][-1]['type']
|
575
|
-
next_first_line_text = ''.join(
|
576
|
-
[__get_span_text(span) for span in next_first_line['spans']]
|
577
|
-
)
|
578
|
-
next_first_line_type = next_first_line['spans'][0]['type']
|
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, 行间的情况
|
587
|
-
# 不是文本,不连接
|
588
|
-
return False
|
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
|
-
|
597
|
-
pre_last_line_text = pre_last_line_text.strip()
|
598
|
-
next_first_line_text = next_first_line_text.strip()
|
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
|
-
): # 前面一行沾满了整个行,并且没有结尾符号.下一行没有空白开头。
|
604
|
-
"""连接段落条件成立,将前一个layout的段落和后一个layout的段落连接。"""
|
605
|
-
pre_last_para.extend(next_first_para)
|
606
|
-
next_page_paras[0].pop(
|
607
|
-
0
|
608
|
-
) # 删除后一个页面的第一个段落, 因为他已经被合并到前一个页面的最后一个段落了。
|
609
|
-
return True
|
610
|
-
else:
|
611
|
-
return False
|
612
|
-
|
613
|
-
|
614
|
-
def find_consecutive_true_regions(input_array):
|
615
|
-
start_index = None # 连续True区域的起始索引
|
616
|
-
regions = [] # 用于保存所有连续True区域的起始和结束索引
|
617
|
-
|
618
|
-
for i in range(len(input_array)):
|
619
|
-
# 如果我们找到了一个True值,并且当前并没有在连续True区域中
|
620
|
-
if input_array[i] and start_index is None:
|
621
|
-
start_index = i # 记录连续True区域的起始索引
|
622
|
-
|
623
|
-
# 如果我们找到了一个False值,并且当前在连续True区域中
|
624
|
-
elif not input_array[i] and start_index is not None:
|
625
|
-
# 如果连续True区域长度大于1,那么将其添加到结果列表中
|
626
|
-
if i - start_index > 1:
|
627
|
-
regions.append((start_index, i - 1))
|
628
|
-
start_index = None # 重置起始索引
|
629
|
-
|
630
|
-
# 如果最后一个元素是True,那么需要将最后一个连续True区域加入到结果列表中
|
631
|
-
if start_index is not None and len(input_array) - start_index > 1:
|
632
|
-
regions.append((start_index, len(input_array) - 1))
|
633
|
-
|
634
|
-
return regions
|
635
|
-
|
636
|
-
|
637
|
-
def __connect_middle_align_text(
|
638
|
-
page_paras, new_layout_bbox, page_num, lang, debug_mode
|
639
|
-
):
|
640
|
-
"""
|
641
|
-
找出来中间对齐的连续单行文本,如果连续行高度相同,那么合并为一个段落。
|
642
|
-
一个line居中的条件是:
|
643
|
-
1. 水平中心点跨越layout的中心点。
|
644
|
-
2. 左右两侧都有空白
|
645
|
-
"""
|
646
|
-
|
647
|
-
for layout_i, layout_para in enumerate(page_paras):
|
648
|
-
layout_box = new_layout_bbox[layout_i]
|
649
|
-
single_line_paras_tag = []
|
650
|
-
for i in range(len(layout_para)):
|
651
|
-
single_line_paras_tag.append(
|
652
|
-
len(layout_para[i]) == 1
|
653
|
-
and layout_para[i][0]['spans'][0]['type'] == TEXT
|
654
|
-
)
|
655
|
-
|
656
|
-
"""找出来连续的单行文本,如果连续行高度相同,那么合并为一个段落。"""
|
657
|
-
consecutive_single_line_indices = find_consecutive_true_regions(
|
658
|
-
single_line_paras_tag
|
659
|
-
)
|
660
|
-
if len(consecutive_single_line_indices) > 0:
|
661
|
-
index_offset = 0
|
662
|
-
"""检查这些行是否是高度相同的,居中的"""
|
663
|
-
for start, end in consecutive_single_line_indices:
|
664
|
-
start += index_offset
|
665
|
-
end += index_offset
|
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:
|
676
|
-
pass
|
677
|
-
if debug_mode:
|
678
|
-
logger.debug(line_hi.std())
|
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
|
-
]
|
688
|
-
layout_center = (layout_box[0] + layout_box[2]) / 2
|
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
|
-
)
|
707
|
-
if debug_mode:
|
708
|
-
logger.debug(para_text)
|
709
|
-
layout_para[start : end + 1] = [merge_para]
|
710
|
-
index_offset -= end - start
|
711
|
-
|
712
|
-
return
|
713
|
-
|
714
|
-
|
715
|
-
def __merge_signle_list_text(page_paras, new_layout_bbox, page_num, lang):
|
716
|
-
"""找出来连续的单行文本,如果首行顶格,接下来的几个单行段落缩进对齐,那么合并为一个段落。"""
|
717
|
-
|
718
|
-
pass
|
719
|
-
|
720
|
-
|
721
|
-
def __do_split_page(blocks, layout_bboxes, new_layout_bbox, page_num, lang):
|
722
|
-
"""根据line和layout情况进行分段 先实现一个根据行末尾特征分段的简单方法。"""
|
723
|
-
"""
|
724
|
-
算法思路:
|
725
|
-
1. 扫描layout里每一行,找出来行尾距离layout有边界有一定距离的行。
|
726
|
-
2. 从上述行中找到末尾是句号等可作为断行标志的行。
|
727
|
-
3. 参照上述行尾特征进行分段。
|
728
|
-
4. 图、表,目前独占一行,不考虑分段。
|
729
|
-
"""
|
730
|
-
if page_num == 343:
|
731
|
-
pass
|
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
|
-
|
743
|
-
return connected_layout_paras, 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 = [] # 保存每个页面开头和结尾是否是列表
|
750
|
-
for page_num, page in pdf_info_dict.items():
|
751
|
-
blocks = page['preproc_blocks']
|
752
|
-
layout_bboxes = page['layout_bboxes']
|
753
|
-
new_layout_bbox = __common_pre_proc(blocks, layout_bboxes)
|
754
|
-
new_layout_of_pages.append(new_layout_bbox)
|
755
|
-
splited_blocks, page_list_info = __do_split_page(
|
756
|
-
blocks, layout_bboxes, new_layout_bbox, page_num, lang
|
757
|
-
)
|
758
|
-
all_page_list_info.append(page_list_info)
|
759
|
-
page['para_blocks'] = splited_blocks
|
760
|
-
|
761
|
-
"""连接页面与页面之间的可能合并的段落"""
|
762
|
-
pdf_infos = list(pdf_info_dict.values())
|
763
|
-
for page_num, page in enumerate(pdf_info_dict.values()):
|
764
|
-
if page_num == 0:
|
765
|
-
continue
|
766
|
-
pre_page_paras = pdf_infos[page_num - 1]['para_blocks']
|
767
|
-
next_page_paras = pdf_infos[page_num]['para_blocks']
|
768
|
-
pre_page_layout_bbox = new_layout_of_pages[page_num - 1]
|
769
|
-
next_page_layout_bbox = new_layout_of_pages[page_num]
|
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
|
-
)
|
779
|
-
if debug_mode:
|
780
|
-
if is_conn:
|
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
|
-
)
|
793
|
-
if debug_mode:
|
794
|
-
if is_list_conn:
|
795
|
-
logger.info(f'连接了第{page_num-1}页和第{page_num}页的列表段落')
|
796
|
-
|
797
|
-
"""接下来可能会漏掉一些特别的一些可以合并的内容,对他们进行段落连接
|
798
|
-
1. 正文中有时出现一个行顶格,接下来几行缩进的情况。
|
799
|
-
2. 居中的一些连续单行,如果高度相同,那么可能是一个段落。
|
800
|
-
"""
|
801
|
-
for page_num, page in enumerate(pdf_info_dict.values()):
|
802
|
-
page_paras = page['para_blocks']
|
803
|
-
new_layout_bbox = new_layout_of_pages[page_num]
|
804
|
-
__connect_middle_align_text(
|
805
|
-
page_paras, new_layout_bbox, page_num, lang, debug_mode=debug_mode
|
806
|
-
)
|
807
|
-
__merge_signle_list_text(page_paras, new_layout_bbox, page_num, lang)
|