para_split_v2.py 36 KB

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