para_split_v2.py 36 KB

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