para_split_v2.py 36 KB

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