para_split_v2.py 35 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737
  1. from sklearn.cluster import DBSCAN
  2. import numpy as np
  3. from loguru import logger
  4. from magic_pdf.libs.boxbase import _is_in_or_part_overlap_with_area_ratio as is_in_layout
  5. from magic_pdf.libs.ocr_content_type import ContentType, BlockType
  6. from magic_pdf.model.magic_model import MagicModel
  7. LINE_STOP_FLAG = ['.', '!', '?', '。', '!', '?', ":", ":", ")", ")", ";"]
  8. INLINE_EQUATION = ContentType.InlineEquation
  9. INTERLINE_EQUATION = ContentType.InterlineEquation
  10. TEXT = ContentType.Text
  11. def __get_span_text(span):
  12. c = span.get('content', '')
  13. if len(c) == 0:
  14. c = span.get('image_path', '')
  15. return c
  16. def __detect_list_lines(lines, new_layout_bboxes, lang):
  17. """
  18. 探测是否包含了列表,并且把列表的行分开.
  19. 这样的段落特点是,顶格字母大写/数字,紧跟着几行缩进的。缩进的行首字母含小写的。
  20. """
  21. def find_repeating_patterns2(lst):
  22. indices = []
  23. ones_indices = []
  24. i = 0
  25. while i < len(lst): # Loop through the entire list
  26. if lst[i] == 1: # If we encounter a '1', we might be at the start of a pattern
  27. start = i
  28. ones_in_this_interval = [i]
  29. i += 1
  30. # Traverse elements that are 1, 2 or 3, until we encounter something else
  31. while i < len(lst) and lst[i] in [1, 2, 3]:
  32. if lst[i] == 1:
  33. ones_in_this_interval.append(i)
  34. i += 1
  35. if len(ones_in_this_interval) > 1 or (start < len(lst) - 1 and ones_in_this_interval and lst[start + 1] in [2, 3]):
  36. indices.append((start, i - 1))
  37. ones_indices.append(ones_in_this_interval)
  38. else:
  39. i += 1
  40. return indices, ones_indices
  41. def find_repeating_patterns(lst):
  42. indices = []
  43. ones_indices = []
  44. i = 0
  45. while i < len(lst) - 1: # 确保余下元素至少有2个
  46. if lst[i] == 1 and lst[i + 1] in [2, 3]: # 额外检查以防止连续出现的1
  47. start = i
  48. ones_in_this_interval = [i]
  49. i += 1
  50. while i < len(lst) and lst[i] in [2, 3]:
  51. i += 1
  52. # 验证下一个序列是否符合条件
  53. if i < len(lst) - 1 and lst[i] == 1 and lst[i + 1] in [2, 3] and lst[i - 1] in [2, 3]:
  54. while i < len(lst) and lst[i] in [1, 2, 3]:
  55. if lst[i] == 1:
  56. ones_in_this_interval.append(i)
  57. i += 1
  58. indices.append((start, i - 1))
  59. ones_indices.append(ones_in_this_interval)
  60. else:
  61. i += 1
  62. else:
  63. i += 1
  64. return indices, ones_indices
  65. """===================="""
  66. def split_indices(slen, index_array):
  67. result = []
  68. last_end = 0
  69. for start, end in sorted(index_array):
  70. if start > last_end:
  71. # 前一个区间结束到下一个区间开始之间的部分标记为"text"
  72. result.append(('text', last_end, start - 1))
  73. # 区间内标记为"list"
  74. result.append(('list', start, end))
  75. last_end = end + 1
  76. if last_end < slen:
  77. # 如果最后一个区间结束后还有剩余的字符串,将其标记为"text"
  78. result.append(('text', last_end, slen - 1))
  79. return result
  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:
  94. first_char = __get_span_text(l['spans'][0])[0]
  95. layout = __find_layout_bbox_by_line(l['bbox'], new_layout_bboxes)
  96. if not layout:
  97. line_fea_encode.append(0)
  98. else:
  99. layout_left = layout[0]
  100. if l['bbox'][0] == layout_left:
  101. if first_char.isupper() or first_char.isdigit() or not first_char.isalnum():
  102. line_fea_encode.append(1)
  103. else:
  104. line_fea_encode.append(4)
  105. else:
  106. if first_char.isupper():
  107. line_fea_encode.append(2)
  108. else:
  109. line_fea_encode.append(3)
  110. # 然后根据编码进行分段, 选出来 1,2,3连续出现至少2次的行,认为是列表。
  111. list_indice, list_start_idx = find_repeating_patterns2(line_fea_encode)
  112. if len(list_indice) > 0:
  113. logger.info(f"发现了列表,列表行数:{list_indice}, {list_start_idx}")
  114. # TODO check一下这个特列表里缩进的行左侧是不是对齐的。
  115. segments = []
  116. for start, end in list_indice:
  117. for i in range(start, end + 1):
  118. if i > 0:
  119. if line_fea_encode[i] == 4:
  120. logger.info(f"列表行的第{i}行不是顶格的")
  121. break
  122. else:
  123. logger.info(f"列表行的第{start}到第{end}行是列表")
  124. return split_indices(total_lines, list_indice), list_start_idx
  125. def __valign_lines(blocks, layout_bboxes):
  126. """
  127. 在一个layoutbox内对齐行的左侧和右侧。
  128. 扫描行的左侧和右侧,如果x0, x1差距不超过一个阈值,就强行对齐到所处layout的左右两侧(和layout有一段距离)。
  129. 3是个经验值,TODO,计算得来,可以设置为1.5个正文字符。
  130. """
  131. min_distance = 3
  132. min_sample = 2
  133. new_layout_bboxes = []
  134. for layout_box in layout_bboxes:
  135. blocks_in_layoutbox = [b for b in blocks if b["type"] == BlockType.Text and is_in_layout(b['bbox'], layout_box['layout_bbox'])]
  136. if len(blocks_in_layoutbox) == 0 or len(blocks_in_layoutbox[0]["lines"]) == 0:
  137. new_layout_bboxes.append(layout_box['layout_bbox'])
  138. continue
  139. x0_lst = np.array([[line['bbox'][0], 0] for block in blocks_in_layoutbox for line in block['lines']])
  140. x1_lst = np.array([[line['bbox'][2], 0] for block in blocks_in_layoutbox for line in block['lines']])
  141. x0_clusters = DBSCAN(eps=min_distance, min_samples=min_sample).fit(x0_lst)
  142. x1_clusters = DBSCAN(eps=min_distance, min_samples=min_sample).fit(x1_lst)
  143. x0_uniq_label = np.unique(x0_clusters.labels_)
  144. x1_uniq_label = np.unique(x1_clusters.labels_)
  145. x0_2_new_val = {} # 存储旧值对应的新值映射
  146. x1_2_new_val = {}
  147. for label in x0_uniq_label:
  148. if label == -1:
  149. continue
  150. x0_index_of_label = np.where(x0_clusters.labels_ == label)
  151. x0_raw_val = x0_lst[x0_index_of_label][:, 0]
  152. x0_new_val = np.min(x0_lst[x0_index_of_label][:, 0])
  153. x0_2_new_val.update({idx: x0_new_val for idx in x0_raw_val})
  154. for label in x1_uniq_label:
  155. if label == -1:
  156. continue
  157. x1_index_of_label = np.where(x1_clusters.labels_ == label)
  158. x1_raw_val = x1_lst[x1_index_of_label][:, 0]
  159. x1_new_val = np.max(x1_lst[x1_index_of_label][:, 0])
  160. x1_2_new_val.update({idx: x1_new_val for idx in x1_raw_val})
  161. for block in blocks_in_layoutbox:
  162. for line in block['lines']:
  163. x0, x1 = line['bbox'][0], line['bbox'][2]
  164. if x0 in x0_2_new_val:
  165. line['bbox'][0] = int(x0_2_new_val[x0])
  166. if x1 in x1_2_new_val:
  167. line['bbox'][2] = int(x1_2_new_val[x1])
  168. # 其余对不齐的保持不动
  169. # 由于修改了block里的line长度,现在需要重新计算block的bbox
  170. for block in blocks_in_layoutbox:
  171. if len(block["lines"]) > 0:
  172. block['bbox'] = [min([line['bbox'][0] for line in block['lines']]),
  173. min([line['bbox'][1] for line in block['lines']]),
  174. max([line['bbox'][2] for line in block['lines']]),
  175. max([line['bbox'][3] for line in block['lines']])]
  176. """新计算layout的bbox,因为block的bbox变了。"""
  177. layout_x0 = min([block['bbox'][0] for block in blocks_in_layoutbox])
  178. layout_y0 = min([block['bbox'][1] for block in blocks_in_layoutbox])
  179. layout_x1 = max([block['bbox'][2] for block in blocks_in_layoutbox])
  180. layout_y1 = max([block['bbox'][3] for block in blocks_in_layoutbox])
  181. new_layout_bboxes.append([layout_x0, layout_y0, layout_x1, layout_y1])
  182. return new_layout_bboxes
  183. def __align_text_in_layout(blocks, layout_bboxes):
  184. """
  185. 由于ocr出来的line,有时候会在前后有一段空白,这个时候需要对文本进行对齐,超出的部分被layout左右侧截断。
  186. """
  187. for layout in layout_bboxes:
  188. lb = layout['layout_bbox']
  189. blocks_in_layoutbox = [block for block in blocks if block["type"] == BlockType.Text and is_in_layout(block['bbox'], lb)]
  190. if len(blocks_in_layoutbox) == 0:
  191. continue
  192. for block in blocks_in_layoutbox:
  193. for line in block.get("lines", []):
  194. x0, x1 = line['bbox'][0], line['bbox'][2]
  195. if x0 < lb[0]:
  196. line['bbox'][0] = lb[0]
  197. if x1 > lb[2]:
  198. line['bbox'][2] = lb[2]
  199. def __common_pre_proc(blocks, layout_bboxes):
  200. """
  201. 不分语言的,对文本进行预处理
  202. """
  203. # __add_line_period(blocks, layout_bboxes)
  204. __align_text_in_layout(blocks, layout_bboxes)
  205. aligned_layout_bboxes = __valign_lines(blocks, layout_bboxes)
  206. return aligned_layout_bboxes
  207. def __pre_proc_zh_blocks(blocks, layout_bboxes):
  208. """
  209. 对中文文本进行分段预处理
  210. """
  211. pass
  212. def __pre_proc_en_blocks(blocks, layout_bboxes):
  213. """
  214. 对英文文本进行分段预处理
  215. """
  216. pass
  217. def __group_line_by_layout(blocks, layout_bboxes, lang="en"):
  218. """
  219. 每个layout内的行进行聚合
  220. """
  221. # 因为只是一个block一行目前, 一个block就是一个段落
  222. blocks_group = []
  223. for lyout in layout_bboxes:
  224. #lines = [line for block in blocks if block["type"] == BlockType.Text and is_in_layout(block['bbox'], lyout['layout_bbox']) for line in
  225. # block['lines']]
  226. blocks_in_layout = [block for block in blocks if is_in_layout(block['bbox'], lyout['layout_bbox'])]
  227. blocks_group.append(blocks_in_layout)
  228. return blocks_group
  229. def __split_para_in_layoutbox2(lines_group, new_layout_bbox, lang="en", char_avg_len=10):
  230. """
  231. """
  232. def __split_para_in_layoutbox(blocks_group, new_layout_bbox, lang="en", char_avg_len=10):
  233. """
  234. lines_group 进行行分段——layout内部进行分段。lines_group内每个元素是一个Layoutbox内的所有行。
  235. 1. 先计算每个group的左右边界。
  236. 2. 然后根据行末尾特征进行分段。
  237. 末尾特征:以句号等结束符结尾。并且距离右侧边界有一定距离。
  238. 且下一行开头不留空白。
  239. """
  240. list_info = [] # 这个layout最后是不是列表,记录每一个layout里是不是列表开头,列表结尾
  241. for blocks in blocks_group:
  242. is_start_list = None
  243. is_end_list = None
  244. if len(blocks) == 0:
  245. list_info.append([False, False])
  246. continue
  247. if blocks[0]["type"] != BlockType.Text and blocks[-1]["type"] != BlockType.Text:
  248. list_info.append([False, False])
  249. continue
  250. if blocks[0]["type"] != BlockType.Text:
  251. is_start_list = False
  252. if blocks[-1]["type"] != BlockType.Text:
  253. is_end_list = False
  254. lines = [line for block in blocks if
  255. block["type"] == BlockType.Text for line in
  256. block['lines']]
  257. total_lines = len(lines)
  258. if total_lines == 1:
  259. list_info.append([False, False])
  260. continue
  261. """在进入到真正的分段之前,要对文字块从统计维度进行对齐方式的探测,
  262. 对齐方式分为以下:
  263. 1. 左对齐的文本块(特点是左侧顶格,或者左侧不顶格但是右侧顶格的行数大于非顶格的行数,顶格的首字母有大写也有小写)
  264. 1) 右侧对齐的行,单独成一段
  265. 2) 中间对齐的行,按照字体/行高聚合成一段
  266. 2. 左对齐的列表块(其特点是左侧顶格的行数小于等于非顶格的行数,非定格首字母会有小写,顶格90%是大写。并且左侧顶格行数大于1,大于1是为了这种模式连续出现才能称之为列表)
  267. 这样的文本块,顶格的为一个段落开头,紧随其后非顶格的行属于这个段落。
  268. """
  269. text_segments, list_start_line = __detect_list_lines(lines, new_layout_bbox, lang)
  270. """根据list_range,把lines分成几个部分
  271. """
  272. for list_start in list_start_line:
  273. if len(list_start) > 1:
  274. for i in range(1, len(list_start)):
  275. index = list_start[i] - 1
  276. if "content" in lines[index]["spans"][-1]:
  277. lines[index]["spans"][-1]["content"] += '\n\n'
  278. # layout_right = __find_layout_bbox_by_line(lines[0]['bbox'], new_layout_bbox)[2]
  279. # layout_left = __find_layout_bbox_by_line(lines[0]['bbox'], new_layout_bbox)[0]
  280. para = [] # 元素是line
  281. layout_list_info = [False, False] # 这个layout最后是不是列表,记录每一个layout里是不是列表开头,列表结尾
  282. for content_type, start, end in text_segments:
  283. if content_type == 'list':
  284. if start == 0 and is_start_list is None:
  285. layout_list_info[0] = True
  286. if end == total_lines - 1 and is_end_list is None:
  287. layout_list_info[1] = True
  288. # paras = __split_para_lines(lines, text_blocks)
  289. list_info.append(layout_list_info)
  290. return list_info
  291. def __split_para_lines(lines: list, text_blocks: list) -> list:
  292. text_paras = []
  293. other_paras = []
  294. text_lines = []
  295. for line in lines:
  296. spans_types = [span["type"] for span in line]
  297. if ContentType.Table in spans_types:
  298. other_paras.append([line])
  299. continue
  300. if ContentType.Image in spans_types:
  301. other_paras.append([line])
  302. continue
  303. if ContentType.InterlineEquation in spans_types:
  304. other_paras.append([line])
  305. continue
  306. text_lines.append(line)
  307. for block in text_blocks:
  308. block_bbox = block["bbox"]
  309. para = []
  310. for line in text_lines:
  311. bbox = line["bbox"]
  312. if is_in_layout(bbox, block_bbox):
  313. para.append(line)
  314. if len(para) > 0:
  315. text_paras.append(para)
  316. paras = other_paras.extend(text_paras)
  317. paras_sorted = sorted(paras, key = lambda x: x[0]["bbox"][1])
  318. return paras_sorted
  319. def __connect_list_inter_layout(blocks_group, new_layout_bbox, layout_list_info, page_num, lang):
  320. """
  321. 如果上个layout的最后一个段落是列表,下一个layout的第一个段落也是列表,那么将他们连接起来。 TODO 因为没有区分列表和段落,所以这个方法暂时不实现。
  322. 根据layout_list_info判断是不是列表。,下个layout的第一个段如果不是列表,那么看他们是否有几行都有相同的缩进。
  323. """
  324. if len(blocks_group) == 0 or len(blocks_group) == 0: # 0的时候最后的return 会出错
  325. return blocks_group, [False, False]
  326. for i in range(1, len(blocks_group)):
  327. if len(blocks_group[i]) == 0 or len(blocks_group[i-1]) == 0:
  328. continue
  329. pre_layout_list_info = layout_list_info[i - 1]
  330. next_layout_list_info = layout_list_info[i]
  331. pre_last_para = blocks_group[i - 1][-1].get("lines", [])
  332. next_paras = blocks_group[i]
  333. next_first_para = next_paras[0]
  334. if pre_layout_list_info[1] and not next_layout_list_info[0] and next_first_para["type"] == BlockType.Text: # 前一个是列表结尾,后一个是非列表开头,此时检测是否有相同的缩进
  335. logger.info(f"连接page {page_num} 内的list")
  336. # 向layout_paras[i] 寻找开头具有相同缩进的连续的行
  337. may_list_lines = []
  338. for j in range(len(next_paras)):
  339. lines = next_paras[j].get("lines", [])
  340. if len(lines) == 1: # 只可能是一行,多行情况再需要分析了
  341. if lines[0]['bbox'][0] > __find_layout_bbox_by_line(lines[0]['bbox'], new_layout_bbox)[0]:
  342. may_list_lines.append(lines[0])
  343. else:
  344. break
  345. else:
  346. break
  347. # 如果这些行的缩进是相等的,那么连到上一个layout的最后一个段落上。
  348. if len(may_list_lines) > 0 and len(set([x['bbox'][0] for x in may_list_lines])) == 1:
  349. pre_last_para.extend(may_list_lines)
  350. blocks_group[i] = blocks_group[i][len(may_list_lines):]
  351. # layout_paras[i] = layout_paras[i][len(may_list_lines):]
  352. return blocks_group, [layout_list_info[0][0], layout_list_info[-1][1]] # 同时还返回了这个页面级别的开头、结尾是不是列表的信息
  353. def __connect_list_inter_page(pre_page_paras, next_page_paras, pre_page_layout_bbox, next_page_layout_bbox,
  354. pre_page_list_info, next_page_list_info, page_num, lang):
  355. """
  356. 如果上个layout的最后一个段落是列表,下一个layout的第一个段落也是列表,那么将他们连接起来。 TODO 因为没有区分列表和段落,所以这个方法暂时不实现。
  357. 根据layout_list_info判断是不是列表。,下个layout的第一个段如果不是列表,那么看他们是否有几行都有相同的缩进。
  358. """
  359. if len(pre_page_paras) == 0 or len(next_page_paras) == 0: # 0的时候最后的return 会出错
  360. return False
  361. if len(pre_page_paras[-1]) == 0 or len(next_page_paras[0]) == 0:
  362. return False
  363. if pre_page_paras[-1][-1]["type"] != BlockType.Text or next_page_paras[0][0]["type"] != BlockType.Text:
  364. return False
  365. if pre_page_list_info[1] and not next_page_list_info[0]: # 前一个是列表结尾,后一个是非列表开头,此时检测是否有相同的缩进
  366. logger.info(f"连接page {page_num} 内的list")
  367. # 向layout_paras[i] 寻找开头具有相同缩进的连续的行
  368. may_list_lines = []
  369. for j in range(len(next_page_paras[0])):
  370. next_page_block_j = next_page_paras[0][j]
  371. if next_page_block_j["type"] != BlockType.Text:
  372. break
  373. lines = next_page_block_j["lines"]
  374. if len(lines) == 1: # 只可能是一行,多行情况再需要分析了
  375. if lines[0]['bbox'][0] > __find_layout_bbox_by_line(lines[0]['bbox'], next_page_layout_bbox)[0]:
  376. may_list_lines.append(lines[0])
  377. else:
  378. break
  379. else:
  380. break
  381. # 如果这些行的缩进是相等的,那么连到上一个layout的最后一个段落上。
  382. if len(may_list_lines) > 0 and len(set([x['bbox'][0] for x in may_list_lines])) == 1:
  383. #pre_page_paras[-1].append(may_list_lines)
  384. pre_page_paras[-1][-1]["lines"].extend(may_list_lines)
  385. next_page_paras[0] = next_page_paras[0][len(may_list_lines):]
  386. return True
  387. return False
  388. def __find_layout_bbox_by_line(line_bbox, layout_bboxes):
  389. """
  390. 根据line找到所在的layout
  391. """
  392. for layout in layout_bboxes:
  393. if is_in_layout(line_bbox, layout):
  394. return layout
  395. return None
  396. def __connect_para_inter_layoutbox(blocks_group, new_layout_bbox, lang):
  397. """
  398. layout之间进行分段。
  399. 主要是计算前一个layOut的最后一行和后一个layout的第一行是否可以连接。
  400. 连接的条件需要同时满足:
  401. 1. 上一个layout的最后一行沾满整个行。并且没有结尾符号。
  402. 2. 下一行开头不留空白。
  403. """
  404. connected_layout_paras = []
  405. connected_layout_blocks = []
  406. if len(blocks_group) == 0:
  407. return connected_layout_blocks
  408. #connected_layout_paras.append(layout_paras[0])
  409. connected_layout_blocks.append(blocks_group[0])
  410. for i in range(1, len(blocks_group)):
  411. try:
  412. if len(blocks_group[i]) == 0 or len(blocks_group[i - 1]) == 0: # TODO 考虑连接问题,
  413. continue
  414. # text类型的段才需要考虑layout间的合并
  415. if blocks_group[i - 1][-1]["type"] != BlockType.Text or blocks_group[i][0]["type"] != BlockType.Text:
  416. connected_layout_blocks.append(blocks_group[i])
  417. continue
  418. pre_last_line = blocks_group[i - 1][-1]["lines"][-1]
  419. next_first_line = blocks_group[i][0]["lines"][0]
  420. except Exception as e:
  421. logger.error(f"page layout {i} has no line")
  422. continue
  423. pre_last_line_text = ''.join([__get_span_text(span) for span in pre_last_line['spans']])
  424. pre_last_line_type = pre_last_line['spans'][-1]['type']
  425. next_first_line_text = ''.join([__get_span_text(span) for span in next_first_line['spans']])
  426. next_first_line_type = next_first_line['spans'][0]['type']
  427. if pre_last_line_type not in [TEXT, INLINE_EQUATION] or next_first_line_type not in [TEXT, INLINE_EQUATION]:
  428. #connected_layout_paras.append(layout_paras[i])
  429. connected_layout_blocks.append(blocks_group[i])
  430. continue
  431. pre_layout = __find_layout_bbox_by_line(pre_last_line['bbox'], new_layout_bbox)
  432. next_layout = __find_layout_bbox_by_line(next_first_line['bbox'], new_layout_bbox)
  433. pre_x2_max = pre_layout[2] if pre_layout else -1
  434. next_x0_min = next_layout[0] if next_layout else -1
  435. pre_last_line_text = pre_last_line_text.strip()
  436. next_first_line_text = next_first_line_text.strip()
  437. if pre_last_line['bbox'][2] == pre_x2_max and pre_last_line_text[-1] not in LINE_STOP_FLAG and \
  438. next_first_line['bbox'][0] == next_x0_min: # 前面一行沾满了整个行,并且没有结尾符号.下一行没有空白开头。
  439. """连接段落条件成立,将前一个layout的段落和后一个layout的段落连接。"""
  440. #connected_layout_paras[-1][-1].extend(layout_paras[i][0])
  441. connected_layout_blocks[-1][-1]["lines"].extend(blocks_group[i][0]["lines"])
  442. #layout_paras[i].pop(0) # 删除后一个layout的第一个段落, 因为他已经被合并到前一个layout的最后一个段落了。
  443. blocks_group[i][0]["lines"] = [] #删除后一个layout第一个段落中的lines,因为他已经被合并到前一个layout的最后一个段落了
  444. blocks_group[i][0]["lines_deleted"] = True
  445. # if len(layout_paras[i]) == 0:
  446. # layout_paras.pop(i)
  447. # else:
  448. # connected_layout_paras.append(layout_paras[i])
  449. connected_layout_blocks.append(blocks_group[i])
  450. else:
  451. """连接段落条件不成立,将前一个layout的段落加入到结果中。"""
  452. #connected_layout_paras.append(layout_paras[i])
  453. connected_layout_blocks.append(blocks_group[i])
  454. return connected_layout_blocks
  455. def __connect_para_inter_page(pre_page_paras, next_page_paras, pre_page_layout_bbox, next_page_layout_bbox, page_num,
  456. lang):
  457. """
  458. 连接起来相邻两个页面的段落——前一个页面最后一个段落和后一个页面的第一个段落。
  459. 是否可以连接的条件:
  460. 1. 前一个页面的最后一个段落最后一行沾满整个行。并且没有结尾符号。
  461. 2. 后一个页面的第一个段落第一行没有空白开头。
  462. """
  463. # 有的页面可能压根没有文字
  464. if len(pre_page_paras) == 0 or len(next_page_paras) == 0 or len(pre_page_paras[0]) == 0 or len(
  465. next_page_paras[0]) == 0: # TODO [[]]为什么出现在pre_page_paras里?
  466. return False
  467. pre_last_block = pre_page_paras[-1][-1]
  468. next_first_block = next_page_paras[0][0]
  469. if pre_last_block["type"] != BlockType.Text or next_first_block["type"] != BlockType.Text:
  470. return False
  471. if len(pre_last_block["lines"]) == 0 or len(next_first_block["lines"]) == 0:
  472. return False
  473. pre_last_para = pre_last_block["lines"]
  474. next_first_para = next_first_block["lines"]
  475. pre_last_line = pre_last_para[-1]
  476. next_first_line = next_first_para[0]
  477. pre_last_line_text = ''.join([__get_span_text(span) for span in pre_last_line['spans']])
  478. pre_last_line_type = pre_last_line['spans'][-1]['type']
  479. next_first_line_text = ''.join([__get_span_text(span) for span in next_first_line['spans']])
  480. next_first_line_type = next_first_line['spans'][0]['type']
  481. if pre_last_line_type not in [TEXT, INLINE_EQUATION] or next_first_line_type not in [TEXT,
  482. INLINE_EQUATION]: # TODO,真的要做好,要考虑跨table, image, 行间的情况
  483. # 不是文本,不连接
  484. return False
  485. pre_x2_max = __find_layout_bbox_by_line(pre_last_line['bbox'], pre_page_layout_bbox)[2]
  486. next_x0_min = __find_layout_bbox_by_line(next_first_line['bbox'], next_page_layout_bbox)[0]
  487. pre_last_line_text = pre_last_line_text.strip()
  488. next_first_line_text = next_first_line_text.strip()
  489. if pre_last_line['bbox'][2] == pre_x2_max and pre_last_line_text[-1] not in LINE_STOP_FLAG and \
  490. next_first_line['bbox'][0] == next_x0_min: # 前面一行沾满了整个行,并且没有结尾符号.下一行没有空白开头。
  491. """连接段落条件成立,将前一个layout的段落和后一个layout的段落连接。"""
  492. pre_last_para.extend(next_first_para)
  493. #next_page_paras[0].pop(0) # 删除后一个页面的第一个段落, 因为他已经被合并到前一个页面的最后一个段落了。
  494. next_page_paras[0][0]["lines"] = []
  495. next_page_paras[0][0]["lines_deleted"] = True
  496. return True
  497. else:
  498. return False
  499. def find_consecutive_true_regions(input_array):
  500. start_index = None # 连续True区域的起始索引
  501. regions = [] # 用于保存所有连续True区域的起始和结束索引
  502. for i in range(len(input_array)):
  503. # 如果我们找到了一个True值,并且当前并没有在连续True区域中
  504. if input_array[i] and start_index is None:
  505. start_index = i # 记录连续True区域的起始索引
  506. # 如果我们找到了一个False值,并且当前在连续True区域中
  507. elif not input_array[i] and start_index is not None:
  508. # 如果连续True区域长度大于1,那么将其添加到结果列表中
  509. if i - start_index > 1:
  510. regions.append((start_index, i - 1))
  511. start_index = None # 重置起始索引
  512. # 如果最后一个元素是True,那么需要将最后一个连续True区域加入到结果列表中
  513. if start_index is not None and len(input_array) - start_index > 1:
  514. regions.append((start_index, len(input_array) - 1))
  515. return regions
  516. def __connect_middle_align_text(page_paras, new_layout_bbox, page_num, lang, debug_mode):
  517. """
  518. 找出来中间对齐的连续单行文本,如果连续行高度相同,那么合并为一个段落。
  519. 一个line居中的条件是:
  520. 1. 水平中心点跨越layout的中心点。
  521. 2. 左右两侧都有空白
  522. """
  523. for layout_i, layout_para in enumerate(page_paras):
  524. layout_box = new_layout_bbox[layout_i]
  525. single_line_paras_tag = []
  526. for i in range(len(layout_para)):
  527. #single_line_paras_tag.append(len(layout_para[i]) == 1 and layout_para[i][0]['spans'][0]['type'] == TEXT)
  528. single_line_paras_tag.append(layout_para[i]['type'] == BlockType.Text and len(layout_para[i]["lines"]) == 1)
  529. """找出来连续的单行文本,如果连续行高度相同,那么合并为一个段落。"""
  530. consecutive_single_line_indices = find_consecutive_true_regions(single_line_paras_tag)
  531. if len(consecutive_single_line_indices) > 0:
  532. #index_offset = 0
  533. """检查这些行是否是高度相同的,居中的"""
  534. for start, end in consecutive_single_line_indices:
  535. #start += index_offset
  536. #end += index_offset
  537. line_hi = np.array([block["lines"][0]['bbox'][3] - block["lines"][0]['bbox'][1] for block in layout_para[start:end + 1]])
  538. first_line_text = ''.join([__get_span_text(span) for span in layout_para[start]["lines"][0]['spans']])
  539. if "Table" in first_line_text or "Figure" in first_line_text:
  540. pass
  541. if debug_mode:
  542. logger.info(line_hi.std())
  543. if line_hi.std() < 2:
  544. """行高度相同,那么判断是否居中"""
  545. all_left_x0 = [block["lines"][0]['bbox'][0] for block in layout_para[start:end + 1]]
  546. all_right_x1 = [block["lines"][0]['bbox'][2] for block in layout_para[start:end + 1]]
  547. layout_center = (layout_box[0] + layout_box[2]) / 2
  548. if all([x0 < layout_center < x1 for x0, x1 in zip(all_left_x0, all_right_x1)]) \
  549. and not all([x0 == layout_box[0] for x0 in all_left_x0]) \
  550. and not all([x1 == layout_box[2] for x1 in all_right_x1]):
  551. merge_para = [block["lines"][0] for block in layout_para[start:end + 1]]
  552. para_text = ''.join([__get_span_text(span) for line in merge_para for span in line['spans']])
  553. if debug_mode:
  554. logger.info(para_text)
  555. layout_para[start]["lines"] = merge_para
  556. for i_para in range(start+1, end+1):
  557. layout_para[i_para]["lines"] = []
  558. layout_para[i_para]["lines_deleted"] = True
  559. #layout_para[start:end + 1] = [merge_para]
  560. #index_offset -= end - start
  561. return
  562. def __merge_signle_list_text(page_paras, new_layout_bbox, page_num, lang):
  563. """
  564. 找出来连续的单行文本,如果首行顶格,接下来的几个单行段落缩进对齐,那么合并为一个段落。
  565. """
  566. pass
  567. def __do_split_page(blocks, layout_bboxes, new_layout_bbox, page_num, lang):
  568. """
  569. 根据line和layout情况进行分段
  570. 先实现一个根据行末尾特征分段的简单方法。
  571. """
  572. """
  573. 算法思路:
  574. 1. 扫描layout里每一行,找出来行尾距离layout有边界有一定距离的行。
  575. 2. 从上述行中找到末尾是句号等可作为断行标志的行。
  576. 3. 参照上述行尾特征进行分段。
  577. 4. 图、表,目前独占一行,不考虑分段。
  578. """
  579. blocks_group = __group_line_by_layout(blocks, layout_bboxes, lang) # block内分段
  580. layout_list_info = __split_para_in_layoutbox(blocks_group, new_layout_bbox, lang) # layout内分段
  581. blocks_group, page_list_info = __connect_list_inter_layout(blocks_group, new_layout_bbox, layout_list_info,
  582. page_num, lang) # layout之间连接列表段落
  583. connected_layout_blocks = __connect_para_inter_layoutbox(blocks_group, new_layout_bbox, lang) # layout间链接段落
  584. return connected_layout_blocks, page_list_info
  585. def para_split(pdf_info_dict, debug_mode, lang="en"):
  586. new_layout_of_pages = [] # 数组的数组,每个元素是一个页面的layoutS
  587. all_page_list_info = [] # 保存每个页面开头和结尾是否是列表
  588. for page_num, page in pdf_info_dict.items():
  589. blocks = page['preproc_blocks']
  590. layout_bboxes = page['layout_bboxes']
  591. new_layout_bbox = __common_pre_proc(blocks, layout_bboxes)
  592. new_layout_of_pages.append(new_layout_bbox)
  593. splited_blocks, page_list_info = __do_split_page(blocks, layout_bboxes, new_layout_bbox, page_num, lang)
  594. all_page_list_info.append(page_list_info)
  595. page['para_blocks'] = splited_blocks
  596. """连接页面与页面之间的可能合并的段落"""
  597. pdf_infos = list(pdf_info_dict.values())
  598. for page_num, page in enumerate(pdf_info_dict.values()):
  599. if page_num == 0:
  600. continue
  601. pre_page_paras = pdf_infos[page_num - 1]['para_blocks']
  602. next_page_paras = pdf_infos[page_num]['para_blocks']
  603. pre_page_layout_bbox = new_layout_of_pages[page_num - 1]
  604. next_page_layout_bbox = new_layout_of_pages[page_num]
  605. is_conn = __connect_para_inter_page(pre_page_paras, next_page_paras, pre_page_layout_bbox,
  606. next_page_layout_bbox, page_num, lang)
  607. if debug_mode:
  608. if is_conn:
  609. logger.info(f"连接了第{page_num - 1}页和第{page_num}页的段落")
  610. is_list_conn = __connect_list_inter_page(pre_page_paras, next_page_paras, pre_page_layout_bbox,
  611. next_page_layout_bbox, all_page_list_info[page_num - 1],
  612. all_page_list_info[page_num], page_num, lang)
  613. if debug_mode:
  614. if is_list_conn:
  615. logger.info(f"连接了第{page_num - 1}页和第{page_num}页的列表段落")
  616. """接下来可能会漏掉一些特别的一些可以合并的内容,对他们进行段落连接
  617. 1. 正文中有时出现一个行顶格,接下来几行缩进的情况。
  618. 2. 居中的一些连续单行,如果高度相同,那么可能是一个段落。
  619. """
  620. for page_num, page in enumerate(pdf_info_dict.values()):
  621. page_paras = page['para_blocks']
  622. new_layout_bbox = new_layout_of_pages[page_num]
  623. __connect_middle_align_text(page_paras, new_layout_bbox, page_num, lang, debug_mode=debug_mode)
  624. __merge_signle_list_text(page_paras, new_layout_bbox, page_num, lang)
  625. # layout展平
  626. for page_num, page in enumerate(pdf_info_dict.values()):
  627. page_paras = page['para_blocks']
  628. page_blocks = [block for layout in page_paras for block in layout]
  629. page["para_blocks"] = page_blocks